TotalVariation / CONCEPT
Finite Parry window upper bounds
Fixed minimizer tables for actual finite-k Parry windows.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH7
DOCUMENT LINKS1
Fixed word orders and endpoint labels
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 Finite Upper Bound for Fair-Source Window Defectsstructural-affinity · Closed
- A Lower Bound for Deterministic Fair-Input Window Rulesstructural-affinity · Closed
- Actual mixing and complete-prefix comparisonstructural-affinity · Closed
- Asymptotics of the Optimal Fair-Window Defectstructural-affinity · Closed
- Complete zero runs and the shared window rulestructural-affinity · Closed
- Conditional Parry words and collisionsstructural-affinity · Closed
- Deterministic Word-Minimum Window Tablesstructural-affinity · Closed
- Dominance Memory for Actual Binary Windowsstructural-affinity · Closed
- Mixing and measurable selection for the bilateral Parry sourcestructural-affinity · Closed
- Twisted Rotation and Parry Window Defectsstructural-affinity · Closed
- Unique parsing of complete Parry runsstructural-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