Related papers: Dimers, Tilings and Trees
In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In…
We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…
We study partition functions for the dimer model on families of finite graphs converging to infinite self-similar graphs and forming approximation sequences to certain well-known fractals. The graphs that we consider are provided by actions…
A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In…
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…
In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
In this work we study the variational problem associated to dimer models, a class of models from integrable probability and statistical mechanics in dimension two which have been the focus of intense research efforts over the last decades.…
In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…
A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…
We construct, for every $d \geq 3$, a $d$-regular acyclic measurably bipartite graphing that admits no measurable perfect matching, resolving a problem of Kechris and Marks. A dense variant of our construction yields a coupling of two…
The family of right-angled tiling links consists of links built from regular 4-valent tilings of constant-curvature surfaces that contain one or two types of tiles. The complements of these links admit complete hyperbolic structures and…
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two…
This is the first article in a series of two papers in which we study the Temperleyan dimer model on an arbitrary bounded Riemann surface of finite topolgical type. The end goal of both papers is to prove the convergence of height…
We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…
In this article the authors continue the discussion in \cite{ALM} about inverse problems for second order elliptic and hyperbolic equations on metric trees from boundary measurements. In the present paper we prove the identifiability of…
On a finite graph with a chosen partition of the vertex set into interior and boundary vertices, a $\lambda$-polyharmonic function is a complex function $f$ on the vertex set which satisfies $(\lambda \cdot I - P)^n f(x) = 0$ at each…
Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…
For a large class of tilings, including the Penrose tiling in two dimension as well as the icosahedral ones in 3 dimension, the continuous hull of such a tiling inherits a minimal lamination structure with flat leaves and a transversal…