Increasing Subsequences and Kronecker Coefficients
Combinatorics
2020-06-24 v1
Abstract
It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker coefficients of the symmetric group.
Cite
@article{arxiv.2006.13146,
title = {Increasing Subsequences and Kronecker Coefficients},
author = {Jonathan Novak and Brendon Rhoades},
journal= {arXiv preprint arXiv:2006.13146},
year = {2020}
}
Comments
5 pages, for the "Open Problems in Algebraic Combinatorics" AMS volume to accompany the OPAC 2021 conference at the University of Minnesota