Representations of Khovanov–Lauda–Rouquier algebras and combinatorics of Lyndon words

By Alexander S. Kleshchev, Arun Ram. 2009

99 citations recorded by the source corpus.

We construct irreducible representations of affine Khovanov–Lauda–Rouquier algebras of arbitrary finite type. The irreducible representations arise as simple heads of appropriate induced modules, and thus our construction is similar to that of Bernstein and Zelevinsky for affine Hecke algebras of type A. The highest weights of irreducible modules are given by the so-called good words, and the highest weights of the ‘cuspidal modules’ are given by the good Lyndon words. In a sense, this has been predicted by Leclerc.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/3e97db870a15c4b65aaa318f92a8c3a839750c78

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Ben Webster
  2. Peter J. McNamara
  3. Aaron D. Lauda
  4. Sabin Cautis
  5. Monica Vazirani
  6. E. Witten

In Discrete Mathematics and Combinatorics

  1. Aaron D. Lauda
  2. Sabin Cautis
  3. Peter J. McNamara
  4. Ben Webster
  5. Monica Vazirani
  6. Mikhail Khovanov
  7. Raphaël Rouquier

In Geometry and Topology

  1. Aaron D. Lauda
  2. Ben Webster
  3. Sabin Cautis
  4. Mikhail Khovanov
  5. Monica Vazirani
  6. David E. V. Rose
  7. Peter J. McNamara
  8. Hoel Queffelec

Citations in the corpus