11 research outputs found

    Flip invariance for domino tilings of three-dimensional regions with two floors

    Full text link
    We investigate tilings of cubiculated regions with two simply connected floors by 2 x 1 x 1 bricks. More precisely, we study the flip connected component for such tilings, and provide an algebraic invariant that "almost" characterizes the flip connected components of such regions, in a sense that we discuss in the paper. We also introduce a new local move, the trit, which, together with the flip, connects the space of domino tilings when the two floors are identical.Comment: 33 pages, 34 figures, 2 tables. We updated the reference lis

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

    Full text link
    We consider three-dimensional domino tilings of cylinders RN=D×[0,N]R_N = D \times [0,N] where D⊂R2D \subset \mathbb{R}^2 is a fixed quadriculated disk and N∈NN \in \mathbb{N}. A flip is a local move in the space of tilings T(RN)\mathcal{T}(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 DD, called regular, two tilings of RNR_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 DD is regular then the size of the largest connected component under flips of T(RN)\mathcal{T}(R_N) is Θ(N−12∣T(RN)∣)\Theta(N^{-\frac{1}{2}}|\mathcal{T}(R_N)|). The domino group GDG_D captures information of the space of tilings. It is known that DD is regular if and only if GDG_{D} is isomorphic to Z⊕Z/(2)\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 DD often implies irregularity. In many, but not all, of these cases, we also prove that DD is strongly irregular, i.e., that there exists a surjective homomorphism from GD+G_{D}^+ (a subgroup of index two of GDG_{D}) to the free group of rank two. Moreover, we show that if DD is strongly irregular then the cardinality of the largest connected component under flips of T(RN)\mathcal{T}(R_N) is O(cN∣T(RN)∣)O(c^N |\mathcal{T}(R_N)|) for some c∈(0,1)c \in (0,1).Comment: 35 pages, 29 figure

    Domino tilings and flips in dimensions 4 and higher

    Get PDF
    In this paper we consider domino tilings of bounded regions in dimension n≥4n \geq 4. We define the twist of such a tiling, an elements of Z/(2){\mathbb{Z}}/(2), and prove it is invariant under flips, a simple local move in the space of tilings. We investigate which regions DD are regular, i.e. whenever two tilings t0t_0 and t1t_1 of D×[0,N]D \times [0,N] have the same twist then t0t_0 and t1t_1 can be joined by a sequence of flips provided some extra vertical space is allowed. We prove that all boxes are regular except D=[0,2]3D = [0,2]^3. Furthermore, given a regular region DD, we show that there exists a value MM (depending only on DD) such that if t0t_0 and t1t_1 are tilings of equal twist of D×[0,N]D \times [0,N] then the corresponding tilings can be joined by a finite sequence of flips in D×[0,N+M]D \times [0,N+M]. As a corollary we deduce that, for regular DD and large NN, the set of tilings of D×[0,N]D \times [0,N] has two twin giant components under flips, one for each value of the twist.Comment: 28 pages, 14 figure

    Domino tilings of three-dimensional regions: flips, trits and twists

    Full text link
    In this paper, we consider domino tilings of regions of the form D×[0,n]\mathcal{D} \times [0,n], where D\mathcal{D} is a simply connected planar region and n∈Nn \in \mathbb{N}. It turns out that, in nontrivial examples, the set of such tilings is not connected by flips, i.e., the local move performed by removing two adjacent dominoes and placing them back in another position. We define an algebraic invariant, the twist, which partially characterizes the connected components by flips of the space of tilings of such a region. Another local move, the trit, consists of removing three adjacent dominoes, no two of them parallel, and placing them back in the only other possible position: performing a trit alters the twist by ±1\pm 1. We give a simple combinatorial formula for the twist, as well as an interpretation via knot theory. We prove several results about the twist, such as the fact that it is an integer and that it has additive properties for suitable decompositions of a region.Comment: 38 pages, 17 figures. Most of this material is also covered in the first author's Ph.D. thesis (arXiv:1503.04617

    Local dimer dynamics in higher dimensions

    Full text link
    We consider local dynamics of the dimer model (perfect matchings) on hypercubic boxes [n]d[n]^d. These consist of successively switching the dimers along alternating cycles of prescribed (small) lengths. We study the connectivity properties of the dimer configuration space equipped with these transitions. Answering a question of Freire, Klivans, Milet and Saldanha, we show that in three dimensions any configuration admits an alternating cycle of length at most 6. We further establish that any configuration on [n]d[n]^d features order nd−2n^{d-2} alternating cycles of length at most 4d−24d-2. We also prove that the dynamics of dimer configurations on the unit hypercube of dimension dd is ergodic when switching alternating cycles of length at most 4d−44d-4. Finally, in the planar but non-bipartite case, we show that parallelogram-shaped boxes in the triangular lattice are ergodic for switching alternating cycles of lengths 4 and 6 only, thus improving a result of Kenyon and R\'emila, which also uses 8-cycles. None of our proofs make reference to height functions.Comment: 14 pages, 4 figure

    Enumerative Combinatorics

    Get PDF
    Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science. This workshop brought together experts from all these various fields, including also computer algebra, with the goal of promoting cooperation and interaction among researchers with largely varying backgrounds
    corecore