Recurrence / CONCEPT
Maximal-Block Evolution in a Uniform Fixed Word
A support-stabilized uniform morphism gives boundary-safe predecessor and successor control for actual maximal blocks.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES4
PROOF DEPTH0
DOCUMENT LINKS1
A positive power stabilizes every letter support
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
RELATED KNOWLEDGE
Structural connections
- Actual Maximal-Block Descentstructural-affinity · Closed
- Automatic Apwenian Sequences with One Odd Letterstructural-affinity · Closed
- Complete Palindrome Cut Bit Relationstructural-affinity · Closed
- Even Palindromes in Period Doublingstructural-affinity · Closed
- Exact Odd-Palindrome Radiistructural-affinity · Closed
- Finite Level Generators for Binary Automatic Apwenian Sequencesstructural-affinity · Closed
- Finite-word attractors and factor transportstructural-affinity · Closed
- Signed-Digit Realization of Cut Bit Pathsstructural-affinity · Closed
- String attractors of cyclically maximal morphismsstructural-affinity · Closed
- The Period-Doubling Wordstructural-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