Combinatorics / CONCEPT
The Fibonacci enumeration
The numbers of simple permutations in C of sizes zero, one and two are respectively one, one and two. For every n at least three, the number of simple permutations of size n sortable by two parallel pop stacks with bypass is F_(2n-5) minus the remainder of n on division by two, where F_0 = 0 and F_1 = 1.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH12
DOCUMENT LINKS1
The Fibonacci enumeration
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
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
- Second-position and third-position minimastructural-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