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

From MaRDI portal
(Redirected from Publication:1010865)
\((\ell,0)\)-Carter partitions, their crystal-theoretic behavior and generating function



Abstract: In this paper we give an alternate combinatorial description of the "(ell,0)-JM partitions" (see cite{F}) that are also ell-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 (ell,0)-JM partition is fundamentally related to the hook lengths of the partition. The representation-theoretic significance of their combinatoric on an ell-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 B(Lambda0) of the basic representation of hatmathfrakslell, whose nodes are labeled by ell-regular partitions. Here we give a fairly simple crystal-theoretic rule which generates all ell-regular (ell,0)-JM partitions in the graph B(Lambda0). 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 ell-regular) Specht modules which stay irreducible at a primitive ellth root of unity (for ell>2).


Summary: We give an alternate combinatorial description of the ``\((\ell,0)\)-Carter partitions. The representation-theoretic significance of these partitions is that they indicate the irreducibility of the corresponding specialized Specht module over the Hecke algebra of the symmetric group. Our main theorem is the equivalence of our combinatoric and the one introduced by James and Mathas, which is in terms of hook lengths. We use our result to find a generating series which counts 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(\Lambda_0)\) of the basic representation of \(\widehat{{sl}_{\ell}}\), whose nodes are labeled by \(\ell\)-regular partitions. Here we give a fairly simple crystal-theoretic rule which generates all \((\ell,0)\)-Carter partitions in the graph \(B(\Lambda_0)\).











This page was built for publication: \((\ell,0)\)-Carter partitions, their crystal-theoretic behavior and generating function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010865)