Combinatorics / CONCEPT
Support forests and edge-word reflection
Support counts and sound reflection of edge-word character moments.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES3
PROOF DEPTH0
DOCUMENT LINKS0
Counting points in two-cycles
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Bilinear coordinates for a ternary translation formstructural-affinity · Closed
- Crossing- and Nesting-Free Labeled Graphsstructural-affinity · Closed
- Identity edge words on finite treesstructural-affinity · Closed
- Multi-entropy positivity fails on three qutritsstructural-affinity · Closed
- Ternary mode orbits and partition countingstructural-affinity · Closed
- Ternary partition transport and four-party countingstructural-affinity · Closed
- The ten-setting GHZ witness in odd dimensionsstructural-affinity · Closed
- The ternary replica collapse for four-party stabilizer statesstructural-affinity · Closed
- The unweighted fourth moment does not determine four-edge forest countsstructural-affinity · Closed
- Trace bounds, interpolation and phase rigiditystructural-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