Combinatorics / CONCEPT
Realizing allocated coins as actual legal reset words
Realizing allocated coins as actual legal reset words.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS0
Realizing allocated coins as actual legal reset 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
- An unbounded obstruction forces mixed SMALL/LARGE insertionstructural-affinity · Closed
- At most two fresh labels augment every native legal wordstructural-affinity · Closed
- Coupled allocation from least-fresh ownershipstructural-affinity · Closed
- Exact labelled dyadic allocationstructural-affinity · Closed
- Physical multiplicities and low-denomination budgetsstructural-affinity · Closed
- Reset decomposition of arbitrary legal wordsstructural-affinity · Closed
- The native repeated one-bit source and its exact stripstructural-affinity · Closed
- Three-bit circle sources at half-modulus capacitystructural-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