Search arXivSearch

arXiv · 2507.22625

Domino tilings beyond 2D

Abstract

There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does the space of all tilings look like? These questions and their answers become significantly more difficult in dimension three and above. Despite this curse of dimensionality, there have been exciting recent advances in the theory. Here we briefly review foundational results of two-dimensional domino tilings and highlight where challenges arise when generalizing to higher dimensions. We then survey results in higher dimensional domino tilings, focusing on the question of connectivity of the space of tilings, and the open problems that still remain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Caroline J. Klivans, Nicolau C. Saldanha. 2025-07-30. Domino tilings beyond 2D. https://arxiv.org/abs/2507.22625

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

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO