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 nodes are labeled by -regular partitions. Here we give a fairly simple crystal-theoretic rule which generates all -regular -JM partitions in the graph . Finally, we mention how our construction can be generalized to recent results of M. Fayers (see \cite{F}) and S. Lyle (see \cite{L}) to count the total number of (not necessarily -regular) Specht modules which stay irreducible at a primitive th root of unity (for ).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.