Combinatorics / CONCEPT
Recovering a Smaller Cycle from Insertion
The prescribed boundary shape of an inverse image permits removal of three letters.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH14
DOCUMENT LINKS1
The recovered inner permutation
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 Cycle Forced by Two Successorsstructural-affinity · Closed
- Bounds from the Parameter Cyclestructural-affinity · Closed
- Classification at the First Endpointstructural-affinity · Closed
- Cycle Compatibility of Insertionstructural-affinity · Closed
- Cycle Reduction at a Final Maximumstructural-affinity · Closed
- Enumeration of Iterated 132-Avoidersstructural-affinity · Closed
- Insertion of Three Lettersstructural-affinity · Closed
- Shape of Parameters with a Final Maximumstructural-affinity · Closed
- The Balanced Two-Block Familystructural-affinity · Closed
- The Descending High Prefixstructural-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