Words / CONCEPT
The One-Sided Morse-Hedlund Theorem
Low factor complexity forces eventual periodicity for every one-sided word over a finite alphabet.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES4
PROOF DEPTH0
DOCUMENT LINKS1
Low factor complexity forces eventual periodicity
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
- A Counterexample Inside Vivion's Restricted Classtruth-dependency · Closed
- Natural Valuations Cannot Preserve Every Abelian Complexity Functiontruth-dependency · Closed
- Polynomial Complexity and Subshift Hausdorff Dimensiontruth-dependency · Closed
- Words: Morse Hedlund Conversetruth-dependency · Closed
RELATED KNOWLEDGE
Structural connections
- A Counterexample Inside Vivion's Restricted Classstructural-affinity · Closed
- CutoffCoefficientAlgebrastructural-affinity · Closed
- LyndonBracketAlgebrastructural-affinity · Closed
- LyndonOrderstructural-affinity · Closed
- LyndonStandardFactorizationstructural-affinity · Closed
- Natural Valuations Cannot Preserve Every Abelian Complexity Functionstructural-affinity · Closed
- Polynomial Complexity and Subshift Hausdorff Dimensionstructural-affinity · Closed
- Words: Morse Hedlund Conversestructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance