Words / CONCEPT
Poisson Error for Closed Fair Words
Bound the probability that one closed fair Boolean word avoids k consecutive ones.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
Uniform absolute error and two supplementary probability bounds
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
- D-Bonacci Namesstructural-affinity · Closed
- D-Bonacci Valuesstructural-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
- Run Starts in a Closed Boolean Wordstructural-affinity · Closed
- Tribonacci Representationstructural-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