Words / CONCEPT
Greedy Remainders and Ordered Image Prefixes
An ordered greedy cut theorem for zero-run substitutions with dominant zero images.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH2
DOCUMENT LINKS0
All proper image prefixes are reconstructed in order
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
- Attained summaries and finite-block prefix queriesstructural-affinity · Closed
- Attractors of periodic prefix familiesstructural-affinity · Closed
- BoundedPowersstructural-affinity · Closed
- DiophantineExponentCriterionstructural-affinity · Closed
- MorphicDecompositionstructural-affinity · Closed
- Morphism Iteration Bound Arithmeticstructural-affinity · Closed
- Morphism Iteration Bound Defsstructural-affinity · Closed
- Sentinel Desubstitution of the m-bonacci Wordstructural-affinity · Closed
- The original H and its morphic wordstructural-affinity · Closed
- Words: Word Powerstructural-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