English

Combinatorial Reciprocity for Monotone Triangles

Combinatorics 2011-11-14 v1

Abstract

The number of Monotone Triangles with bottom row k1 < k2 < ... < kn is given by a polynomial alpha(n; k1,...,kn) in n variables. The evaluation of this polynomial at weakly decreasing sequences k1 >= k2 >= ... >= kn turns out to be interpretable as signed enumeration of new combinatorial objects called Decreasing Monotone Triangles. There exist surprising connections between the two classes of objects -- in particular it is shown that alpha(n; 1,2,...,n) = alpha(2n; n,n,n-1,n-1,...,1,1). In perfect analogy to the correspondence between Monotone Triangles and Alternating Sign Matrices, the set of Decreasing Monotone Triangles with bottom row (n,n,n-1,n-1,...,1,1) is in one-to-one correspondence with a certain set of ASM-like matrices, which also play an important role in proving the claimed identity algebraically. Finding a bijective proof remains an open problem.

Keywords

Cite

@article{arxiv.1111.2695,
  title  = {Combinatorial Reciprocity for Monotone Triangles},
  author = {Ilse Fischer and Lukas Riegler},
  journal= {arXiv preprint arXiv:1111.2695},
  year   = {2011}
}

Comments

24 pages

R2 v1 2026-06-21T19:34:37.999Z