Combinatorics / CONCEPT
Intervals when the maximum is second
Let p be a permutation of size at least four with maximum second. Suppose that, after its first two entries, the values above its first entry decrease and no value below its first entry has both a smaller and a larger such value later. Then p belongs to C. It has no adjacent entries with consecutive values if and only if it is simple or equals E(h) for some h at least two.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH5
DOCUMENT LINKS1
Intervals when the maximum is second
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
- Classification of a terminal crossing gapstructural-affinity · Closed
- Deletion before the minimum when the maximum is secondstructural-affinity · Closed
- Insertion before the minimum when the maximum is secondstructural-affinity · Closed
- Reverse vertical continuationstructural-affinity · Closed
- The alternating prefix before the minimumstructural-affinity · Closed
- The two value regions below a second-position maximumstructural-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