Standard Lyndon Loop Words: Weighted Orders
Abstract We generalize the study of standard Lyndon loop words from [16] to a more general class of orders on the underlying alphabet, as suggested in [16, Remark 3.15]. The main new ingredient is the exponent-tightness of these words, which also allows to generalize the construction of PBW bases of the untwisted quantum loop algebra $U_{q}(L{{\mathfrak{g}}})$ via the combinatorics of loop words.
Authors
- Alexander Tsymbaliuk (ORCID: https://orcid.org/0000-0002-9099-3186)
- Nazar Korniichuk
- Severyn Khomych
- Kostiantyn Molokanov
Institutions
- University of Vienna (AT)
- Purdue University West Lafayette (US)
- IIT@MIT (US)
- Technische Universität Berlin (DE)
Publication Details
- Journal
- International Mathematics Research Notices
- Published
- 2025-03-01
- DOI
- https://doi.org/10.1093/imrn/rnaf030
- Primary Topic
- Logic, programming, and type systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00