Work

Affine Standard Lyndon Words: A-Type

Year: 2024
Type: article
Abstract: We generalize an algorithm of Leclerc [ 6] describing explicitly the bijection of Lalonde–Ram [ 5] from finite to affine Lie algebras. In type $A_{n}^{(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.
Language: English
Open Access status: bronze
OpenAlex ID: W4403007679
FWCI: 1.065
Cites: 11
Cited by: 1
Related to: 10