Combinatorics / CONCEPT
The first and third values before a late minimum
In a simple permutation in C whose minimum has zero-based position at least three, the first entry is exactly one more than the third entry.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
The first and third values before a late 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 ascent in the second inflated blockstructural-affinity · Closed
- Avoidance under ordinary continuationstructural-affinity · Closed
- Deleting the first entry of an ordinary continuationstructural-affinity · Closed
- Inserting a minimum in an early gapstructural-affinity · Closed
- Ordinary continuationstructural-affinity · Closed
- The Fibonacci enumeration assertionstructural-affinity · Closed
- The two value regions below a second-position maximumstructural-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