Combinatorics / CONCEPT
The alternating prefix before the minimum
Let p be a permutation of size n at least four with maximum second, and write a for its first entry. In the suffix after its first two entries, assume values above a decrease and no value below a has both a smaller and a larger such value later. If adjacent entries never have consecutive values and the minimum has zero-based position k, then every entry before k is prescribed: at even position i it equals a minus i/2, and at odd position i it equals n minus floor(i/2).
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH3
DOCUMENT LINKS1
The alternating prefix before the minimum
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 cut into decreasing chainsstructural-affinity · Closed
- An exhausted lower chainstructural-affinity · Closed
- Deletion before the minimum when the maximum is secondstructural-affinity · Closed
- Insertion before the minimum when the maximum is secondstructural-affinity · Closed
- Intervals when the maximum is secondstructural-affinity · Closed
- Ordinary continuationstructural-affinity · Closed
- Simplicity of the parallel familystructural-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