arxiv: 2605.15027 · v1 · submitted 2026-05-14 · 🧮 math.RT · math.CO· math.QA

Recognition: 2 theorem links

· Lean Theorem

Chains of affine standard Lyndon words

Corbet Elkins , Alexander Tsymbaliuk

Authors on Pith no claims yet

Pith reviewed 2026-05-15 02:36 UTC · model grok-4.3

classification 🧮 math.RT math.COmath.QA

keywords affine root systemsLyndon wordsperiodicitystandard wordsroot system polarizationconvexitymonotonicityquantum groups

0 comments

The pith

Chains of affine standard Lyndon words are periodic in every root system type with tight period bounds.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that chains formed by affine standard Lyndon words repeat periodically across all finite types of root systems. It gives explicit tight bounds on the length of each period and shows these hold uniformly. The argument rests on convexity and monotonicity properties of roots combined with a new polarization that splits the system into increasing and decreasing chains. A reader would care because such chains organize bases and filtrations in quantum groups and affine algebras, so periodicity supplies a regular structure that could simplify explicit calculations.

Core claim

We establish the periodicity of chains of affine standard Lyndon words in all types and determine tight bounds on that periodicity by utilizing the convexity and monotonicity properties together with the polarization of the root system into increasing and decreasing chains.

What carries the argument

Polarization of the root system into increasing and decreasing chains, which organizes the ordering of the Lyndon words so that periodicity can be read off directly from the root data.

If this is right

The same periodicity and bounds apply uniformly to every affine type rather than only type A.
The polarization construction yields a uniform proof that works once convexity and monotonicity are granted.
Tight bounds on the period are determined explicitly from the root system data.
The chains inherit a regular repeating structure that organizes standard bases in the corresponding quantum or affine algebras.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The periodicity may give a recursive way to generate all standard Lyndon words without enumerating the full set each time.
Similar polarization techniques could apply to other ordered bases or filtrations in Kac-Moody theory.
Explicit period formulas might be checked computationally in small exceptional types to confirm the bounds.

Load-bearing premise

Convexity and monotonicity of the roots hold in the types considered, and splitting the system into increasing and decreasing chains correctly reflects the ordering required by the Lyndon words.

What would settle it

An explicit computation of a Lyndon-word chain in type E6 or E7 that fails to repeat after the predicted number of steps.

read the original abstract

In this note, we establish the periodicity of chains of affine standard Lyndon words in all types and determine tight bounds on that periodicity, greatly generalizing the $A$-type results of arXiv:2305.16299. Our approach crucially utilizes the convexity and monotonicity of arXiv:2505.15432 together with the new idea to consider the polarization of the root system given by increasing and decreasing chains.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This note pushes the periodicity of affine standard Lyndon word chains from type A to all types via a polarization split on the root system, but the key transfer of convexity properties from the cited prior work needs explicit checks in non-simply-laced cases.

read the letter

The core result is a uniform statement on the periodicity of these chains across all affine types together with tight bounds on the period. That generalizes the earlier A-type paper directly and supplies numbers that could plug into other calculations in the area. The new ingredient is the polarization of the root system into increasing and decreasing chains, which the authors say lets the convexity and monotonicity statements carry over without change. They treat this split as the device that removes the type-A restriction. On the positive side, the argument is presented cleanly in outline and the bounds are stated explicitly rather than left asymptotic. That makes the claim falsifiable in principle once the details are filled in. The main soft spot is the reliance on the convexity and monotonicity properties from arXiv:2505.15432 surviving the polarization unchanged. The note does not appear to include separate verification or small-case checks for the non-simply-laced affine types, where root-length differences might interact with the new ordering in ways that break monotonicity. If those properties do not transfer exactly, the chain construction and the periodicity conclusion would need adjustment for types B, C, F, and G. The citation pattern is standard and points to the right prior results without circularity in the new claim itself. This is aimed at readers already working on combinatorial representation theory of affine Lie algebras, especially those who know the A-type Lyndon-word results and the convexity paper. Someone in that niche can extract the bounds and the polarization idea quickly. I would send it to peer review. The generalization is worth a careful look even if the transfer step needs more supporting calculations or examples.

Referee Report

2 major / 2 minor

Summary. The paper claims to establish the periodicity of chains of affine standard Lyndon words in all affine types, together with tight bounds on the period, by combining the convexity and monotonicity results of arXiv:2505.15432 with a new polarization of the root system into increasing and decreasing chains; this is presented as a direct generalization of the A-type case treated in arXiv:2305.16299.

Significance. If the central argument is sound, the result supplies a uniform periodicity statement and explicit bounds across all affine types, which would be a useful combinatorial tool in the study of affine root systems and Lyndon words. The explicit use of an independent polarization construction is a clear technical contribution.

major comments (2)

[Polarization construction (following the abstract)] The transfer of convexity and monotonicity from arXiv:2505.15432 to the polarized ordering is asserted but not verified for non-simply-laced types. The polarization redefines the total order via increasing and decreasing chains; without an explicit check that height functions and root-length comparisons remain monotonic under this reordering (especially when long and short roots interact), the periodicity claim for types B, C, F, G rests on an unproven extension of the cited properties.
[Main theorem and proof outline] The derivation of the tight bounds on periodicity is obtained by combining the polarized chains with the convexity statements; however, the manuscript provides no independent verification or counter-example check that the Lyndon-word chains coincide exactly with the chains induced by the polarized order once root lengths differ. This step is load-bearing for the 'all types' claim.

minor comments (2)

[Abstract] The abstract states that tight bounds are determined but does not record the explicit form of those bounds; adding a one-sentence indication of the period (e.g., 'period equal to the Coxeter number') would improve readability.
[Section 2] Notation for the increasing and decreasing chains is introduced without a displayed definition or comparison table; a small diagram or explicit formula for the polarized height function would clarify the construction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive major comments. We agree that explicit verification of the transfer of convexity/monotonicity and of the chain coincidence in non-simply-laced cases will strengthen the manuscript. We will revise accordingly while preserving the core argument that the polarization construction extends the A-type results uniformly.

read point-by-point responses

Referee: [Polarization construction (following the abstract)] The transfer of convexity and monotonicity from arXiv:2505.15432 to the polarized ordering is asserted but not verified for non-simply-laced types. The polarization redefines the total order via increasing and decreasing chains; without an explicit check that height functions and root-length comparisons remain monotonic under this reordering (especially when long and short roots interact), the periodicity claim for types B, C, F, G rests on an unproven extension of the cited properties.

Authors: We thank the referee for highlighting this point. The polarization (defined in Section 3 via the decomposition into increasing and decreasing chains) is constructed precisely so that the height function remains strictly monotonic on each chain and the root-length comparisons are inherited from the original partial order. Because arXiv:2505.15432 establishes convexity and monotonicity with respect to any total order compatible with the root poset (including length distinctions), the transfer holds for all affine types. Nevertheless, to address the concern directly we will insert a new lemma (Lemma 3.4 in the revision) that verifies monotonicity of heights and lengths under the polarized reordering for types B, C, F, G, with explicit checks on the long/short root interactions. revision: yes
Referee: [Main theorem and proof outline] The derivation of the tight bounds on periodicity is obtained by combining the polarized chains with the convexity statements; however, the manuscript provides no independent verification or counter-example check that the Lyndon-word chains coincide exactly with the chains induced by the polarized order once root lengths differ. This step is load-bearing for the 'all types' claim.

Authors: The main theorem (Theorem 4.1) derives the periodicity bounds directly from the fact that the standard Lyndon words are taken with respect to the polarized total order; the convexity statements of arXiv:2505.15432 then imply that the resulting chains are periodic with the stated periods. The coincidence between Lyndon chains and polarized chains follows immediately from the definition of standard Lyndon words (Section 2) once the order is fixed. We acknowledge, however, that an explicit verification for cases with differing root lengths would improve readability. In the revised manuscript we will add a short subsection (4.3) containing direct checks in types B_2^{(1)} and G_2^{(1)} confirming that the Lyndon chains match the polarized chains exactly, together with a brief argument why length differences do not alter the equality. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation combines cited prior theorems with independent new construction.

full rationale

The manuscript cites arXiv:2505.15432 for convexity and monotonicity properties and arXiv:2305.16299 for the A-type base case. It then introduces an independent polarization of the root system into increasing and decreasing chains as the key new idea. No equation, definition, or derivation step reduces the claimed periodicity or bounds to a fitted input, self-defined quantity, or unverified self-citation chain by construction. The central result is obtained by applying the cited properties under the new ordering, which adds non-trivial content. This is standard mathematical reliance on prior results rather than circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard combinatorial axioms for Lyndon words and root systems plus two domain assumptions imported from cited preprints; no free parameters or invented entities are introduced in the abstract.

axioms (1)

domain assumption Convexity and monotonicity of the relevant root systems (arXiv:2505.15432)
Explicitly invoked as crucial for the proof.

pith-pipeline@v0.9.0 · 5352 in / 1114 out tokens · 26693 ms · 2026-05-15T02:36:11.377059+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 5.24. For any ch(α) ∈ D, let M′1(α)=(δ,i). ... periodicity pattern

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

[1]

Avdieiev, A

Y. Avdieiev, A. Tsymbaliuk, Affine standard Lyndon words: A-type , Int.\ Math.\ Res.\ Not.\ IMRN (2024), no. 21, 13488--13524

work page 2024
[2]

Carter, Lie Algebras of finite and affine Type , Cambridge University Press, Cambridge (2005), xviii+632pp

R. Carter, Lie Algebras of finite and affine Type , Cambridge University Press, Cambridge (2005), xviii+632pp

work page 2005
[3]

Elkins, A

C. Elkins, A. Tsymbaliuk, Affine standard Lyndon words , preprint, ar iv:2505.15432

work page arXiv
[4]

Kac, Infinite dimensional Lie algebras , Cambridge University Press, Cambridge (1990), xxii+400pp

V. Kac, Infinite dimensional Lie algebras , Cambridge University Press, Cambridge (1990), xxii+400pp

work page 1990
[5]

Lalonde, A

P. Lalonde, A. Ram, Standard Lyndon bases of Lie algebras and enveloping algebras , Trans.\ Amer.\ Math.\ Soc.\ 347 (1995), no. 5, 1821--1830

work page 1995
[6]

Leclerc, Dual canonical bases, quantum shuffles and q -characters , Math.\ Z.\ 246 (2004), no

B. Leclerc, Dual canonical bases, quantum shuffles and q -characters , Math.\ Z.\ 246 (2004), no. 4, 691--732

work page 2004
[7]

Lothaire, Combinatorics of words , Cambridge University Press, Cambridge (1997), xviii+238pp

M. Lothaire, Combinatorics of words , Cambridge University Press, Cambridge (1997), xviii+238pp

work page 1997
[8]

Melan c on, Combinatorics of Hall trees and Hall words , J.\ Combinat.\ Theory A 59 (1992), no

G. Melan c on, Combinatorics of Hall trees and Hall words , J.\ Combinat.\ Theory A 59 (1992), no. 2, 285--308

work page 1992
[9]

Negu t , A

A. Negu t , A. Tsymbaliuk, Quantum loop groups and shuffle algebras via Lyndon words , Adv.\ Math.\ 439 (2024), Paper No. 109482, 69pp

work page 2024
[10]

Rosso, Lyndon bases and the multiplicative formula for R -matrices , unpublished preprint (2002)

M. Rosso, Lyndon bases and the multiplicative formula for R -matrices , unpublished preprint (2002)

work page 2002