Affine standard Lyndon words
Corbet Elkins, Alexander Tsymbaliuk

TL;DR
This paper generalizes properties of affine standard Lyndon words across all types, explores their structure, and offers computational tools for their efficient calculation, extending previous results in type A.
Contribution
It establishes convexity and monotonicity for affine standard Lyndon words in all types and provides computational methods for exceptional types.
Findings
Convexity and monotonicity proven for all types
Partial results on imaginary standard Lyndon words
Computer code for efficient computation in exceptional types
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems
