English

Generalized Monotone Triangles: an extended Combinatorial Reciprocity Theorem

Combinatorics 2012-07-19 v1

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.

Keywords

Cite

@article{arxiv.1207.4437,
  title  = {Generalized Monotone Triangles: an extended Combinatorial Reciprocity Theorem},
  author = {Lukas Riegler},
  journal= {arXiv preprint arXiv:1207.4437},
  year   = {2012}
}

Comments

19 pages

R2 v1 2026-06-21T21:37:58.966Z