Affine Standard Lyndon Words: A-Type
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.
Authors
- Alexander Tsymbaliuk (ORCID: https://orcid.org/0000-0002-9099-3186)
- Yehor Avdieiev
Institutions
- University of Bonn (DE)
- Purdue University West Lafayette (US)
Publication Details
- Journal
- International Mathematics Research Notices
- Published
- 2024-09-30
- DOI
- https://doi.org/10.1093/imrn/rnae197
- Citations
- 1
- Primary Topic
- Algebraic structures and combinatorial models
- Type
- article
- Field-Weighted Citation Impact
- 1.01
Funders
- National Science Foundation