SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES
DOI10.1112/S0025579314000291zbMath1352.52009arXiv1310.4368OpenAlexW3099130640MaRDI QIDQ3195358
René Brandenberg, Stefan König
Publication date: 16 October 2015
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.4368
diameterconvex bodycircumradiusJohn's theoremJung's theoremMinkowski asymmetrysymmetry measure(minimum) widthBohnenblust's theorem
Inequalities and extremum problems involving convexity in convex geometry (52A40) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (11)
Cites Work
- Minimal containment under homothetics: a simple cutting plane approach
- Estimates for the minimal width of polytopes inscribed in convex bodies
- New algorithms for \(k\)-center and extensions
- Intrinsic volumes and successive radii
- On the k radii of a convex body
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Ellipsoids of maximal volume in convex bodies
- A generalization of Jung's theorem
- The width and diameter of a simplex
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Isoradial bodies
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- Optimizing area and perimeter of convex sets for fixed circumradius and inradius
- No dimension-independent core-sets for containment under homothetics
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- On the symmetry function of a convex set
- An arithmetic proof of John's ellipsoid theorem
- Convex regions and projections in Minkowski spaces
- Zwei Extremalprobleme der Minkowski-Geometrie
- On the complexity of four polyhedral set containment problems
- Optimal scaling of balls and polyhedra
- Estimating sizes of a convex body by successive diameters and widths
- Jung's theorem for a pair of Minkowski spaces
- Stability for some extremal properties of the simplex
This page was built for publication: SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES