Combinatorics / CONCEPT
A Lower Bound for Deterministic Fair-Input Window Rules
An odd-parity cycle forces a transport defect, while each proper context is fair.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS1
Every table obeys the lower bound
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
- 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
- OddConstructionstructural-affinity · Closed
- Parity-Conditioned Product Momentsstructural-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