Almost-everywhere log-concavity conjecture for major-index generating polynomials
Let be a partition, and let denote the major-index generating polynomial of standard Young tableaux of shape . A polynomial is log-concave when its coefficients satisfy wherever these coefficients are defined.
Log-concavity conjecture. The polynomials are almost always log-concave for partitions for large .
The conjecture is motivated by the log-concavity of the normal distribution and computational data showing increasing proportions of log-concave examples for . The meaning of “almost always” is not quantified in the statement, so the precise asymptotic formulation remains open.
References
- Sara C. Billey, Matjaž Konvalinka and Joshua P. Swanson, “Asymptotic normality of the major index on standard tableaux”, arXiv:1905.00975 (2019).
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.