Proof of a Conjecture of Reiner-Tenner-Yong on Barely Set-valued Tableaux
Neil J.Y. Fan, Peter L. Guo, Sophie C.C. Sun

TL;DR
This paper proves a conjecture relating barely set-valued semistandard Young tableaux to standard tableaux for certain shapes, by connecting their counts through expected jaggedness and properties of balanced shapes.
Contribution
It establishes a new connection between barely set-valued tableaux and reverse plane partitions, confirming a conjecture for rectangular staircase shapes.
Findings
Confirmed the Reiner-Tenner-Yong conjecture for rectangular staircase shapes.
Derived a formula linking barely set-valued and standard tableaux counts for balanced shapes.
Connected expected jaggedness of subshapes to tableau enumeration.
Abstract
The notion of a barely set-valued semistandard Young tableau was introduced by Reiner, Tenner and Yong in their study of the probability distribution of edges in the Young lattice of partitions. Given a partition and a positive integer , let (respectively, ) denote the set of barely set-valued semistandard Young tableaux (respectively, ordinary semistandard Young tableaux) of shape with entries in row not exceeding . In the case when is a rectangular staircase partition , Reiner, Tenner and Yong conjectured that . In this paper, we establish a connection between barely set-valued tableaux and reverse plane partitions with designated corners. We show that for any shape , the expected…
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
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Algebraic structures and combinatorial models
