Combinatorics / CONCEPT
The top coefficient and the complete Mazorchuk–Xu conjecture
The top weak-coordinate patterns are exactly a choice of position values and a permutation of the complementary cutoff values. Their factorial count proves the complete original all-deficit, all-valid-rank numerical polynomial conjecture for the literal triangular family.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH7
DOCUMENT LINKS0
Exact factorial count of the top patterns
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
- Exact finite-support normalization and binomial countingstructural-affinity · Closed
- Exact source reconstruction and coordinate countingstructural-affinity · Closed
- Forced edges in generic patternsstructural-affinity · Closed
- The rational counting polynomial on every original rankstructural-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