Radii minimal projections of polytopes and constrained optimization of symmetric polynomials

dc.creatorBrandenberg, Rene
dc.creatorTheobald, Thorsten
dc.date2003-11-03
dc.date2005-10-11
dc.date.accessioned2026-07-07T06:35:47Z
dc.date.available2026-07-07T06:35:47Z
dc.descriptionWe provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a computation in the circumscribing case or to the computation of an outer radius of a lower-dimensional simplex. In the second part of the paper, we use this characterization to determine the sequence of outer $(n-1)$-radii of regular simplices (which are the radii of smallest enclosing cylinders). This settles a question which arose from the incidence that a paper by Weißbach (1983) on this determination was erroneous. In the proof, we first reduce the problem to a constrained optimization problem of symmetric polynomials and then to an optimization problem in a fixed number of variables with additional integer constraints.
dc.descriptionMinor revisions. To appear in Advances in Geometry
dc.identifierhttps://arxiv.org/abs/math/0311017
dc.identifierhttp://arxiv.org/abs/math/0311017
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99898
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.subject51N20; 52A15; 52B12; 52B55; 68W30
dc.titleRadii minimal projections of polytopes and constrained optimization of symmetric polynomials
dc.typetext

Files

Collections