Combinatorics / CONCEPT
The corrected counting recurrence
Removing the final decreasing component gives a four-term recurrence with the number of indecomposable square-avoiders as its additional term.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH7
DOCUMENT LINKS1
Counting by the final component
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
- Explicit families and first-entry boundsstructural-affinity · Closed
- First entry four and complete classificationstructural-affinity · Closed
- Permutation squares and the conjectured recurrencestructural-affinity · Closed
- The Archer-Bourne square recurrence fails at elevenstructural-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
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance