Combinatorics / CONCEPT
A Finite Upper Bound for Fair-Source Window Defects
One fixed deterministic window table attains a reciprocal endpoint bound with a collision correction.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS1
A deterministic table for every admissible word length
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
- A Lower Bound for Deterministic Fair-Input Window Rulesstructural-affinity · Closed
- Asymptotics of the Optimal Fair-Window Defectstructural-affinity · Closed
- Deterministic Word-Minimum Window Tablesstructural-affinity · Closed
- Finite Parry window upper boundsstructural-affinity · Closed
- Inner Products of Parity-Kernel Path Likelihoodsstructural-affinity · Closed
- Mixing and measurable selection for the bilateral Parry sourcestructural-affinity · Closed
- Proper Coordinate Records of Parity Kernelsstructural-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