Combinatorics / CONCEPT
Enumeration, generating series, and linear recurrence
Closed-form counts of indecomposable square-avoiders, the threshold of the conjectured recurrence, rational generating series over the integers, and the order-seven linear recurrence.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH10
DOCUMENT LINKS0
Exact indecomposable counts, composition convolution, and recurrence threshold
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
- Counting Component Boundariesstructural-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
- 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