Arith / CONCEPT
Signed Bounds for Chronological Fibonacci Words
Every literal Fibonacci and swap word has a two-sided signed coefficient bound.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH2
DOCUMENT LINKS1
Both signs, both denominators, and integral chronology
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
- Fibonacci Graft Words and Complete Composition Statesstructural-affinity · Closed
- Identical-row worlds and complete suffix annihilationstructural-affinity · Closed
- Polynomial gain and unrestricted deterministic feedbackstructural-affinity · Closed
- Positive Rulings and Actual Second Queriesstructural-affinity · Closed
- Sharp Fibonacci Bounds for Literal Matrix Wordsstructural-affinity · Closed
- Shifted Euler interpolation and exact gain readoutstructural-affinity · Closed
- Three source directions in every mixed wordstructural-affinity · Closed
- Whole worlds and literal acquisition historiesstructural-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