5 citations · 7 across the 2 of their papers we have counts for
3 papers
math.CO2014★ 2 cited
Playing jeu de taquin on d-complete posets
Lukas Riegler, Christoph Neumann
Using a modified version of jeu de taquin, Novelli, Pak and Stoyanovskii gave a bijective proof of the hook-length formula for counting standard Young tableaux of fixed shape. In t…
math.CO2012★ 5 cited
Generalized Monotone Triangles: an extended Combinatorial Reciprocity Theorem
Lukas Riegler
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…
math.CO2011
Combinatorial Reciprocity for Monotone Triangles
Ilse Fischer, Lukas Riegler
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 decreas…