Search arXivSearch

arXiv · 2209.03109

3D domino tilings: irregular disks and connected components under flips

Abstract

We consider three-dimensional domino tilings of cylinders $\mathcal{R}_N = \mathcal{D} \times [0,N]$ where $\mathcal{D} \subset \mathbb{R}^2$ is a fixed quadriculated disk and $N \in \mathbb{N}$. A domino is a $2 \times 1 \times 1$ brick. A flip is a local move in the space of tilings $\mathcal{T}(\mathcal{R}_N)$: remove two adjacent dominoes and place them back after a rotation. The twist is a flip invariant which associates an integer number to each tiling. For some disks $\mathcal{D}$, called regular, two tilings of $\mathcal{R}_N$ with the same twist can be joined by a sequence of flips once we add vertical space to the cylinder. We have that if $\mathcal{D}$ is regular then the size of the largest connected component under flips of $\mathcal{T}(\mathcal{R}_N)$ is $Θ(N^{-\frac{1}{2}}|\mathcal{T}(\mathcal{R}_N)|)$. The domino group $G_{\mathcal{D}}$ captures information of the space of tilings. A disk $\mathcal{D}$ is regular if and only if $G_{\mathcal{D}}$ is isomorphic to $\mathbb{Z} \oplus \mathbb{Z}/(2)$; sufficiently large rectangles are regular. We prove that certain families of disks are irregular. We show that the existence of a bottleneck in a disk $\mathcal{D}$ often implies irregularity. In many, but not all, of these cases, we also prove that $\mathcal{D}$ is strongly irregular, i.e., that there exists a surjective homomorphism from $G_{\mathcal{D}}^+$ (a subgroup of index two of $G_{\mathcal{D}}$) to the free group of rank two. Moreover, we show that if $\mathcal{D}$ is strongly irregular then the cardinality of the largest connected component under flips of $\mathcal{T}(\mathcal{R}_N)$ is $O(c^N |\mathcal{T}(\mathcal{R}_N)|)$ for some $c \in (0,1)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raphael de Marreiros. 2024-12-22. 3D domino tilings: irregular disks and connected components under flips. https://arxiv.org/abs/2209.03109

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO