Affine standard Lyndon words
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913850848182272 |
|---|---|
| author | Elkins, Corbet Tsymbaliuk, Alexander |
| author_facet | Elkins, Corbet Tsymbaliuk, Alexander |
| contents | In this note, we establish the convexity and monotonicity for affine standard Lyndon words in all types, generalizing the $A$-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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_15432 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Affine standard Lyndon words Elkins, Corbet Tsymbaliuk, Alexander Representation Theory Combinatorics Quantum Algebra In this note, we establish the convexity and monotonicity for affine standard Lyndon words in all types, generalizing the $A$-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. |
| title | Affine standard Lyndon words |
| topic | Representation Theory Combinatorics Quantum Algebra |
| url | https://arxiv.org/abs/2505.15432 |