English
Related papers

Related papers: Sandpiles and Dominos

200 papers

Louis W. Shapiro gave a combinatorial proof of a bilinear generating function for Chebyshev polynomials equivalent to the formula 1/(1-ax-x^2) * 1/(1-bx-x^2) = (1-x^2)/(1-abx-(2+a^2+b^2)x^2 -abx^3+x^4), where * denotes the Hadamard product.…

Combinatorics · Mathematics 2011-07-21 Jong Hyun Kim

The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…

Information Theory · Computer Science 2019-04-26 Gabriella Akemi Miyamoto

The abelian sandpile models feature a finite abelian group $G$ generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of $G$ as a product of cyclic groups $G = Z_{d_1} \times…

Condensed Matter · Physics 2009-10-22 D. Dhar , P. Ruelle , S. Sen , D. -N. Verma

The expanded Aztec diamond is a generalized version of the Aztec diamond, with an arbitrary number of long columns and long rows in the middle. In this paper, we count the number of domino tilings of the expanded Aztec diamond. The exact…

Combinatorics · Mathematics 2017-11-02 Seungsang Oh

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…

Combinatorics · Mathematics 2013-05-10 Igor Pak , Jed Yang

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…

Combinatorics · Mathematics 2016-09-14 Richard J. Mathar

Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…

Combinatorics · Mathematics 2007-05-23 Richard Kenyon , Scott Sheffield

We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.

Combinatorics · Mathematics 2024-11-01 Fateh Aliyev , Nikita Gladkov

The article considers the procedure of connection of graphs to the edges of a cyclic graph and its influence on the sandpile group of the graph thus obtained. A series of classes of graphs CH_n(a_1,...,a_n) is defined. Recurrent and…

Combinatorics · Mathematics 2013-10-15 I. A. Krepkiy

We exhibit a weakly aperiodic tile set for Baumslag-Solitar groups, and prove that the domino problem is undecidable on these groups. A consequence of our construction is the existence of an arecursive tile set on Baumslag-Solitar groups.

Discrete Mathematics · Computer Science 2013-09-06 Nathalie Aubrun , Jarkko Kari

In their unpublished work, Jockusch and Propp showed that a 2-enumeration of antisymmetric monotone triangles is given by a simple product formula. On the other hand, the author proved that the same formula counts the domino tilings of the…

Combinatorics · Mathematics 2015-07-21 Tri Lai

We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…

Combinatorics · Mathematics 2012-06-28 Jon Schneider

Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…

Combinatorics · Mathematics 2026-04-29 Chunlin Li , Erxiao Wang , Wu Jie , Min Yan

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…

Combinatorics · Mathematics 2024-01-02 Andrzej P. Kisielewicz

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

Metric Geometry · Mathematics 2012-10-08 Yohji Akama

In this paper we consider domino tilings of the Aztec diamond with doubly periodic weightings. In particular a family of models which, for any $ k \in \mathbb{N} $, includes models with $ k $ smooth regions is analyzed as the size of the…

Probability · Mathematics 2020-01-14 Tomas Berggren

In this paper, we consider the set of all domino tilings of a cubiculated region. The primary question we explore is: How can we move from one tiling to another? Tiling spaces can be viewed as spaces of subgraphs of a fixed graph with a…

Combinatorics · Mathematics 2021-02-09 Elizabeth Gross , Nicole Yamzon

Associated to a convex integral polygon $N$ is a cluster integrable system $\mathcal X_N$ constructed from the dimer model. We compute the group $G_N$ of symmetries of $\mathcal X_N$, called the (2-2) cluster modular group, showing that it…

Combinatorics · Mathematics 2021-11-16 Terrence George , Giovanni Inchiostro

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