Combinatorics / CONCEPT
Disjoint minimal zero supports admit a Good ordering
Disjoint minimal zero-support decompositions and original-occurrence Good orders.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS0
Disjoint decomposition of every coefficient-one zero support
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
- A zero pair and its original complementstructural-affinity · Closed
- Charges and connectivity of original minimal zero supportsstructural-affinity · Closed
- Coefficient-one zero subsets of signed C3 coordinate basesstructural-affinity · Closed
- Finite-order bounds for original support componentsstructural-affinity · Closed
- Original incidence and positive component chargestructural-affinity · Closed
- Original-coordinate port cycles and avoiding wordsstructural-affinity · Closed
- Original-label Good orders above half girthstructural-affinity · Closed
- Sharpness of the finite-order component boundstructural-affinity · Closed
- Spanning cycles in semicomplete directed relationsstructural-affinity · Closed
- Zero total connects circular arcs to actual Good intervalsstructural-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