Refined enumerations of alternating sign matrices: Monotone (d,m)-trapezoids with prescribed top and bottom row

DOI10.1007/S10801-010-0243-7MaRDI QIDQ626439zbMATH OpenOpenAlexWikidataFDO

Authors Ilse Fischer

Publication date 18 February 2011

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

exact enumerationmonotone trianglesalternating sign matrices

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Abstract: Monotone triangles are plane integer arrays of triangular shape with certain monotonicity conditions along rows and diagonals. Their significance is mainly due to the fact that they correspond to $nimesn$ alternating sign matrices when prescribing $(1,2,\mathrm{...},n)$ as bottom row of the array. We define monotone $(d,m)$--trapezoids as monotone triangles with $m$ rows where the $d-1$ top rows are removed. (These objects are also equivalent to certain partial alternating sign matrices.) It is known that the number of monotone triangles with bottom row $(k_1,\mathrm{...},k_n)$ is given by a polynomial $alpha(n;k_1,\mathrm{...},k_n)$ in the $k_i$'s. The main purpose of this paper is to show that the number of monotone $(d,m)$--trapezoids with prescribed top and bottom row appears as a coefficient in the expansion of a specialization of $alpha(n;k_1,\mathrm{...},k_n)$ with respect to a certain polynomial basis. This settles a generalization of a recent conjecture of Romik and the author. Among other things, the result is used to express the number of monotone triangles with bottom row $(1,2,\mathrm{...},i-1,i+1,\mathrm{...},j-1,j+1,\mathrm{...},n)$ (which is, by the standard bijection, also the number of $nimesn$ alternating sign matrices with given top two rows) in terms of the number of $nimesn$ alternating sign matrices with prescribed top and bottom row, and, by a formula of Stroganov for the latter numbers, to provide an explicit formula for the first numbers. (A formula of this type was first derived by Karklinsky and Romik using the relation of alternating sign matrices to the six--vertex model.)

Recommendations

• The number of monotone triangles with prescribed bottom row
• On a fourfold refined enumeration of alternating sign trapezoids
• Combinatorial reciprocity for monotone triangles
• Combinatorial reciprocity for monotone triangles
• A fourfold refined enumeration of alternating sign trapezoids

Cites work

• scientific article; zbMATH DE number 1380572 (Why is no real title available?)
• A formula for a doubly refined enumeration of alternating sign matrices
• A new proof of the refined alternating sign matrix theorem
• Alternating sign matrices and descending plane partitions
• Izergin-Korepin determinant at a third root of unity
• More refined enumerations of alternating sign matrices
• On two-point boundary correlations in the six-vertex model with domain wall boundary conditions
• Proof of the alternating sign matrix conjecture
• The operator formula for monotone triangles - simplified proof and three generalizations

Cited in

(23)

• Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
• Trivial meet and join within the lattice of monotone triangles.
• Arctic circles, domino tilings and square Young tableaux
• Refined enumeration of halved monotone triangles and applications to vertically symmetric alternating sign trapezoids
• Refined enumeration of symmetry classes of alternating sign matrices
• Multiply-refined enumeration of alternating sign matrices
• Constant term formulas for refined enumerations of Gog and Magog trapezoids
• Short proof of the ASM theorem avoiding the six-vertex model
• Combinatorial reciprocity for monotone triangles
• The mysterious story of square ice, piles of cubes, and bijections
• A constant term approach to enumerating alternating sign trapezoids
• Linear relations of refined enumerations of alternating sign matrices
• Sequences of labeled trees related to Gelfand-Tsetlin patterns
• A fourfold refined enumeration of alternating sign trapezoids
• A formula for a doubly refined enumeration of alternating sign matrices
• Vertically symmetric alternating sign matrices and a multivariate Laurent polynomial identity
• Enumeration of alternating sign triangles using a constant term approach
• Generalized monotone triangles
• Factorization in the multirefined tangent method
• An operator formula for the number of halved monotone triangles with prescribed bottom row
• The number of monotone triangles with prescribed bottom row
• On a fourfold refined enumeration of alternating sign trapezoids
• Combinatorial reciprocity for monotone triangles

Describes a project that uses

Uses Software

• ROBBINS

This page was built for publication: Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626439)