Combinatorics / CONCEPT
Constructing a matching from every accepted scan
Ordered endpoint queues decode every permitted rank into an actual perfect matching.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH6
DOCUMENT LINKS1
Exact endpoint coverage
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
- An ordered scan characterizes pattern avoidancestructural-affinity · Closed
- Avoiding matchings yield accepted scan wordsstructural-affinity · Closed
- Catalan-Fibonacci enumeration above the boundarystructural-affinity · Closed
- Concrete completion decompositionsstructural-affinity · Closed
- Concrete completion decompositionsstructural-affinity · Closed
- Decoding accepted action words into perfect matchingsstructural-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 actual matching functional equationstructural-affinity · Closed
- The catalytic change of variables in Rational[t][[q]]structural-affinity · Closed
- The full P13 matching and scan correspondencestructural-affinity · Closed
- The future order of arcs avoiding P13structural-affinity · Closed
- The generating function for matchings avoiding 123, 132 and 213structural-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