Combinatorics / CONCEPT
Weak coordinate patterns and literal graph realization
Coordinate graphs keep zero, repeated positions and cutoffs, arbitrary exceptional edges, and an ordinary clique. Their admissibility is unchanged by increasing coordinate refinements or by a universal ordinary tail.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
Increasing refinements preserve all weak patterns
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
- Exact finite-support normalization and binomial countingstructural-affinity · Closed
- Exact source reconstruction and coordinate countingstructural-affinity · Closed
- Expansion and cutoff structure of ordered closurestructural-affinity · Closed
- Forced edges in generic patternsstructural-affinity · Closed
- The counted point-to-edge bridgestructural-affinity · Closed
- The rational counting polynomial on every original rankstructural-affinity · Closed
- The top coefficient and the complete Mazorchuk–Xu conjecturestructural-affinity · Closed
- Triangular subsets and ordered closurestructural-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