Related papers: Proof of Razumov-Stroganov conjecture for some inf…
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…
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…
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…
Recently it has been conjectured that the ground-state of a Markovian Hamiltonian, with one boundary operator, acting in a link pattern space is related to vertically and horizontally symmetric alternating-sign matrices (equivalently…
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…
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.
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…
We show that the number of fully packed loop configurations corresponding to a matching with $m$ nested arches is polynomial in $m$ if $m$ is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11 (2004),…
Two conjectures of Zuber [``On the counting of fully packed loops configurations. Some new conjectures,'' preprint] on the enumeration of configurations in the fully packed loop model on the square grid with periodic boundary conditions,…
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…
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…
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…
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…
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…
We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…
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…
Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…
We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded height case can be reduced to checking that the conjecture…
A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…