Combinatorics / CONCEPT
At most two fresh labels augment every native legal word
At most two fresh labels augment every native legal word.
Closed
DIRECT PREREQUISITES5
DIRECT CONSEQUENCES1
PROOF DEPTH6
DOCUMENT LINKS0
At most two fresh labels augment every native legal word
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
- Coupled allocation from least-fresh ownershiptruth-dependency · Closed
- Physical multiplicities and low-denomination budgetstruth-dependency · Closed
- Realizing allocated coins as actual legal reset wordstruth-dependency · Closed
- Reset decomposition of arbitrary legal wordstruth-dependency · Closed
- The native repeated one-bit source and its exact striptruth-dependency · Closed
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- An unbounded obstruction forces mixed SMALL/LARGE insertionstructural-affinity · Closed
- Coupled allocation from least-fresh ownershipstructural-affinity · Closed
- Exact labelled dyadic allocationstructural-affinity · Closed
- Physical multiplicities and low-denomination budgetsstructural-affinity · Closed
- Physical source and prefix supportstructural-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
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