相关论文: Dimers, Tilings and Trees

We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…

We introduce {\em quadri-tilings} and show that they are in bijection with dimer models on a {\em family} of graphs $\{R^*\}$ arising from rhombus tilings. Using two height functions, we interpret a sub-family of all quadri-tilings, called…

We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…

We analyze the geometry of domain Markov half planar triangulations. In \cite{AR13} it is shown that there exists a one-parameter family of measures supported on half planar triangulations satisfying translation invariance and domain Markov…

We prove a conjecture on the relation between dimer models, coamoebas and vanishing cycles for the mirrors of two-dimensional toric Fano stacks of Picard number one. As a corollary, we obtain a torus-equivariant version of homological…

A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a…

R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the…

A famous conjecture of Stanley states that his chromatic symmetric function distinguishes trees. As a quasisymmetric analogue, we conjecture that the chromatic quasisymmetric function of Shareshian and Wachs and of Ellzey distinguishes…

We study sigma-ideals and regularity properties related to the "filter-Laver" and "dual-filter-Laver" forcing partial orders. An important innovation which enables this study is a dichotomy theorem proved recently by Miller [1]. [1] Arnold…

We associate strand diagrams to tilings of surfaces with marked points, generalising Scott's method for triangulations of polygons. We thus obtain a map from tilings of surfaces to permutations of the marked points on boundary components,…

The purpose of this paper is to show the relationship in all dimensions between the structural (diffraction pattern) aspect of tilings (described by \v{C}ech cohomology of the tiling space) and the spectral properties (of Hamiltonians…

We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…

The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…

Let $f, g: \mathbb{R}^2 \to \mathbb{R}$ be two submersion functions and $\mathscr{F}(f)$ and $\mathscr{F}(g)$ be the regular foliations of $\mathbb{R}^2$ whose leaves are the connected components of the levels sets of $f$ and $g$,…

We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial, and the chromatic…

We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…

On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…

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…

We prove that for every countable string graph $S$, there is a planar graph $G$ with $V(G)=V(S)$ such that \[ \frac{1}{23660800}d_S(u,v) \le d_G(u,v) \le 162 d_S(u,v) \] for all $u,v\in V(S)$, where $d_S(u,v)$, $d_G(u,v)$ denotes the…

The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…