Reiner–Tenner–Yong's barely set-valued tableau enumeration conjecture
A barely set-valued semistandard Young tableau is a set-valued semistandard Young tableau in which exactly one square is assigned two integers and every other square is assigned a single integer. For a partition and a positive integer , let and denote, respectively, the sets of barely set-valued semistandard Young tableaux and ordinary semistandard Young tableaux of shape such that every integer in row is at most . Let , and let be the rectangular staircase shape obtained by replacing each square of by an rectangle. Reiner, Tenner and Yong's conjecture. For any positive integers and ,
This conjecture concerns the enumeration of barely set-valued tableaux and was posed in the study of the probability distribution of edges in the Young lattice. The paper proves the conjecture, so the assertion is solved.
References
- Neil J. Y. Fan, Peter L. Guo and Sophie C. C. Sun, “Proof of a Conjecture of Reiner-Tenner-Yong on Barely Set-valued Tableaux”, arXiv:1807.08292 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.