Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFree Fermion Six Vertex Model: Symmetric Functions and Random Domino Tilings
77
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Our work deals with symmetric rational functions and probabilistic models based on the fully inhomogeneous six vertex (ice type) model satisfying the free fermion condition. Two families of symmetric rational functions $F_lambda,G_lambda$ are defined as certain partition functions of the six vertex model, with variables corresponding to row rapidities, and the labeling signatures $lambda=(lambda_1ge ldotsge lambda_N)in mathbb{Z}^N$ encoding boundary conditions. These symmetric functions generalize Schur symmetric polynomials, as well as some of their variations, such as factorial and supersymmetric Schur polynomials. Cauchy type summation identities for $F_lambda,G_lambda$ and their skew counterparts follow from the Yang-Baxter equation. Using algebraic Bethe Ansatz, we obtain a double alternant type formula for $F_lambda$ and a Sergeev-Pragacz type formula for $G_lambda$. In the spirit of the theory of Schur processes, we define probability measures on sequences of signatures with probability weights proportional to products of our symmetric functions. We show that these measures can be viewed as determinantal point processes, and we express their correlation kernels in a double contour integral form. We present two proofs: The first is a direct computation of Eynard-Mehta type, and the second uses non-standard, inhomogeneo
rate research
Read More
We show that the height function of the six-vertex model, in the parameter range $mathbf a=mathbf b=1$ and $mathbf cge1$, is delocalized with logarithmic variance when $mathbf cle 2$. This complements the earlier proven localization for $mathbf c>2$. Our proof relies on Russo--Seymour--Welsh type arguments, and on the local behaviour of the free energy of the cylindrical six-vertex model, as a function of the unbalance between the number of up and down arrows.
We consider uniformly random lozenge tilings of simply connected polygons subject to a technical assumption on their limit shape. We show that the edge statistics around any point on the arctic boundary, that is not a cusp or tangency location, converge to the Airy line ensemble. Our proof proceeds by locally comparing these edge statistics with those for a random tiling of a hexagon, which are well understood. To realize this comparison, we require a nearly optimal concentration estimate for the tiling height function, which we establish by exhibiting a certain Markov chain on the set of all tilings that preserves such concentration estimates under its dynamics.
Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of boxes that are intersected by a Voronoi polyomino, and vice-versa. These results will be crucial to analyze self-avoiding paths, greedy polyominoes and first-passage percolation models on Voronoi tilings and on the dual graph, named the Delaunay triangulation.
We study numerically the two-point correlation functions of height functions in the six-vertex model with domain wall boundary conditions. The correlation functions and the height functions are computed by the Markov chain Monte-Carlo algorithm. Particular attention is paid to the free fermionic point ($Delta=0$), for which the correlation functions are obtained analytically in the thermodynamic limit. A good agreement of the exact and numerical results for the free fermionic point allows us to extend calculations to the disordered ($|Delta|<1$) phase and to monitor the logarithm-like behavior of correlation functions there. For the antiferroelectric ($Delta<-1$) phase, the exponential decrease of correlation functions is observed.
For a large class of amenable transient weighted graphs $G$, we prove that the sign clusters of the Gaussian free field on $G$ fall into a regime of strong supercriticality, in which two infinite sign clusters dominate (one for each sign), and finite sign clusters are necessarily tiny, with overwhelming probability. Examples of graphs belonging to this class include regular lattices like $mathbb{Z}^d$, for $d geqslant 3$, but also more intricate geometries, such as Cayley graphs of suitably growing (finitely generated) non-Abelian groups, and cases in which random walks exhibit anomalous diffusive behavior, for instance various fractal graphs. As a consequence, we also show that the vacant set of random interlacements on these objects, introduced by Sznitman in arXiv:0704.2560, and which is intimately linked to the free field, contains an infinite connected component at small intensities. In particular, this result settles an open problem from arXiv:1010.1490.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
