StatisticalMechanics / CONCEPT
Straight continuations and finite path counts
For every fixed relative ordering, complete ordered deletion from the single parent blocker has at least one path at every depth. Complete counts and geometric-memory counts at every positive radius are bounded by three to the depth, including depth zero.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS1
Positive complete counts and uniform upper bounds
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Certified Radius-Four Growth Boundstructural-affinity · Closed
- Constructed controller shadowsstructural-affinity · Closed
- Finite-Depth Exactness of Geometric Memorystructural-affinity · Closed
- Geometric Memory Refinementstructural-affinity · Closed
- L Polyominoes and Skipped Numbersstructural-affinity · Closed
- RadiusThreeCertificatesstructural-affinity · Closed
- SquareGridCoordinatesstructural-affinity · Closed
- Uniform Block Bounds from Complete Prefixesstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance