Enumeration formulas for Young tableaux in a diagonal strip
Yuliy Baryshnikov, Dan Romik

TL;DR
This paper develops new combinatorial identities involving Bernoulli and Euler numbers to count standard Young tableaux of specific skew shapes, extending classical permutation formulas using advanced algebraic and geometric methods.
Contribution
It introduces generalized enumeration formulas for Young tableaux of skew shapes, combining transfer operator techniques with polytope volume identities.
Findings
Derived identities involving Bernoulli and Euler numbers
Extended classical formulas of D. Andre for up-down permutations
Connected combinatorial identities with geometric volume calculations
Abstract
We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The analysis uses a transfer operator approach extending the method of Elkies, combined with an identity expressing the volume of a certain polytope in terms of a Schur function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Random Matrices and Applications
