Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems Bn,Cn and Dn.
Cedric Lecouvey
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.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell