Enumeration of alternating sign triangles using a constant term approach

DOI10.1090/TRAN/7652zbMATH Open1415.05013arXiv1804.03630OpenAlexW2962704884WikidataQ129134959 ScholiaQ129134959MaRDI QIDQ5222873FDOQ5222873

Ilse Fischer

Publication date: 4 July 2019

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1804.03630

Recommendations

• Refined enumerations of alternating sign triangles
• Refined enumerations of alternating sign triangles
• Linear relations of refined enumerations of alternating sign matrices
• A constant term approach to enumerating alternating sign trapezoids
• A new proof of the refined alternating sign matrix theorem

zbMATH Keywords

alternating sign matrices

Mathematics Subject Classification ID

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)

Cites Work

• Proof of the alternating sign matrix conjecture
• Binomial determinants, paths, and hook length formulae
• Title not available (Why is that?)
• On the weighted enumeration of alternating sign matrices and descending plane partitions
• Alternating sign matrices and descending plane partitions
• Symmetry classes of alternating-sign matrices under one roof
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Vector Representations of Induced Matroids
• Proof of the Macdonald conjecture
• Proof of the refined alternating sign matrix conjecture
• A large dihedral symmetry of the set of alternating sign matrices
• Proof of the Razumov-Stroganov conjecture
• The number of monotone triangles with prescribed bottom row
• On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions
• Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule
• Quantum Knizhnik-Zamolodchikov equation, totally symmetric self-complementary plane partitions, and alternating sign matrices
• Determinants and alternating sign matrices
• The operator formula for monotone triangles - simplified proof and three generalizations
• Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
• A new proof of the refined alternating sign matrix theorem
• A doubly-refined enumeration of alternating sign matrices and descending plane partitions
• Connectivity patterns in loop percolation. I: The rationality phenomenon and constant term identities
• Self-complementary totally symmetric plane partitions
• Gog and Magog triangles, and the Schützenberger involution
• Gog, Magog and Sch\"utzenberger II: Left trapezoids
• Short proof of the ASM theorem avoiding the six-vertex model
• Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
• Refined enumerations of alternating sign triangles

Cited In (7)

• 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
• Refined enumerations of alternating sign triangles
• On a fourfold refined enumeration of alternating sign trapezoids

Uses Software

• ROBBINS

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)