Search arXivSearch

arXiv · 2401.00759

A note on a flip-connected class of generalized domino tilings of the box $[0,2]^n$

Abstract

Let $n,d\in \mathbb{N}$ and $n>d$. An $(n-d)$-domino is a box $I_1\times \cdots \times I_n$ such that $I_j\in \{[0,1],[1,2]\}$ for all $j\in N\subset [n]$ with $|N|=d$ and $I_i=[0,2]$ for every $i\in [n]\setminus N$. If $A$ and $B$ are two $(n-d)$-dominoes such that $A\cup B$ is an $(n-(d-1))$-domino, then $A,B$ is called a twin pair. If $C,D$ are two $(n-d)$-dominoes which form a twin pair such that $A\cup B=C\cup D$ and $\{C,D\}\neq \{A,B\}$, then the pair $C,D$ is called a flip of $A,B$. A family $\mathscr{D}$ of $(n-d)$-dominoes is a tiling of the box $[0,2]^n$ if interiors of every two members of $\mathscr{D}$ are disjoint and $\bigcup_{B\in \mathscr{D}}B=[0,2]^n$. An $(n-d)$-domino tiling $\mathscr{D}'$ is obtained from an $(n-d)$-domino tiling $\mathscr{D}$ by a flip, if there is a twin pair $A,B\in \mathscr{D}$ such that $\mathscr{D}'=(\mathscr{D}\setminus \{A,B\})\cup \{C,D\}$, where $C,D$ is a flip of $A,B$. A family of $(n-d)$-domino tilings of the box $[0,2]^n$ is flip-connected, if for every two members $\mathscr{D},\mathscr{E}$ of this family the tiling $\mathscr{E}$ can be obtained from $\mathscr{D}$ by a sequence of flips. In the paper some flip-connected class of $(n-d)$-domino tilings of the box $[0,2]^n$ is described.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrzej P. Kisielewicz. 2024-01-01. A note on a flip-connected class of generalized domino tilings of the box $[0,2]^n$. https://arxiv.org/abs/2401.00759

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO