Generalized monotone triangles
From MaRDI portal
Abstract: In a recent work, the combinatorial interpretation of the polynomial alpha(n;k1,k2,...,kn) counting the number of Monotone Triangles with bottom row k1 < k2 < ... < kn was extended to weakly decreasing sequences k1 >= k2 >= ... >= kn. In this case the evaluation of the polynomial is equal to a signed enumeration of objects called Decreasing Monotone Triangles. In this paper we define Generalized Monotone Triangles - a joint generalization of both ordinary Monotone Triangles and Decreasing Monotone Triangles. As main result of the paper we prove that the evaluation of alpha(n;k1,k2,...,kn) at arbitrary (k1,k2,...,kn) in Z^n is a signed enumeration of Generalized Monotone Triangles with bottom row (k1,k2,...,kn). Computational experiments indicate that certain evaluations of the polynomial at integral sequences yield well-known round numbers related to Alternating Sign Matrices. The main result provides a combinatorial interpretation of the conjectured identities and could turn out useful in giving a bijective proof.
Recommendations
- Combinatorial reciprocity for monotone triangles
- Combinatorial reciprocity for monotone triangles
- The number of monotone triangles with prescribed bottom row
- 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
Cited in
(4)
This page was built for publication: Generalized monotone triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746164)
