(,0)-Carter partitions, a generating function, and their crystal theoretic interpretation

Abstract

In this paper we give an alternate combinatorial description of the "(,0)-JM partitions" (see F) that are also -regular. Our main theorem is the equivalence of our combinatoric and the one introduced by James and Mathas (JM). The condition of being an (,0)-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 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 B(0) of the basic representation of sl, whose nodes are labeled by -regular partitions. Here we give a fairly simple crystal-theoretic rule which generates all -regular (,0)-JM partitions in the graph B(0). Finally, we mention how our construction can be generalized to recent results of M. Fayers (see F) and S. Lyle (see L) to count the total number of (not necessarily -regular) Specht modules which stay irreducible at a primitive root of unity (for >2).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…