Combinatorics / CONCEPT
Perfect matchings and the Catalan-Fibonacci generating function
Perfect matchings avoiding three patterns are counted by an ordinary generating function in the number of arcs.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS1
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- An ordered scan characterizes pattern avoidancestructural-affinity · Closed
- Constructing a matching from every accepted scanstructural-affinity · Closed
- Decoding accepted action words into perfect matchingsstructural-affinity · Closed
- Encoding matchings by labeled scan actionsstructural-affinity · Closed
- Normalized bases and pending openingsstructural-affinity · Closed
- The full P13 matching and scan correspondencestructural-affinity · Closed
- The future order of arcs avoiding P13structural-affinity · Closed
- Transporting total orders through queue deletionstructural-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