Combinatorics / CONCEPT
Exact labelled dyadic allocation
Exact labelled dyadic allocation.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES3
PROOF DEPTH0
DOCUMENT LINKS0
Exact labelled dyadic allocation
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- At most two fresh labels augment every native legal wordstructural-affinity · Closed
- Coupled allocation from least-fresh ownershipstructural-affinity · Closed
- Physical multiplicities and low-denomination budgetsstructural-affinity · Closed
- Realizing allocated coins as actual legal reset wordsstructural-affinity · Closed
- Reset decomposition of arbitrary legal wordsstructural-affinity · Closed
- The native repeated one-bit source and its exact stripstructural-affinity · Closed
- Three-row cyclic source family at half-modulus capacitystructural-affinity · Closed
- Two opposite LARGE labels: the complete three-case exchangestructural-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