Combinatorics / CONCEPT
Normalized bases and pending openings
Explicit local transitions retain every earlier survivor comparison at arbitrary height.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS1
Exactly the permitted ranks preserve the old constraints
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
- Concrete completion decompositionsstructural-affinity · Closed
- Concrete completion decompositionsstructural-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
- Generating functions of accepted suffixesstructural-affinity · Closed
- Perfect matchings and the Catalan-Fibonacci generating functionstructural-affinity · Closed
- The actual matching functional equationstructural-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