Combinatorics / CONCEPT
Transport of native quadratic allocations
The native finite-graph quadratic-load infimum respects injective graph maps and is additive on Cartesian products.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
Restriction along an injective graph map
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
- Constrained harmonic optimizationstructural-affinity · Closed
- Counting legal-word toggle edges by deletionstructural-affinity · Closed
- Degrees and the sharp count bound for legal wordsstructural-affinity · Closed
- Legal-word block growthstructural-affinity · Closed
- Quadratic edge loads and regular componentsstructural-affinity · Closed
- Sharp quadratic loads on starsstructural-affinity · Closed
- The Fibonacci Count of Zeckendorf-Admissible Wordsstructural-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