Affine standard Lyndon words
Representation Theory
2025-05-22 v1 Combinatorics
Quantum Algebra
Abstract
In this note, we establish the convexity and monotonicity for affine standard Lyndon words in all types, generalizing the -type results of arXiv:2305.16299. We also derive partial results on the structure of imaginary standard Lyndon words and present a conjecture for their general form. Additionally, we provide computer code in Appendix which, in particular, allows to efficiently compute affine standard Lyndon words in exceptional types for all orders.
Cite
@article{arxiv.2505.15432,
title = {Affine standard Lyndon words},
author = {Corbet Elkins and Alexander Tsymbaliuk},
journal= {arXiv preprint arXiv:2505.15432},
year = {2025}
}
Comments
v1: 45 pages, comments are welcome!