Enumeration of alternating sign triangles using a constant term approach
From MaRDI portal
Publication:5222873
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Exactly solvable models; Bethe ansatz (82B23) Sign pattern matrices (15B35)
Abstract: Alternating sign triangles (ASTs) have recently been introduced by Ayyer, Behrend and the author, and it was proven that there is the same number of ASTs with n rows as there is of nxn alternating sign matrices (ASMs). We prove a conjecture by Behrend on a refined enumeration of ASTs with respect to a statistic that is shown to have the same distribution as the column of the unique 1 in the top row of an ASM. The proof of the conjecture is based on a certain multivariate generating function of ASTs that takes the positions of the columns with sum 1 (1-columns) into account. We also prove a curious identity on the cyclic rotation of the 1-columns of ASTs. Furthermore, we discuss a relation of our multivariate generating function to a formula of Di Francesco and Zinn-Justin for the number of fully packed loop configurations associated with a given link pattern. The proofs of our results employ the author's operator formula for the number of monotone triangles with prescribed bottom row. This is opposed to the six-vertex model approach that was used by Ayyer, Behrend and the author to enumerate ASTs, and since the refined enumeration implies the unrefined enumeration, the present paper also provides an alternative proof of the enumeration of ASTs.
Recommendations
Cites work
- scientific article; zbMATH DE number 1741012 (Why is no real title available?)
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- A doubly-refined enumeration of alternating sign matrices and descending plane partitions
- A large dihedral symmetry of the set of alternating sign matrices
- A new proof of the refined alternating sign matrix theorem
- Alternating sign matrices and descending plane partitions
- Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule
- Binomial determinants, paths, and hook length formulae
- Connectivity patterns in loop percolation. I: The rationality phenomenon and constant term identities
- Determinants and alternating sign matrices
- Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
- Gog and Magog triangles, and the Schützenberger involution
- Gog, Magog and Schützenberger. II: Left trapezoids
- Integrability and combinatorics: selected topics
- On the Vector Representations of Induced Matroids
- On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions
- On the weighted enumeration of alternating sign matrices and descending plane partitions
- Proof of the Macdonald conjecture
- Proof of the Razumov-Stroganov conjecture
- Proof of the alternating sign matrix conjecture
- Proof of the refined alternating sign matrix conjecture
- Quantum Knizhnik-Zamolodchikov equation, totally symmetric self-complementary plane partitions, and alternating sign matrices
- Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
- Self-complementary totally symmetric plane partitions
- Short proof of the ASM theorem avoiding the six-vertex model
- Symmetry classes of alternating-sign matrices under one roof
- The number of monotone triangles with prescribed bottom row
- The operator formula for monotone triangles - simplified proof and three generalizations
Cited in
(7)- (-1)-enumerations of arrowed Gelfand-Tsetlin patterns
- Refined enumeration of halved monotone triangles and applications to vertically symmetric alternating sign trapezoids
- Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
- A constant term approach to enumerating alternating sign trapezoids
- Bounded Littlewood identity related to alternating sign matrices
- A bijective proof of the ASM theorem. I: The operator formula
- On a fourfold refined enumeration of alternating sign trapezoids
This page was built for publication: Enumeration of alternating sign triangles using a constant term approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222873)
