Related papers: On some polynomials enumerating Fully Packed Loop …
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…
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.
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…
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…
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),…
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,…
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…
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,…
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…
This article proves a conjecture by Zuber about the enumeration of fully packed loops (FPLs). The conjecture states that the number of FPLs whose link pattern consists of two noncrossing matchings which are separated by $m$ nested arches is…
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…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…
A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…
We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…
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…
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…
In this work we continue our study of Fully Packed Loop (FPL) configurations in a triangle. These are certain subgraphs on a triangular subset of the square lattice, which first arose in the study of the usual FPL configurations on a square…
Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolutions. These convolutions preserve real-rootedness and…