Combinatorics / CONCEPT
Recovery of actual noncrossing partners
A cut noncrossing matching is determined by which endpoints open its pairs.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
Opening data recover every matched pair
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
- Adjacent cap removal in a noncrossing matchingstructural-affinity · Closed
- Closed-cap compatibility and weight transportstructural-affinity · Closed
- Endpoint transport along the literal toggle tracestructural-affinity · Closed
- Geometric exceptional states in three rowsstructural-affinity · Closed
- Insertion of an adjacent labelled detourstructural-affinity · Closed
- Label transport across closed matching intervalsstructural-affinity · Closed
- Rectangle rowmotion max-minus-min homomesystructural-affinity · Closed
- Signed cardinality need not be zero-mesicstructural-affinity · Closed
- Transport of the unaffected boundary productstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance