arXiv · 2305.16299
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 $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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yehor Avdieiev, Alexander Tsymbaliuk. 2023-05-25. Affine Standard Lyndon words: A-type. https://doi.org/10.1093/imrn%2Frnae197
Cite the original work for its findings. Save a collection to share your selection of sources.