Combinatorics / CONCEPT
Sharpness of the finite-order component bound
Finite abelian labels attain the cyclic-order component bound.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES4
PROOF DEPTH4
DOCUMENT LINKS0
An extremal family for every cyclic order
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
- A universal finite abelian carrier boundstructural-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
- Finite-order bounds for original support componentsstructural-affinity · Closed
- Polynomial-size cyclic extremal labelsstructural-affinity · Closed
- Quadratic carriers from affine binary pointsstructural-affinity · Closed
- Quadratic carriers with a cyclic signed quotientstructural-affinity · Closed
- Seventy elements for the parameter-five cyclic carrierstructural-affinity · Closed
- Translated quotient boundsstructural-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