Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems Bn,Cn and Dn.
Abstract
We use Kashiwara-Nakashima's combinatorics of crystal graphs associated to the roots sytems Bn and Dn to extend the results of citelec3 and citeMor by showing that Morris type recurrence formulas also exist for the orthogonal root systems. We derive from these formulas a statistic on Kashiwara-Nakashima's tableaux of types Bn,Cn and Dn generalizing Lascoux-Sch0xfctzenberger's charge and from which it is possible to compute the Kostka-Foulkes polynomials Kλ ,μ(q) with restrictive conditions on (λ ,μ) . This statistic is different from that obtained in citelec3 from the cyclage graph structure on tableaux of type Cn. We show that such a structure also exists for the tableaux of types Bn and Dn but can not be simply related to the Kostka-Foulkes polynomials. Finally we give explicit formulas for Kλ ,μ(q) when | λ | ≤ 3, or n=2 and μ =0.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.