arXiv math/06071832006-07-07math.COmath-phmath.MP

Proof of Razumov-Stroganov conjecture for some infinite families of link patterns

P. Zinn-Justin

英文摘要：

We prove the Razumov--Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the Mac Mahon formula for the number of plane partitions which includes three series of parameters.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Proof of the Razumov-Stroganov conjecture

The Razumov-Stroganov conjecture relates the ground-state coefficients in the even-length dense O(1) loop model to the enumeration of fully-packed loop configuration on the square, with alternating boundary conditions, refined according to the link pattern for the boundary points. Here we prove this conjecture, by mean of purely combinatorial methods. The main ingredient is a generalization of the Wieland proof technique for the dihedral symmetry of these classes, based on the `gyration' operation, whose full strength we will investigate in a companion paper.

2010-03-17cond-mat.stat-mechmath-phmath.CO

The toggle group, homomesy, and the Razumov-Stroganov correspondence

The Razumov-Stroganov correspondence, an important link between statistical physics and combinatorics proved in 2011 by L. Cantini and A. Sportiello, relates the ground state eigenvector of the O(1) dense loop model on a semi-infinite cylinder to a refined enumeration of fully-packed loops, which are in bijection with alternating sign matrices. This paper reformulates a key component of this proof in terms of posets, the toggle group, and homomesy, and proves two new homomesy results on general posets which we hope will have broader implications.

2015-08-12cond-mat.stat-mechmath-phmath.CO

A one-parameter refinement of the Razumov-Stroganov correspondence

We introduce and prove a one-parameter refinement of the Razumov-Stroganov correspondence. This is achieved for fully-packed loop configurations (FPL) on domains which generalize the square domain, and which are endowed with the gyration operation. We consider one given side of the domain, and FPLs such that the only straight-line tile on this side is black. We show that the enumeration vector associated to such FPLs, weighted according to the position of the straight line and refined according to the link pattern for the black boundary points, is the ground state of the scattering matrix, an …

2012-02-23cond-mat.stat-mechmath-phmath.CO

Boundary qKZ equation and generalized Razumov-Stroganov sum rules for open IRF models

We find higher rank generalizations of the Razumov--Stroganov sum rules at $q=-e^{iπ\over k+1}$ for $A_{k-1}$ models with open boundaries, by constructing polynomial solutions of level one boundary quantum Knizhnik--Zamolodchikov equations for $U_q(\frak{sl}(k))$. The result takes the form of a character of the symplectic group, that leads to a generalization of the number of vertically symmetric alternating sign matrices. We also investigate the other combinatorial point $q=-1$, presumably related to the geometry of nilpotent matrix varieties.

2005-09-08cond-mat.stat-mechmath-phmath.CO

A bijectional attack on the Razumov-Stroganov conjecture

We attempt to prove the Razumov-Stroganov conjecture using a bijectional approach. We have been unsuccessful but we believe the techniques we present can be used to prove the conjecture.

2008-12-02math.CO

A refined Razumov-Stroganov conjecture

We extend the Razumov-Stroganov conjecture relating the groundstate of the O(1) spin chain to alternating sign matrices, by relating the groundstate of the monodromy matrix of the O(1) model to the so-called refined alternating sign matrices, i.e. with prescribed configuration of their first row, as well as to refined fully-packed loop configurations on a square grid, keeping track both of the loop connectivity and of the configuration of their top row. We also conjecture a direct relation between this groundstate and refined totally symmetric self-complementary plane partitions, namely, in th…

2004-09-08cond-mat.othercond-mat.stat-mechmath-ph

更多相关论文收起更多论文

Quantum Knizhnik-Zamolodchikov equation, generalized Razumov-Stroganov sum rules and extended Joseph polynomials

We prove higher rank analogues of the Razumov--Stroganov sum rule for the groundstate of the O(1) loop model on a semi-infinite cylinder: we show that a weighted sum of components of the groundstate of the A_{k-1} IRF model yields integers that generalize the numbers of alternating sign matrices. This is done by constructing minimal polynomial solutions of the level 1 U_q(\hat{sl(k)}) quantum Knizhnik--Zamolodchikov equations, which may also be interpreted as quantum incompressible q-deformations of fractional quantum Hall effect wave functions at filling fraction nu=1/k. In addition to the ge…

2006-03-07cond-mat.stat-mechmath-phmath.AG

A refined Razumov-Stroganov conjecture II

We extend a previous conjecture [cond-mat/0407477] relating the Perron-Frobenius eigenvector of the monodromy matrix of the O(1) loop model to refined numbers of alternating sign matrices. By considering the O(1) loop model on a semi-infinite cylinder with dislocations, we obtain the generating function for alternating sign matrices with prescribed positions of 1's on their top and bottom rows. This seems to indicate a deep correspondence between observables in both models.

2004-09-22cond-mat.stat-mechhep-thmath-ph

Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule

We prove that the sum of entries of the suitably normalized groundstate vector of the O(1) loop model with periodic boundary conditions on a periodic strip of size 2n is equal to the total number of n x n alternating sign matrices. This is done by identifying the state sum of a multi-parameter inhomogeneous version of the O(1) model with the partition function of the inhomogeneous six-vertex model on a n x n square grid with domain wall boundary conditions.

2006-03-07cond-mat.stat-mechmath-phmath.CO

A conjectured formula for Fully Packed Loop configurations in a triangle

We describe a new conjecture involving Fully Packed Loop counting which relates recent observations of Thapper to formulae in the Temperley--Lieb model of loops, and how it implies the Razumov--Stroganov conjecture.

2009-11-24math-phmath.COmath.MP

On the Counting of Fully Packed Loop Configurations. Some new conjectures

New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures are based on the analysis of the ground state of the Temperley-Lieb chain, for periodic boundary conditions and so-called ``identified connectivities'', up to size $2n=22$.

2003-09-25cond-mat.stat-mechmath-phmath.CO

Fully Packed Loop configurations in a triangle

Fully Packed Loop configurations (FPLs) are certain configurations on the square grid, naturally refined according to certain link patterns. If $A_X$ is the number of FPLs with link pattern $X$, the Razumov--Stroganov correspondence provides relations between numbers $A_X$ relative to a given grid size. In another line of research, if $X\cup p$ denotes $X$ with $p$ additional nested arches, then $A_{X\cup p}$ was shown to be polynomial in $p$: the proof gives rise to certain configurations of FPLs in a triangle (TFPLs). In this work we investigate these TFPL configurations and their relation t…

2011-11-25math.CO

On some polynomials enumerating Fully Packed Loops configurations, evaluation at negative values

In this article, we are interested in the enumeration of Fully Packed Loops configurations on a grid with a given noncrossing matching. These quantities also appear as the groundstate components of the Completely Packed Loops model as conjectured by Razumov and Stroganov and recently proved by Cantini and Sportiello. When considering matchings with p nested arches these quantities are known to be polynomials. In a recent article, Fonseca and Nadeau conjectured some unexpected properties of these polynomials, suggesting that these quantities could be combinatorially interpreted even for negativ…

2013-05-24math-phmath.COmath.MP

On some polynomials enumerating Fully Packed Loop configurations

We are interested in the enumeration of Fully Packed Loop configurations on a grid with a given noncrossing matching. By the recently proved Razumov--Stroganov conjecture, these quantities also appear as groundstate components in the Completely Packed Loop model. When considering matchings with p nested arches, these numbers are known to be polynomials in p. In this article, we present several conjectures about these polynomials: in particular, we describe all real roots, certain values of these polynomials, and conjecture that the coefficients are positive. The conjectures, which are of a com…

2010-06-21math-phmath.COmath.MP

On the link pattern distribution of quarter-turn symmetric FPL configurations

We present new conjectures on the distribution of link patterns for fully-packed loop (FPL) configurations that are invariant, or almost invariant, under a quarter turn rotation, extending previous conjectures of Razumov and Stroganov and of de Gier. We prove a special case, showing that the link pattern that is conjectured to be the rarest does have the prescribed probability. As a byproduct, we get a formula for the enumeration of a new class of quasi-symmetry of plane partitions.

2007-11-19math.CO