Combinatorics / CONCEPT
Exact source reconstruction and coordinate counting
Bounded weak coordinate data and literal triangular closure have exactly the same finite objects and first-column count. The coordinate description permits every zero and tie, while ordered exceptional bits make reconstruction unique.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
Reconstruction preserves the complete literal family
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
- 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
- Weak coordinate patterns and literal graph realizationstructural-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