Generating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers
Paul Drube

TL;DR
This paper develops generating functions for counting inverted semistandard Young tableaux with various shapes and contents, relating them to higher-dimensional Dyck paths and generalized Ballot numbers, and provides explicit enumerations for specific shapes.
Contribution
It introduces new generating functions for inverted semistandard Young tableaux and connects their enumeration to higher-dimensional combinatorial objects and generalized Ballot numbers.
Findings
Generated explicit formulas for counting k-inverted semistandard Young tableaux.
Connected tableau enumeration to m-dimensional Dyck paths and generalized Ballot numbers.
Provided exact counts for specific two-row and two-column shapes.
Abstract
An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely inversion pairs is said to be a -inverted semistandard Young tableau. Building upon earlier work by Fresse and the author, this paper develops generating functions for the numbers of -inverted semistandard Young tableau of various shapes and contents . An easily-calculable generating function is given for the number of -inverted semistandard Young tableau that "standardize" to a fixed semistandard Young tableau. For -row shapes and standard content , the total number of -inverted standard Young tableau of shape are then enumerated by relating such tableaux to -dimensional generalizations of Dyck paths and counting the…
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.
