Combinatorics / CONCEPT
Geometric exceptional states in three rows
Counting convex rectangle states outside the separated endpoint family.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS0
Four endpoints suffice after an empty row
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
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
- Insertion of an adjacent labelled detourstructural-affinity · Closed
- Label transport across closed matching intervalsstructural-affinity · Closed
- Recovery of actual noncrossing partnersstructural-affinity · Closed
- Rectangle rowmotion max-minus-min homomesystructural-affinity · Closed
- Signed cardinality need not be zero-mesicstructural-affinity · Closed
- The unique middle label of a reconnected capstructural-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