25 research outputs found

    Domino tilings and related models: space of configurations of domains with holes

    Get PDF
    We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not necessarily local) transformations called {\em flips}. This study allows us to formulate an exhaustive generation algorithm and a uniform random sampling algorithm. We finally extend these results to other types of tilings (calisson tilings, tilings with bicolored Wang tiles).Comment: 17 pages, 11 figure

    Fast domino tileability

    Get PDF
    Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly linear time in the perimeter.Comment: Appeared in Discrete Comput. Geom. 56 (2016), 377-39

    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

    Tilings of quadriculated annuli

    Get PDF
    Tilings of a quadriculated annulus A are counted according to volume (in the formal variable q) and flux (in p). We consider algebraic properties of the resulting generating function Phi_A(p,q). For q = -1, the non-zero roots in p must be roots of unity and for q > 0, real negative.Comment: 33 pages, 12 figures; Minor changes were made to make some passages cleare

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

    Full text link
    Let n,d∈Nn,d\in \mathbb{N} and n>dn>d. An (nβˆ’d)(n-d)-domino is a box I1Γ—β‹―Γ—InI_1\times \cdots \times I_n such that Ij∈{[0,1],[1,2]}I_j\in \{[0,1],[1,2]\} for all j∈NβŠ‚[n]j\in N\subset [n] with ∣N∣=d|N|=d and Ii=[0,2]I_i=[0,2] for every i∈[n]βˆ–Ni\in [n]\setminus N. If AA and BB are two (nβˆ’d)(n-d)-dominoes such that AβˆͺBA\cup B is an (nβˆ’(dβˆ’1))(n-(d-1))-domino, then A,BA,B is called a twin pair. If C,DC,D are two (nβˆ’d)(n-d)-dominoes which form a twin pair such that AβˆͺB=CβˆͺDA\cup B=C\cup D and {C,D}β‰ {A,B}\{C,D\}\neq \{A,B\}, then the pair C,DC,D is called a flip of A,BA,B. A family D\mathscr{D} of (nβˆ’d)(n-d)-dominoes is a tiling of the box [0,2]n[0,2]^n if interiors of every two members of D\mathscr{D} are disjoint and ⋃B∈DB=[0,2]n\bigcup_{B\in \mathscr{D}}B=[0,2]^n. An (nβˆ’d)(n-d)-domino tiling Dβ€²\mathscr{D}' is obtained from an (nβˆ’d)(n-d)-domino tiling D\mathscr{D} by a flip, if there is a twin pair A,B∈DA,B\in \mathscr{D} such that Dβ€²=(Dβˆ–{A,B})βˆͺ{C,D}\mathscr{D}'=(\mathscr{D}\setminus \{A,B\})\cup \{C,D\}, where C,DC,D is a flip of A,BA,B. A family of (nβˆ’d)(n-d)-domino tilings of the box [0,2]n[0,2]^n is flip-connected, if for every two members D,E\mathscr{D},\mathscr{E} of this family the tiling E\mathscr{E} can be obtained from D\mathscr{D} by a sequence of flips. In the paper some flip-connected class of (nβˆ’d)(n-d)-domino tilings of the box [0,2]n[0,2]^n is described

    Cut-and-paste of quadriculated disks and arithmetic properties of the adjacency matrix

    Get PDF
    We define cut-and-paste, a construction which, given a quadriculated disk obtains a disjoint union of quadriculated disks of smaller total area. We provide two examples of the use of this procedure as a recursive step. Tilings of a disk Ξ”\Delta receive a parity: we construct a perfect or near-perfect matching of tilings of opposite parities. Let BΞ”B_\Delta be the black-to-white adjacency matrix: we factor BΞ”=LD~UB_\Delta = L\tilde DU, where LL and UU are lower and upper triangular matrices, D~\tilde D is obtained from a larger identity matrix by removing rows and columns and all entries of LL, D~\tilde D and UU are equal to 0, 1 or -1.Comment: 20 pages, 17 figure
    corecore