Combinatorics / CONCEPT
Deterministic Word-Minimum Window Tables
Offline word orderings and labels have an exact average defect on every context without repeated words.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS1
Exact defect on a context with distinct words
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
- Conditional Parry words and collisionsstructural-affinity · Closed
- Finite Parry window upper boundsstructural-affinity · Closed
- Inner Products of Parity-Kernel Path Likelihoodsstructural-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