Combinatorics / CONCEPT
Classification when all intervals are prefixes
For n at least two, A(n) does not end in its minimum and B(n) does. A permutation of size n belongs to D and has every proper nontrivial interval starting at its first position if and only if it equals A(n) or B(n).
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH6
DOCUMENT LINKS1
Classification when all intervals are prefixes
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 nonterminal prefix-only permutationstructural-affinity · Closed
- An interval crossing a fixed gapstructural-affinity · Closed
- Contracting the first two entriesstructural-affinity · Closed
- Deleting a minimum in the second positionstructural-affinity · Closed
- Inserting a minimum in an early gapstructural-affinity · Closed
- Intervals within a single inflated blockstructural-affinity · Closed
- Recovering a skeleton from a consecutive-value blockstructural-affinity · Closed
- Simple members of Dstructural-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