Combinatorics / CONCEPT
Counting Component Boundaries
Direct-sum boundaries correspond to the ends of indecomposable permutation components.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH6
DOCUMENT LINKS1
The number of separating cuts
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
- Active Positions for 2413 and 2431 Avoidersstructural-affinity · Closed
- Active Positions in Direct Sums Avoiding 2413 and 2431structural-affinity · Closed
- Crossing Pattern Testsstructural-affinity · Closed
- Enumeration, generating series, and linear recurrencestructural-affinity · Closed
- Explicit families and first-entry boundsstructural-affinity · Closed
- First entry four and complete classificationstructural-affinity · Closed
- Indecomposability after Maximum Insertionstructural-affinity · Closed
- The Archer-Bourne square recurrence fails at elevenstructural-affinity · Closed
- The corrected counting recurrencestructural-affinity · Closed
- The first component and the layered tailstructural-affinity · Closed
- The Fishburn Condition under Direct Sumstructural-affinity · Closed
- Unique Direct-Sum Componentsstructural-affinity · Closed
- Updating Active Positions for 2431 and 3241 Avoidersstructural-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