A geometric inequality for circle packings

Simple item page
dc.creatorParrilo, Pablo A.
dc.creatorPeretz, Ronen
dc.date2002-05-27
dc.date.accessioned2026-07-07T04:48:43Z
dc.date.available2026-07-07T04:48:43Z
dc.descriptionA 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.
dc.description11 pages, submitted
dc.identifierhttps://arxiv.org/abs/math/0205278
dc.identifierhttp://arxiv.org/abs/math/0205278
dc.identifierDiscrete and Computational Geometry, Vol. 31, No. 3, 2004.
dc.identifierdoi:10.1007/s00454-003-2880-2
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64160
dc.subjectAlgebraic Geometry
dc.subjectOptimization and Control
dc.titleA geometric inequality for circle packings
dc.typetext

Files

Collections

arXiv