Counting Standard Young Tableaux With Restricted Runs
Combinatorics
2020-08-11 v2
Abstract
The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of the first order. But what about counting Young tableaux where certain "run lengths" are forbidden? Then things seem to get much more complicated. We conclude with four conjectures and pledge donations to the OEIS in honor of the first provers.
Cite
@article{arxiv.2006.10205,
title = {Counting Standard Young Tableaux With Restricted Runs},
author = {Manuel Kauers and Doron Zeilberger},
journal= {arXiv preprint arXiv:2006.10205},
year = {2020}
}
Comments
8 pages. Accompanied by Maple packages and C programs available from https://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/cyt.html This version adds a footnote, and pledges donations to the OEIS in honor of the first provers