Combinatorics / CONCEPT
A Consecutive Pair Forced by a Return
A terminal one after two inverse applications determines an adjacent pair in the original permutation.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS1
The pair before one
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
- Boundary Entries of Fixed 231-Avoidersstructural-affinity · Closed
- Descending Triples and Direct Sumsstructural-affinity · Closed
- Incompatible Middle Cycle Datastructural-affinity · Closed
- Indecomposability of Pattern Avoidersstructural-affinity · Closed
- Low Entries in the Forced Prefixstructural-affinity · Closed
- Record Bounds and the Inverse Bijectionstructural-affinity · Closed
- Separated Prefixesstructural-affinity · Closed
- The High Prefix before Onestructural-affinity · Closed
- The Initial Pair after the Maximum and Onestructural-affinity · Closed
- The Penultimate Record Blockstructural-affinity · Closed
- The Prefix before One in a 231-Avoiderstructural-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