Words / CONCEPT
Run Starts in a Closed Boolean Word
Identify literal forbidden blocks with the bounded-run scanner and run-start count.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES6
PROOF DEPTH2
DOCUMENT LINKS1
Scanner, forbidden blocks, and zero run starts
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
- Direct concatenation without a separatortruth-dependency · Closed
- Hamming capacity and shortest actual wordstruth-dependency · Closed
- Integer intervals represented by run-avoiding wordstruth-dependency · Closed
- Joint legal realization over a finite coefficient ringtruth-dependency · Closed
- LiteralModeltruth-dependency · Closed
- Poisson Error for Closed Fair Wordstruth-dependency · Closed
RELATED KNOWLEDGE
Structural connections
- D-Bonacci Namesstructural-affinity · Closed
- Direct concatenation without a separatorstructural-affinity · Closed
- Hamming capacity and shortest actual wordsstructural-affinity · Closed
- Integer intervals represented by run-avoiding wordsstructural-affinity · Closed
- Joint legal realization over a finite coefficient ringstructural-affinity · Closed
- LiteralModelstructural-affinity · Closed
- Poisson Error for Closed Fair Wordsstructural-affinity · Closed
- Uniform D-Bonacci Base Gapstructural-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