Combinatorics / CONCEPT
Bounds from a Distinguished Heap
A distinguished heap bounds removal amounts and divisor counts. Separating moves that preserve this heap from moves that replace it gives a uniform recurrence for the Sprague–Grundy value.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
The reference heap bounds every removal
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 counterexample to the printed CRIM formulastructural-affinity · Closed
- Actual gcd-six source reductionstructural-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
- Paired Dyadic Removalsstructural-affinity · Closed
- The complete mixed two/four formulastructural-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