Combinatorics / CONCEPT
Reset decomposition of arbitrary legal words
Reset decomposition of arbitrary legal words.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH4
DOCUMENT LINKS0
Reset decomposition of arbitrary legal 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
- Full source completion from one actual opposite pairstructural-affinity · Closed
- Physical multiplicities and low-denomination budgetsstructural-affinity · Closed
- Realizing allocated coins as actual legal reset 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
- 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