Combinatorics / CONCEPT
Classification of a terminal crossing gap
Let p be a permutation of size n at least four in D ending with its minimum. Suppose every proper nontrivial interval crosses the gap of zero-based index two strictly and has minimum value at least two. Then p = R(n).
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS1
Classification of a terminal crossing gap
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
- An exhausted lower chainstructural-affinity · Closed
- Deletion before the minimum when the maximum is secondstructural-affinity · Closed
- Inserting a minimum in an early gapstructural-affinity · Closed
- Insertion before the minimum when the maximum is secondstructural-affinity · Closed
- Intervals and simplicity in the terminal familiesstructural-affinity · Closed
- Intervals when the maximum is secondstructural-affinity · Closed
- Simple members of Dstructural-affinity · Closed
- Simplicity after prepending twostructural-affinity · Closed
- The five cases for a third-position minimumstructural-affinity · Closed
- The unique proper interval of an odd extrastructural-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