On the reverse Loomis-Whitney inequality
DOI10.1007/S00454-017-9949-9zbMATH Open1400.52008arXiv1607.07891OpenAlexW2963789736MaRDI QIDQ724946FDOQ724946
Peter Gritzmann, Paolo Gronchi, Stefano Campi
Publication date: 26 July 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.07891
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compressed sensing
- A nonlinear generalisation of the Loomis-Whitney inequality and applications
- Reverse and dual Loomis-Whitney-type inequalities
- Title not available (Why is that?)
- Convex Bodies Associated with a Given Convex Body
- Geometric tomography
- Volume Ratios and a Reverse Isoperimetric Inequality
- Shadows of Convex Bodies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Projections of Bodies and Hereditary Properties of Hypergraphs
- Convex Bodies The Brunn-MinkowskiTheory
- An inequality related to the isoperimetric inequality
- Estimates of Loomis-Whitney type for intrinsic volumes
- On the multilinear restriction and Kakeya conjectures
- Title not available (Why is that?)
- Deterministic and randomized polynomial‐time approximation of radii
- Volumes of projection bodies
- Restricted chord projection and affine inequalities
- Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
- Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
- Polytope Volume Computation
- On the Complexity of Computing the Volume of a Polyhedron
- On The Complexity of Computing Mixed Volumes
- Entropy and isoperimetry for linear and non-linear group actions.
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Title not available (Why is that?)
- Best constants in Young's inequality, its converse, and its generalization to more than three functions
- On the complexity of some geometric problems in unbounded dimension
- Finding minimal enclosing boxes
- Local Stereology
- Projections, entropy and sumsets
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Polytope Projection and Projection Polytopes
- The problem of calculating the volume of a polyhedron is enumerably hard
- Some characterizing properties of the simplex
- Finding optimal shadows of polytopes
- Uniform cover inequalities for the volume of coordinate sections and projections of convex bodies
- On the average volume of sections of convex bodies
- The mean volume of boxes and cylinders circumscribed about a convex body
- Geometric stability via information theory
- A Volume Inequality Concerning Sections of Convex Sets
- On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
- Inequalities for the Surface Area of Projections of Convex Bodies
- Behaviour of the Brascamp–Lieb constant
- The mean surface area of the boxes circumscribed about a convex body
- Zur besten Beleuchtung konvexer Polyeder
Cited In (8)
- On a quantitative reversal of Alexandrov’s inequality
- Bounds on the lattice point enumerator via slices and projections
- On the reverse dual Loomis-Whitney inequality
- Estimating volume and surface area of a convex body via its projections or sections
- Reverse Loomis-Whitney inequalities via isotropicity
- The dual Loomis–Whitney inequality
- A Grassmannian Loomis–Whitney inequality and its dual
- Rogers-Shephard and local Loomis-Whitney type inequalities
This page was built for publication: On the reverse Loomis-Whitney inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724946)