Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stanley character polynomials

Published 26 Sep 2014 in math.CO | (1409.7533v1)

Abstract: Stanley considered suitably normalized characters of the symmetric groups on Young diagrams having a special geometric form, namely multirectangular Young diagrams. He proved that the character is a polynomial in the lengths of the sides of the rectangles forming the Young diagram and he conjectured an explicit form of this polynomial. This Stanley character polynomial and this way of parametrizing the set of Young diagrams turned out to be a powerful tool for several problems of the dual combinatorics of the characters of the symmetric groups and asymptotic representation theory, in particular to Kerov polynomials.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.