Combinatorics / CONCEPT
Decoding accepted action words into perfect matchings
An ordered queue turns accepted action words into pairs covering every vertex exactly once.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH3
DOCUMENT LINKS1
Every accepted word yields all endpoint pairs
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
- An ordered scan characterizes pattern avoidancestructural-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
- Encoding matchings by labeled scan actionsstructural-affinity · Closed
- Generating functions of accepted suffixesstructural-affinity · Closed
- Normalized bases and pending openingsstructural-affinity · Closed
- Perfect matchings and the Catalan-Fibonacci generating functionstructural-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