activity
20022004
most citedSchensted-type correspondences and plactic monoids for types and

4 citations · 12 across the 6 of their papers we have counts for

collaborators
Showing math.COShow all

5 papers · 1 filter

math.CO20043 cited

Combinatorics of crystal graphs and Kostka-Foulkes polynomials for the root systems and

Cedric Lecouvey

We use Kashiwara-Nakashima's combinatorics of crystal graphs associated to the roots sytems and to extend the results of \QCITE{cite}{}{lec3} and \QCITE{cite}{}{Mor…

math.CO2003

Kostka-Foulkes polynomials cyclage graphs and charge statistic for the root system

Cedric lecouvey

We establish a Morris type recurrence formula for the root system .\ Next we introduce cyclage graphs for the corresponding Kashiwara-Nakashima's tableaux and use them to de…

math.CO20024 cited

Schensted-type correspondences and plactic monoids for types and

Cedric lecouvey

We use Kashiwara's theory of crystal bases to study plactic monoids for and . Simultaneously we describe a Schensted type correspondence in the c…

math.CO20022 cited

Schensted type correspondence for type and computation of the canonical basis of a finite dimensional -module

cedric Lecouvey

We use Kang-Misra's combinatorial description of the crystal graphs for to introduce the plactic monoid for type . Then we describe the corresponding insertio…

math.CO2002

Schensted-type correspondence, plactic monoid and jeu de taquin for type C

Cedric Lecouvey

We use Kashiwara's theory of crystal bases to study the plactic monoid for type C. Then we describe the correponding sliding and bumping algorithms.