Arvind Ayyer, Doron Zeilberger
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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.
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.
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.
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 …
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.
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…
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…
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.
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.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。