Affine Standard Lyndon words: A-type
Abstract
We generalize an algorithm of Leclerc describing explicitly the bijection of Lalonde-Ram from finite to affine Lie algebras. In type An(1), we compute all affine standard Lyndon words for any order of the simple roots, and establish some properties of the induced orders on the positive affine roots.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.