An inequality for circle packings proved by semidefinite programming
From MaRDI portal
(Redirected from Publication:701787)
Abstract: A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a particular polynomial in four real indeterminates. Techniques based on sum of squares decompositions, semidefinite programming, and symmetry reduction are then applied to provide an easily verifiable nonnegativity certificate.
Recommendations
Cited in
(5)- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- The Schwarz-Pick lemma for circle packings
- Addendum to our paper The Schwarz-Pick lemma for circle packings
- Computing sum of squares decompositions with rational coefficients
- A mechanical proof to a geometric inequality of Zirakzadeh through rectangular partition of polyhedra
This page was built for publication: An inequality for circle packings proved by semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701787)