($\ell,0)$-Carter partitions, a generating function, and their crystal theoretic interpretation
Chris Berg, Monica Vazirani

TL;DR
This paper provides a new combinatorial description of $( ext{ell},0)$-JM partitions, relates it to crystal graphs, and uses it to count such partitions and analyze their representation-theoretic significance.
Contribution
It introduces an alternative combinatorial characterization of $( ext{ell},0)$-JM partitions and connects this to crystal graph structures and representation theory.
Findings
Established equivalence with James and Mathas's characterization.
Derived a generating function for counting partitions by first part.
Provided a crystal-theoretic rule for generating all relevant partitions.
Abstract
In this paper we give an alternate combinatorial description of the "-JM partitions" (see \cite{F}) that are also -regular. Our main theorem is the equivalence of our combinatoric and the one introduced by James and Mathas (\cite{JM}). The condition of being an -JM partition is fundamentally related to the hook lengths of the partition. The representation-theoretic significance of their combinatoric on an -regular partition is that it indicates the irreducibility of the corresponding specialized Specht module over the finite Hecke algebra (see \cite{JM}). We use our result to find a generating series which counts the number of such partitions, with respect to the statistic of a partition's first part. We then apply our description of these partitions to the crystal graph of the basic representation of , whose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Molecular spectroscopy and chirality
