English
Related papers

Related papers: Components of domino tilings under flips in quadri…

200 papers

A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that covers all vertices of $G$. Motivated by papers of Bush and Zhao and of Balogh, Treglown, and Wagner, we determine the threshold for…

Combinatorics · Mathematics 2024-11-20 Enrique Gomez-Leos , Ryan R. Martin

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

Combinatorics · Mathematics 2023-04-13 Alexander E. Black , Kevin Liu , Alex Mcdonough , Garrett Nelson , Michael C. Wigal , Mei Yin , Youngho Yoo

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…

Combinatorics · Mathematics 2007-05-23 Sebastien Desreux , Martin Matamala , Ivan Rapaport , Eric Remila

We consider the dimer problem on a non-bipartite graph $G$, where there are two types of dimers one of which we regard impurities. Results of simulations using Markov chain seem to indicate that impurities are tend to distribute on the…

Combinatorics · Mathematics 2015-05-13 Fumihiko Nakano , Taizo Sadahiro

A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…

Computational Geometry · Computer Science 2025-06-10 Therese Biedl , Philipp Kindermann , Jonathan Klawitter

Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…

Combinatorics · Mathematics 2019-04-09 Duško Jojić

Given a graph $G$ with vertex set $\{1,\ldots,n\}$, we can project the graphical arrangement of $G$ to an $(n-1)$-dimensional torus to obtain a toric hyperplane arrangement. Adams, Defant, and Striker constructed a toric combinatorial…

Combinatorics · Mathematics 2025-04-29 Colin Defant , Derek Liu

We consider domino tilings of 3D cubiculated regions. The tilings have two invariants, flux and twist, often integer-valued, which are given in purely combinatorial terms. These invariants allow one to classify the tilings with respect to…

Combinatorics · Mathematics 2025-03-14 Boris Khesin , Nicolau C. Saldanha

We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.

Combinatorics · Mathematics 2007-05-23 Nicolau C. Saldanha , Carlos Tomei

In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…

Combinatorics · Mathematics 2021-09-06 Ho Man Cheung , Hoi Ping Luk

This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the…

Geometric Topology · Mathematics 2017-08-22 Hugo Parlier , Lionel Pournin

We study flip-graphs of triangulations on topological surfaces where distance is measured by counting the number of necessary flip operations between two triangulations. We focus on surfaces of positive genus $g$ with a single boundary…

Geometric Topology · Mathematics 2017-09-04 Hugo Parlier , Lionel Pournin

We examine domino tilings of rectangular boards, which are in natural bijection with perfect matchings of grid graphs. This leads to the study of their associated perfect matching polytopes, and we present some of their properties, in…

Combinatorics · Mathematics 2009-12-15 Matthias Beck , Christian Haase , Steven V. Sam

We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…

Combinatorics · Mathematics 2011-01-04 Mathieu Dutour Sikirić

As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…

Combinatorics · Mathematics 2015-06-12 Fumihiko Nakano , Taizo Sadahiro

In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on a set of $2n$ points that are placed equidistantly on the…

Combinatorics · Mathematics 2020-10-12 Marcel Milich , Torsten Mütze , Martin Pergel

In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…

Combinatorics · Mathematics 2026-04-08 William Jockusch , James Propp , Peter Shor

The well-known twenty types of 2-uniform tilings of the plane give rise infinitely many doubly semi-equivelar maps on the torus. In this article, we show that every such doubly semi-equivelar map on the torus contains a Hamiltonian cycle.…

Combinatorics · Mathematics 2021-10-19 Yogendra Singh , Anand Kumar Tiwari , Seema Kushwaha

We consider three-dimensional domino tilings of cylinders $\mathcal{D} \times [0,N] \subset \mathbb{R}^3$, where $\mathcal{D} \subset \mathbb{R}^2$ is a balanced quadriculated disk and $N \in \mathbb{N}$. A flip is a local move in the space…

Combinatorics · Mathematics 2025-02-03 Raphael de Marreiros

Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…