Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1905.12387

Twenty-Vertex model with domain wall boundaries and domino tilings

Philippe Di Francesco·Emmanuel Guitter
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the triangular lattice ice model (20-Vertex model) with four types of domain-wall type boundary conditions. In types 1 and 2, the configurations are shown to be equinumerous to the quarter-turn symmetric domino tilings of an Aztec-like holey square, with a central cross-shaped hole. The proof of this statement makes extensive use of integrability and of a connection to the 6-Vertex model. The type 3 configurations are conjectured to be in same number as domino tilings of a particular triangle. The four enumeration problems are reformulated in terms of four types of Alternating Phase Matrices with entries 0 and sixth roots of unity, subject to suitable alternation conditions. Our result is a generalization of the ASM-DPP correspondence. Several refined versions of the above correspondences are also discussed.

Explore related subjects

math.COcond-mat.stat-mechmath-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philippe Di Francesco, Emmanuel Guitter. 2019-05-29. Twenty-Vertex model with domain wall boundaries and domino tilings. https://doi.org/10.37236/8809

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗