Combinatorics / CONCEPT
Finite-order bounds for original support components
An annihilating order bounds the actual q-containing support components.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
An annihilator bounds the component count
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 quadratic carrier lower bound from the original zero supportsstructural-affinity · Closed
- Charges and connectivity of original minimal zero supportsstructural-affinity · Closed
- Cyclic sharpness of the finite-order component boundstructural-affinity · Closed
- Disjoint minimal zero supports admit a Good orderingstructural-affinity · Closed
- Polynomial-size cyclic extremal labelsstructural-affinity · Closed
- Quadratic carriers from affine binary pointsstructural-affinity · Closed
- Seventy elements for the parameter-five cyclic carrierstructural-affinity · Closed
- Sharpness of the finite-order component boundstructural-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