Combinatorics / CONCEPT
Paired Dyadic Removals
Two removals of the same dyadic amount from a heap deeper than the unique minimum produce exactly two minimum-depth heaps.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
The intermediate heap and its second remainder
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
- A nonheavy partition below a heavy rectanglestructural-affinity · Closed
- Bounds from a Distinguished Heapstructural-affinity · Closed
- Distinguished Heaps Two and Fourstructural-affinity · Closed
- Distinguished-Heap Recurrence Estimatesstructural-affinity · Closed
- Divisor Nim and Minimum Excluded Valuesstructural-affinity · Closed
- Dyadic Depth and Zero Positionsstructural-affinity · Closed
- Finite mex block propagationstructural-affinity · Closed
- Splythoff Nim: all Grundy values in every row and columnstructural-affinity · Closed
- Stabilization of Nested Mex Mapsstructural-affinity · Closed
- The Boundary Counterexample to CRIM Conjecture 2structural-affinity · Closed
- The Distinguished Heap Eightstructural-affinity · Closed
- The maximum number of strongly complementary permutation matricesstructural-affinity · Closed
- The Sharper Sprague–Grundy Bound for Divisor Nimstructural-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