Words / CONCEPT
TwoDeletionRunDecks
Exact binary run counts and input entropy for two deletions and insertions.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES4
PROOF DEPTH2
DOCUMENT LINKS0
blockLengths_positive
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
- AlternatingTwoDeletionCountsstructural-affinity · Closed
- BinaryRunSupersequenceCountsstructural-affinity · Closed
- CircularWordsstructural-affinity · Closed
- Constant Blocks and Distinct Run Sumsstructural-affinity · Closed
- DegreeGeneratingFunctionstructural-affinity · Closed
- Entropy maximisers need not have balanced degreesstructural-affinity · Closed
- MarkedDegreeEnumerationstructural-affinity · Closed
- Maximum Length of a Two-Dense Divisor Blockstructural-affinity · Closed
- MultiRunDegreesstructural-affinity · Closed
- RunTupleBijectionstructural-affinity · Closed
- SinghviMaxInputEntropystructural-affinity · Closed
- SingleRunDegreesstructural-affinity · Closed
- TransferResolventstructural-affinity · Closed
- TransferTuplesstructural-affinity · Closed
- Two-Dense Divisor Blocks Are Palindromicstructural-affinity · Closed
- TwoDeletionChannelEntropystructural-affinity · Closed
- TwoDeletionRunEntropyBoundsstructural-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