Words / CONCEPT
Uniform Recurrence of the Golden Word
Give an explicit linear window in which every finite golden-word factor recurs.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH11
DOCUMENT LINKS1
Every factor recurs wholly inside every B(n)-window
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- An Invariant Measure on the Golden Word Subshiftstructural-affinity · Closed
- Minimality of the Golden Word Subshiftstructural-affinity · Closed
- Pointwise Substitution Fixed Point of the Golden Wordstructural-affinity · Closed
- Polynomial Complexity and Subshift Hausdorff Dimensionstructural-affinity · Closed
- Return Words of the Golden Word: the Length-One Casestructural-affinity · Closed
- The Minimal Forward-Shift Action on the Golden Subshiftstructural-affinity · Closed
- Topology and Cardinality of Word Subshiftsstructural-affinity · Closed
- Words: Adjacent Golden Occurrences Interfacestructural-affinity · Closed
- Words: Golden Factor Complexitystructural-affinity · Closed
- Words: Golden Gap First Returnstructural-affinity · Closed
- Words: Golden Occurrence Gapsstructural-affinity · Closed
- Words: Golden Phase Shiftstructural-affinity · Closed
- Words: Golden Recurrencestructural-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