Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the Reverse Loomis–Whitney Inequality

On the Reverse Loomis–Whitney Inequality The present paper deals with the problem of computing (or at least estimating) the $$\mathrm {LW}$$ LW -number $$\lambda (n)$$ λ ( n ) , i.e., the supremum of all $$\gamma $$ γ such that for each convex body K in $${\mathbb {R}}^n$$ R n there exists an orthonormal basis $$\{u_1,\ldots ,u_n\}$$ { u 1 , … , u n } such that $$\begin{aligned} {\text {vol}}_n(K)^{n-1} \ge \gamma \prod _{i=1}^n {\text {vol}}_{n-1} (K|u_i^{\perp }) , \end{aligned}$$ vol n ( K ) n - 1 ≥ γ ∏ i = 1 n vol n - 1 ( K | u i ⊥ ) , where $$K|u_i^{\perp }$$ K | u i ⊥ denotes the orthogonal projection of K onto the hyperplane $$u_i^{\perp }$$ u i ⊥ perpendicular to $$u_i$$ u i . Any such inequality can be regarded as a reverse to the well-known classical Loomis–Whitney inequality. We present various results on such reverse Loomis–Whitney inequalities. In particular, we prove some structural results, give bounds on $$\lambda (n)$$ λ ( n ) and deal with the problem of actually computing the $$\mathrm {LW}$$ LW -constant of a rational polytope. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete & Computational Geometry Springer Journals

On the Reverse Loomis–Whitney Inequality

Download PDF
30 pages

Loading next page...
 
/lp/springer_journal/on-the-reverse-loomis-whitney-inequality-ShJd1CDRH3
Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media, LLC
Subject
Mathematics; Combinatorics; Computational Mathematics and Numerical Analysis
ISSN
0179-5376
eISSN
1432-0444
DOI
10.1007/s00454-017-9949-9
Publisher site
See Article on Publisher Site

Abstract

The present paper deals with the problem of computing (or at least estimating) the $$\mathrm {LW}$$ LW -number $$\lambda (n)$$ λ ( n ) , i.e., the supremum of all $$\gamma $$ γ such that for each convex body K in $${\mathbb {R}}^n$$ R n there exists an orthonormal basis $$\{u_1,\ldots ,u_n\}$$ { u 1 , … , u n } such that $$\begin{aligned} {\text {vol}}_n(K)^{n-1} \ge \gamma \prod _{i=1}^n {\text {vol}}_{n-1} (K|u_i^{\perp }) , \end{aligned}$$ vol n ( K ) n - 1 ≥ γ ∏ i = 1 n vol n - 1 ( K | u i ⊥ ) , where $$K|u_i^{\perp }$$ K | u i ⊥ denotes the orthogonal projection of K onto the hyperplane $$u_i^{\perp }$$ u i ⊥ perpendicular to $$u_i$$ u i . Any such inequality can be regarded as a reverse to the well-known classical Loomis–Whitney inequality. We present various results on such reverse Loomis–Whitney inequalities. In particular, we prove some structural results, give bounds on $$\lambda (n)$$ λ ( n ) and deal with the problem of actually computing the $$\mathrm {LW}$$ LW -constant of a rational polytope.

Journal

Discrete & Computational Geometry – Springer Journals

Published: Oct 27, 2017

References

  • Projections, entropy and sumsets
    Balister, P; Bollobás, B
  • Shadows of convex bodies
    Ball, K
  • Volume ratio and a reverse isoperimetric inequality
    Ball, K
  • Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
    Barequet, G; Har-Peled, S
  • On the multilinear restriction and Kakeya conjectures
    Bennett, J; Carbery, A; Tao, T
  • A non-linear generalisation of the Loomis–Whitney inequality and applications
    Bennett, J; Carbery, A; Wright, J
  • Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics
    Bobkov, SG; Nazarov, FL
  • Projections of bodies and hereditary properties of hypergraphs
    Bollobás, B; Thomason, A
  • Volumes of projection bodies
    Brannen, NS
  • Best constants in Young’s inequality, its converse, and its generalizations to more than three functions
    Brascamp, HJ; Lieb, EH
  • Deterministic and randomized polynomial-time approximation of radii
    Brieden, A; Gritzmann, P; Kannan, R; Klee, V; Lovász, L; Simonovits, M
  • Finding optimal shadows of polytopes
    Burger, T; Gritzmann, P
  • Polytope projection and projection polytopes
    Burger, T; Gritzmann, P; Klee, V
  • Reverse and dual Loomis–Whitney-type inequalities
    Campi, S; Gardner, RJ; Gronchi, P
  • Estimates of Loomis–Whitney type for intrinsic volumes
    Campi, S; Gronchi, P
  • The mean volume of boxes and cylinders circumscribed about a convex body
    Chakerian, GD
  • Determination of the minimum bounding box of an arbitrary solid: an iterative approach
    Chan, CK; Tan, ST
  • The foundations of set theoretic estimation
    Combettes, P
  • Compressed sensing
    Donoho, DL
  • On the complexity of computing the volume of a polyhedron
    Dyer, ME; Frieze, AM
  • On the complexity of computing mixed volumes
    Dyer, M; Gritzmann, P; Hufnagel, A
  • Determining the minimum-area encasing rectangle for an arbitrary closed curve
    Freeman, H; Shapira, H
  • Geometric Tomography. Encyclopedia of Mathematics and Its Applications
    Gardner, RJ
  • Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences
    Garey, MR; Johnson, DS
  • On the algorithmic complexity of Minkowski’s reconstruction theorem
    Gritzmann, P; Hufnagel, A
  • Polytopes: Abstract, Convex and Computational. NATO Science Series. Series C: Mathematical and Physical Sciences
    Gritzmann, P; Klee, V
  • Entropy and isoperimetry for linear and non-linear group actions
    Gromov, M
  • Advances in Neural Information Processing Systems
    Hegde, C; Wakin, MB; Baraniuk, RG
  • On the complexity of computing the volume of a polytope
    Khachiyan, LG
  • The problem of computing the volume of polytopes is $$\#$$ # P-hard. [The problem of calculating the volume of a polyhedron is enumerably hard.]
    Khachiyan, LG
  • Polytope volume computation
    Lawrence, J
  • An inequality related to the isoperimetric inequality
    Loomis, LH; Whitney, H
  • Some characterizing properties of the simplex
    Martini, H
  • Zur besten Beleuchtung konvexer Polyeder
    Martini, H; Weißbach, B
  • On the complexity of some geometric problems in unbounded dimension
    Megiddo, N
  • A volume inequality concerning sections of convex sets
    Meyer, M
  • Optimal estimation theory for dynamic systems with set membership uncertainty: an overview
    Milanese, M; Vicino, A
  • Volumen und Oberfläche
    Minkowski, H
  • Finding minimal enclosing boxes
    O’Rourke, J
  • Convex profiles from asteroid lightcurves
    Ostro, SJ; Connelly, R
  • Convex bodies associated with a given convex body
    Rogers, CA; Shephard, GC
  • The mean surface area of the boxes circumscribed about a convex body
    Schneider, R
  • Convexity and Its Applications
    Schneider, R; Weil, W
  • Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics
    Schrijver, A
  • A Practical Guide to Fluid Inclusion Studies
    Shepherd, TJ; Rankin, AH; Alderton, DHM
  • Local Stereology
    Vedel, JEB
  • Restricted chord projection and affine inequalities
    Zhang, GY