Combinatorics / CONCEPT
The Descending High Prefix
The terminal value fixes the length and values of a decreasing high prefix.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH11
DOCUMENT LINKS1
The high prefix values
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 Cycle Forced by Two Successorsstructural-affinity · Closed
- A Descending Parameter at the First Endpointstructural-affinity · Closed
- Bounds from the Parameter Cyclestructural-affinity · Closed
- Classification at the First Endpointstructural-affinity · Closed
- Cycle Compatibility of Insertionstructural-affinity · Closed
- Insertion of Three Lettersstructural-affinity · Closed
- Recovering a Smaller Cycle from Insertionstructural-affinity · Closed
- The Final Pair from a Small Second Valuestructural-affinity · Closed
- The Increasing Tail Familystructural-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