79 research outputs found
Pfaffian Correlation Functions of Planar Dimer Covers
The Pfaffian structure of the boundary monomer correlation functions in the
dimer-covering planar graph models is rederived through a combinatorial /
topological argument. These functions are then extended into a larger family of
order-disorder correlation functions which are shown to exhibit Pfaffian
structure throughout the bulk. Key tools involve combinatorial switching
symmetries which are identified through the loop-gas representation of the
double dimer model, and topological implications of planarity.Comment: Revised figures; corrected misprint
Dyck tilings, increasing trees, descents, and inversions
Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon
tiles shaped like Dyck paths, in which tiles are no larger than the tiles they
cover. These tilings arise in the study of certain statistical physics models
and also Kazhdan--Lusztig polynomials. We give two bijections between
cover-inclusive Dyck tilings and linear extensions of tree posets. The first
bijection maps the statistic (area + tiles)/2 to inversions of the linear
extension, and the second bijection maps the "discrepancy" between the upper
and lower boundary of the tiling to descents of the linear extension.Comment: 24 pages, 9 figure
Limit shape and height fluctuations of random perfect matchings on square-hexagon lattices
We study asymptotics of perfect matchings on a large class of graphs called
the contracting square-hexagon lattice, which is constructed row by row from
either a row of a square grid or a row of a hexagonal lattice. We assign the
graph periodic edge weights with period , and consider the
probability measure of perfect matchings in which the probability of each
configuration is proportional to the product of edge weights. We show that the
partition function of perfect matchings on such a graph can be computed
explicitly by a Schur function depending on the edge weights. By analyzing the
asymptotics of the Schur function, we then prove the Law of Large Numbers
(limit shape) and the Central Limit Theorem (convergence to the Gaussian free
field) for the corresponding height functions. We also show that the
distribution of certain type of dimers near the turning corner is the same as
the eigenvalues of Gaussian Unitary Ensemble, and that in the scaling limit
under the boundary condition that each segment of the bottom boundary grows
linearly with respect the dimension of the graph, the frozen boundary is a
cloud curve whose number of tangent points to the bottom boundary of the domain
depends on the size of the period, as well as the number of segments along the
bottom boundary
A Statistical Model of Current Loops and Magnetic Monopoles
We formulate a natural model of current loops and magnetic monopoles for
arbitrary planar graphs, which we call the monopole-dimer model, and express
the partition function of this model as a determinant. We then extend the
method of Kasteleyn and Temperley-Fisher to calculate the partition function
exactly in the case of rectangular grids. This partition function turns out to
be a square of the partition function of an emergent monomer-dimer model when
the grid sizes are even. We use this formula to calculate the local monopole
density, free energy and entropy exactly. Our technique is a novel
determinantal formula for the partition function of a model of vertices and
loops for arbitrary graphs.Comment: 17 pages, 5 figures, significant stylistic revisions. In particular,
rewritten with a mathematical audience in mind. Numerous errors fixed. This
is the final published version. Maple program file can be downloaded from the
link on the right of this pag
Proofs of two conjectures of Kenyon and Wilson on Dyck tilings
Recently, Kenyon and Wilson introduced a certain matrix in order to
compute pairing probabilities of what they call the double-dimer model. They
showed that the absolute value of each entry of the inverse matrix is
equal to the number of certain Dyck tilings of a skew shape. They conjectured
two formulas on the sum of the absolute values of the entries in a row or a
column of . In this paper we prove the two conjectures. As a
consequence we obtain that the sum of the absolute values of all entries of
is equal to the number of complete matchings. We also find a bijection
between Dyck tilings and complete matchings.Comment: 18 pages, 9 figure
Topological string amplitudes and Seiberg-Witten prepotentials from the counting of dimers in transverse flux
Important illustration to the principle ``partition functions in string
theory are -functions of integrable equations'' is the fact that the
(dual) partition functions of gauge theories solve
Painlev\'e equations. In this paper we show a road to self-consistent proof of
the recently suggested generalization of this correspondence: partition
functions of topological string on local Calabi-Yau manifolds solve
-difference equations of non-autonomous dynamics of the
``cluster-algebraic'' integrable systems.
We explain in details the ``solutions'' side of the proposal. In the simplest
non-trivial example we show how box-counting of topological string
partition function appears from the counting of dimers on bipartite graph with
the discrete gauge field of ``flux'' . This is a new form of topological
string/spectral theory type correspondence, since the partition function of
dimers can be computed as determinant of the linear -difference Kasteleyn
operator. Using WKB method in the ``melting'' limit we get a closed
integral formula for Seiberg-Witten prepotential of the corresponding
gauge theory. The ``equations'' side of the correspondence remains the
intriguing topic for the further studies.Comment: 21 page
- …