Papers
Topics
Authors
Recent
2000 character limit reached

Schur partition theorems via perfect crystal (1609.01905v3)

Published 7 Sep 2016 in math.QA, math.CO, math.NT, and math.RT

Abstract: Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that of strict partitions. We prove that each set has a basic $A{(2)}_{p-1}$-crystal structure. For $p=3$, it reproves Schur's 1926 partition theorem, a mod 6 analog of Rogers-Ramanujan partition theorem (RRPT). For $p=5$, it gives a computer-free proof of a conjecture by Andrews during his 3-parameter generalization of RRPT, which was first proved by Andrews-Bessenrodt-Olsson.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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