C. Lecouvey

activity

20022004

most citedSchensted-type correspondences and plactic monoids for types

B_{n}

and

D_{n}

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

collaborators

Showing math.QAShow all

2 papers · 1 filter

math.QA2002★ 2 cited

An algorithm for computing the global basis of a finite dimensional irreducible $U_{q} (s o_{2 n + 1})$ or $U_{q} (s o_{2 n})$ -module

Cedric Lecouvey

We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional $U_{q} (s o_{2 n + 1})$ or $U_{q} (s o_{2 n})$ -module.

math.QA2002

An algorithm for computing the global basis of an irreducible $U_{q} (s p_{2 n})$ -module

Cedric Lecouvey

We describe a simple algorithm for computing the canonical basis of any finite-dimensional $U_{q} (s p_{2 n})$ -module.

An algorithm for computing the global basis of a finite dimensional irreducible Uq​(so2n+1​) or Uq​(so2n​)-module

An algorithm for computing the global basis of an irreducible Uq​(sp2n​)-module

An algorithm for computing the global basis of a finite dimensional irreducible $U_{q} (s o_{2 n + 1})$ or $U_{q} (s o_{2 n})$ -module

An algorithm for computing the global basis of an irreducible $U_{q} (s p_{2 n})$ -module