An inequality for circle packings proved by semidefinite programming

From MaRDI portal
Publication:701787

DOI10.1007/S00454-003-2880-2zbMATH Open1059.51020arXivmath/0205278OpenAlexW2001263356MaRDI QIDQ701787FDOQ701787


Authors: Pablo A. Parrilo, Ronen Peretz Edit this on Wikidata


Publication date: 16 December 2004

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0205278




Recommendations





Cited In (5)

Uses Software





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)