Combinatorics / CONCEPT
Second-position and third-position minima
For every n at least four, Phi(n) bijects the simple permutations of size n in C with minimum second and those with minimum third. The map undoPhi(n) is its inverse on both sets.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH11
DOCUMENT LINKS1
Second-position and third-position minima
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 bijection to second-position minimastructural-affinity · Closed
- Avoidance under ordinary continuationstructural-affinity · Closed
- Contracting the first two entriesstructural-affinity · Closed
- Deleting the first entry of an ordinary continuationstructural-affinity · Closed
- Reverse vertical continuationstructural-affinity · Closed
- The Fibonacci enumerationstructural-affinity · Closed
- The five cases for a third-position minimumstructural-affinity · Closed
- The reverse third-position constructionstructural-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