arXiv:2006.13146 Abstract | arXiv Analytics

arXiv:2006.13146 [math.CO]Abstract References Reviews Resources

Increasing Subsequences and Kronecker Coefficients

Published 2020-06-23Version 1

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.

Comments: 5 pages, for the "Open Problems in Algebraic Combinatorics" AMS volume to accompany the OPAC 2021 conference at the University of Minnesota

Categories: math.CO

Keywords: kronecker coefficients, uniformly random permutation, longest increasing subsequence, symmetric group, stronger version

Tags: conference paper

Related articles: Most relevant | Search more

arXiv:0812.0861 [math.CO] (Published 2008-12-04)

Quasipolynomial formulas for the Kronecker coefficients indexed by two two-row shapes (extended abstract)

Emmanuel Briand, Rosa Orellana, Mercedes Rosas

arXiv:math/9806057 [math.CO] (Published 1998-06-10)

Flag-symmetry of the poset of shuffles and a local action of the symmetric group

Rodica Simion, Richard P. Stanley

arXiv:0706.2707 [math.CO] (Published 2007-06-19)

The p-modular Descent Algebra of the Symmetric Group