On some polynomials enumerating Fully Packed Loop configurations: evaluation at negative values
From MaRDI portal
Abstract: 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 negative p. Here, we prove some of these conjectures. Notably, we prove that for negative p we can factor the polynomials into two parts a "positive" one and a "negative" one. Also, a sum rules of the negative part is proven.
Recommendations
- On some polynomials enumerating fully packed loop configurations
- On the counting of fully packed loop configurations: some new conjectures
- Fully packed loop configurations: polynomiality and nested arches
- Fully packed loop configurations: polynomiality and nested arches
- Fully packed loop configurations in a triangle and Littlewood-Richardson coefficients
- Refined counting of fully packed loop configurations
- On the number of fully packed loop configurations with a fixed associated matching
- Fully packed loop configurations in a triangle and Littlewood Richardson coefficients
- Hall-Littlewood polynomials and fixed point enumeration
- Proof of two conjectures of Zuber on fully packed loop configurations
Cites work
- A general formula for soliton form factors in the quantum sine-Gordon model
- Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule
- Combinatorial nature of the ground-state vector of the \(\mathrm{O}(1)\) loop model
- Computing the Continuous Discretely
- Deformed Kazhdan-Lusztig elements and Macdonald polynomials
- Integrability and combinatorics: selected topics
- On some ground state components of the \(O(1)\) loop model
- On some polynomials enumerating fully packed loop configurations
- On the counting of fully packed loop configurations: some new conjectures
- On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions
- On the number of fully packed loop configurations with a fixed associated matching
- Proof of the Razumov-Stroganov conjecture
- Quantum Knizhnik-Zamolodchikov equation, totally symmetric self-complementary plane partitions, and alternating sign matrices
- Quantum Knizhnik-Zamolodchikov equation: reflecting boundary conditions and combinatorics
- Quantum affine algebras and holonomic difference equations
- Totally symmetric self-complementary plane partitions and the quantum Knizhnik-Zamolodchikov equation: a conjecture
Cited in
(5)- Fully packed loop configurations: polynomiality and nested arches
- Fully packed loop configurations: polynomiality and nested arches
- Proof of two conjectures of Zuber on fully packed loop configurations
- On some polynomials enumerating fully packed loop configurations
- On polynomials interpolating between the stationary state of a \(O (n)\) model and a Q.H.E. ground state
This page was built for publication: On some polynomials enumerating Fully Packed Loop configurations: evaluation at negative values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394817)
