Papers
Topics
Authors
Recent
Search
2000 character limit reached

Atomic decomposition of characters and crystals

Published 4 Sep 2018 in math.RT and math.CO | (1809.01262v3)

Abstract: Lascoux stated that the type A Kostka-Foulkes polynomials K_{lambda,mu}(t) expand positively in terms of so-called atomic polynomials. For any semisimple Lie algebra, the former polynomial is a t-analogue of the multiplicity of the dominant weight mu in the irreducible representation of highest weight lambda. We formulate the atomic decomposition in arbitrary type, and view it as a strengthening of the monotonicity of K_{lambda,mu}(t). We also define a combinatorial version of the atomic decomposition, as a decomposition of a modified crystal graph. We prove that this stronger version holds in type A (which provides a new, conceptual approach to Lascoux's statement), in types B, C, and D in a stable range for t=1, as well as in some other cases, while we conjecture that it holds more generally. Another conjecture stemming from our work leads to an efficient computation of K_{lambda,mu}(t). We also give a geometric interpretation.

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.