Papers
Topics
Authors
Recent
Search
2000 character limit reached

Weighted words at degree two, II: flat partitions, regular partitions, and application to level one perfect crystals

Published 2 Feb 2020 in math.CO, math.NT, and math.QA | (2002.00300v2)

Abstract: In a recent work, Keith and Xiong gave a refinement of Glaisher's theorem by using a Sylvester-style bijection. In this paper, we introduce two families of colored partitions, flat and regular partitions, and generalize the bijection of Keith and Xiong to these partitions. We then state two results, the first at degree one, where partitions have parts with primary colors, and the second result at degree two for secondary-colored partitions, using the result of the first paper of this series. These results allow us to easily retrieve the Frenkel-Kac character formulas of level one standard modules for the type $A_{2n}{(2)}, D_{n+1}{(2)}$ and $B_n{(1)}$, and also to make the connection between the result stated in paper one and the representation theory.

Summary

Paper to Video (Beta)

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.

Authors (1)

Collections

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