Combinatorics / CONCEPT
Explicit families and first-entry bounds
Seven explicit permutation families, prefix and position bounds on indecomposable square-avoiders, and the classifications for first entry two and first entry three.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH8
DOCUMENT LINKS0
Prefix criterion and structural bounds on indecomposable square-avoiders
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
- Counting Component Boundariesstructural-affinity · Closed
- Enumeration, generating series, and linear recurrencestructural-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
- Unique Direct-Sum Componentsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance