Words / CONCEPT
Uniqueness of Lyndon factorization
A nonincreasing factorization into Lyndon words is unique over any linearly ordered alphabet.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH1
DOCUMENT LINKS0
The final factor is the minimum nonempty suffix
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Christoffel words need not attain the Lyndon-factor minimumstructural-affinity · Closed
- CutoffCoefficientAlgebrastructural-affinity · Closed
- IndexedShuffleOrderstructural-affinity · Closed
- LyndonBracketAlgebrastructural-affinity · Closed
- LyndonBracketLeadingstructural-affinity · Closed
- LyndonFactorizationstructural-affinity · Closed
- LyndonOrderstructural-affinity · Closed
- LyndonStandardFactorizationstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance