The number of monotone triangles with prescribed bottom row
From MaRDI portal
(Redirected from Publication:863313)
Abstract: We show that the number of monotone triangles with prescribed bottom row (k_1,...,k_n) is given by a simple product formula which remarkably involves (shift) operators. Monotone triangles with bottom row (1,2,...,n) are in bijection with alternating sign matrices.
Recommendations
- An operator formula for the number of halved monotone triangles with prescribed bottom row
- Combinatorial reciprocity for monotone triangles
- Combinatorial reciprocity for monotone triangles
- Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
- The operator formula for monotone triangles - simplified proof and three generalizations
Cites work
- A method for proving polynomial enumeration formulas
- Alternating sign matrices and descending plane partitions
- Another refinement of the Bender-Knuth (ex-)conjecture
- Determinants and alternating sign matrices
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1380572 (Why is no real title available?)
- scientific article; zbMATH DE number 892258 (Why is no real title available?)
- Proof of the alternating sign matrix conjecture
- Proof of the refined alternating sign matrix conjecture
- Symmetry classes of alternating-sign matrices under one roof
Cited in
(35)- An operator formula for the number of halved monotone triangles with prescribed bottom row
- More refined enumerations of alternating sign matrices
- Sequences of labeled trees related to Gelfand-Tsetlin patterns
- The operator formula for monotone triangles - simplified proof and three generalizations
- Refined enumeration of halved monotone triangles and applications to vertically symmetric alternating sign trapezoids
- Computations versus bijections for tiling enumeration
- A bijective proof of the ASM theorem. I: The operator formula
- The first bijective proof of the refined ASM theorem
- A new determinant for the Q-enumeration of alternating sign matrices
- Six-vertex model on a finite lattice: integral representations for nonlocal correlation functions
- A constant term approach to enumerating alternating sign trapezoids
- Combinatorial reciprocity for monotone triangles
- Multiply-refined enumeration of alternating sign matrices
- An approach for calculating correlation functions in the six-vertex model with domain wall boundary conditions
- The relation between alternating sign matrices and descending plane partitions: \(n + 3\) pairs of equivalent statistics
- Constant term solution for an arbitrary number of osculating lattice paths
- Trivial meet and join within the lattice of monotone triangles.
- Arctic circles, domino tilings and square Young tableaux
- Vertically symmetric alternating sign matrices and a multivariate Laurent polynomial identity
- The mysterious story of square ice, piles of cubes, and bijections
- Enumeration of alternating sign triangles using a constant term approach
- Combinatorial reciprocity for monotone triangles
- Generalized monotone triangles
- Refined enumerations of alternating sign matrices: Monotone \((d,m)\)-trapezoids with prescribed top and bottom row
- Linear relations of refined enumerations of alternating sign matrices
- Alternating sign matrices and totally symmetric plane partitions
- Generalized rank functions and quilts of alternating sign matrices
- Alternating sign matrices with reflective symmetry and plane partitions: n+3 pairs of equivalent statistics and a Cauchy-type identity
- Alternating sign matrices and descending plane partitions: a linear number of equivalent statistics
- A survey on the enumeration of classes of logical connectives and aggregation functions defined on a finite chain, with new results
- Alternating sign pentagons and Magog pentagons
- Constant term formulas for refined enumerations of Gog and Magog trapezoids
- Short proof of the ASM theorem avoiding the six-vertex model
- A new proof of the refined alternating sign matrix theorem
- A formula for a doubly refined enumeration of alternating sign matrices
This page was built for publication: The number of monotone triangles with prescribed bottom row
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863313)
