2000 character limit reached
On a positivity conjecture in the character table of $S_n$ (1808.01416v2)
Published 4 Aug 2018 in math.CO and math.GR
Abstract: In previous work of this author it was conjectured that the sum of power sums $p_\lambda,$ for partitions $\lambda$ ranging over an interval $[(1n), \mu]$ in reverse lexicographic order, is Schur-positive. Here we investigate this conjecture and establish its truth in the following special cases: for $\mu\in [(n-4,14), (n)]$ or $\mu\in [(1n), (3,1{n-3})], $ or $\mu=(3, 2k, 1r)$ when $k\geq 1$ and $0\leq r\leq 2.$ Many new Schur positivity questions are presented.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.