Combinatorics / CONCEPT
Ternary partition transport and four-party counting
Surjective mergers transport arbitrary weighted ternary partition sums, yielding the four-party coefficient cancellation for every sign-representative family.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
Transport through arbitrary surjective mergers
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
- Bilinear coordinates for a ternary translation formstructural-affinity · Closed
- Binary Lagrangian subspaces in graph formstructural-affinity · Closed
- Coarse three-block partition refinements, triangular inversion, and bipartite masked ranksstructural-affinity · Closed
- Multi-entropy positivity fails on three qutritsstructural-affinity · Closed
- Quadratic amplitudes and the graph form of stabilizer statesstructural-affinity · Closed
- Replica-three stabilizer multi-entropy via graph forms and coarse party partitionsstructural-affinity · Closed
- Support forests and edge-word reflectionstructural-affinity · Closed
- Ternary mode orbits and partition countingstructural-affinity · Closed
- The ternary replica collapse for four-party stabilizer statesstructural-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