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

2011/06/20 by Tiago Fonseca, Fonseca, Tiago
Computer Science · Mathematics · Physics and Astronomy · #05A05 #05A17 #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #FOS: Physical sciences #Mathematical Physics (math-ph) #Polynomial and algebraic computation #math-ph #math.CO #math.MP #msc:05A05 #msc:05A17

paper · pdf · doi:10.48550/arxiv.1106.4057

25 pages

openalex publication_date 2011/06/20 · arxiv created 2013/05/24 · arxiv updated 2013/05/27 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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.

Citations

• Six-Vertex, Loop and Tiling models: Integrability and Combinatorics
• On refined enumerations of totally symmetric self-complementary plane partitions I

Related

• On some polynomials enumerating Fully Packed Loop configurations
• Proof of two conjectures of Zuber on fully packed loop configurations
• Fully Packed Loops in a triangle: matchings, paths and puzzles
• A conjectured formula for Fully Packed Loop configurations in a triangle
• A Bijection between classes of Fully Packed Loops and Plane Partitions