Combinatorics / CONCEPT
Generating functions of accepted suffixes
First-action decompositions determine accepted-word generating functions at all heights and both phases.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH6
DOCUMENT LINKS1
Boundary and higher-height equations
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
- A bijection between avoiding matchings and accepted wordsstructural-affinity · Closed
- Avoiding matchings yield accepted scan wordsstructural-affinity · Closed
- Catalan-Fibonacci enumeration above the boundarystructural-affinity · Closed
- Constructing a matching from every accepted scanstructural-affinity · Closed
- Decoding accepted action words into perfect matchingsstructural-affinity · Closed
- Normalized bases and pending openingsstructural-affinity · Closed
- The future order of arcs avoiding P13structural-affinity · Closed
- The generating function for matchings avoiding 123, 132 and 213structural-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