Combinatorics / CONCEPT
The size distribution of nonadjacent supports
Every size fiber of actual legal Boolean words is counted by a binomial coefficient.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
Uniform size-refined count
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 missing amplitude in the pruned qutrit Dicke circuitstructural-affinity · Closed
- Constrained harmonic optimizationstructural-affinity · Closed
- Counting legal-word toggle edges by deletionstructural-affinity · Closed
- Degrees and the sharp count bound for legal wordsstructural-affinity · Closed
- Legal chain integral and polar coordinatesstructural-affinity · Closed
- Legal chain moment and phase reductionstructural-affinity · Closed
- Legal-word block growthstructural-affinity · Closed
- Quantum twins and neighbourhood separationstructural-affinity · Closed
- RRO Tail Linear-Length Setsstructural-affinity · Closed
- Sahbi's hypercube sub-quorum conjecturestructural-affinity · Closed
- Signed boundaries of legal-word toggle graphsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance