Combinatorics / CONCEPT
The rational counting polynomial on every original rank
The literal weak-coordinate binomial identity constructs one rational polynomial valid on all original ranks. Its exact conjectured degree and leading coefficient require the top-pattern factorial identity proved in MazorchukXuTopPatterns.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH6
DOCUMENT LINKS0
One polynomial agrees at every valid n
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 top coefficient and the complete Mazorchuk–Xu conjecturestructural-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