Combinatorics / CONCEPT
Refined Counts by Final Cycle
The final-cycle bijection yields a Catalan-weighted recurrence for the avoidance numbers.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH7
DOCUMENT LINKS1
Catalan orders ending at the maximum
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
- Encoding the Value Gapsstructural-affinity · Closed
- Enumeration of (32; 1 to 3) Avoidersstructural-affinity · Closed
- From the Recurrence to the Cubicstructural-affinity · Closed
- Reconstructing the Final Cyclestructural-affinity · Closed
- Splitting at the Largest Valuestructural-affinity · Closed
- The Final-Cycle Bijectionstructural-affinity · Closed
- Uniqueness of the Distinguished Seriesstructural-affinity · Closed
- Value Gaps and Closed Edgesstructural-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