Combinatorics / CONCEPT
Exact finite-support normalization and binomial counting
Prescribed-support fibers give exact size-independent coefficients for the literal source count. Zero is fixed separately, all ties remain, and every valid original rank is included.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS0
Every prescribed support has the same coefficient
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 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
- 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