- 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
Recommended Articles
Loading...
References
-
Projections, entropy and sumsetsBalister, P; Bollobás, B
-
Shadows of convex bodiesBall, K
-
Volume ratio and a reverse isoperimetric inequalityBall, K
-
Efficiently approximating the minimum-volume bounding box of a point set in three dimensionsBarequet, G; Har-Peled, S
-
On the multilinear restriction and Kakeya conjecturesBennett, J; Carbery, A; Tao, T
-
A non-linear generalisation of the Loomis–Whitney inequality and applicationsBennett, J; Carbery, A; Wright, J
-
Geometric Aspects of Functional Analysis. Lecture Notes in MathematicsBobkov, SG; Nazarov, FL
-
Projections of bodies and hereditary properties of hypergraphsBollobás, B; Thomason, A
-
Volumes of projection bodiesBrannen, NS
-
Best constants in Young’s inequality, its converse, and its generalizations to more than three functionsBrascamp, HJ; Lieb, EH
-
Deterministic and randomized polynomial-time approximation of radiiBrieden, A; Gritzmann, P; Kannan, R; Klee, V; Lovász, L; Simonovits, M
-
Finding optimal shadows of polytopesBurger, T; Gritzmann, P
-
Polytope projection and projection polytopesBurger, T; Gritzmann, P; Klee, V
-
Reverse and dual Loomis–Whitney-type inequalitiesCampi, S; Gardner, RJ; Gronchi, P
-
Estimates of Loomis–Whitney type for intrinsic volumesCampi, S; Gronchi, P
-
The mean volume of boxes and cylinders circumscribed about a convex bodyChakerian, GD
-
Determination of the minimum bounding box of an arbitrary solid: an iterative approachChan, CK; Tan, ST
-
The foundations of set theoretic estimationCombettes, P
-
Compressed sensingDonoho, DL
-
On the complexity of computing the volume of a polyhedronDyer, ME; Frieze, AM
-
On the complexity of computing mixed volumesDyer, M; Gritzmann, P; Hufnagel, A
-
Determining the minimum-area encasing rectangle for an arbitrary closed curveFreeman, H; Shapira, H
-
Geometric Tomography. Encyclopedia of Mathematics and Its ApplicationsGardner, RJ
-
Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical SciencesGarey, MR; Johnson, DS
-
On the algorithmic complexity of Minkowski’s reconstruction theoremGritzmann, P; Hufnagel, A
-
Polytopes: Abstract, Convex and Computational. NATO Science Series. Series C: Mathematical and Physical SciencesGritzmann, P; Klee, V
-
Entropy and isoperimetry for linear and non-linear group actionsGromov, M
-
Advances in Neural Information Processing SystemsHegde, C; Wakin, MB; Baraniuk, RG
-
On the complexity of computing the volume of a polytopeKhachiyan, 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 computationLawrence, J
-
An inequality related to the isoperimetric inequalityLoomis, LH; Whitney, H
-
Some characterizing properties of the simplexMartini, H
-
Zur besten Beleuchtung konvexer PolyederMartini, H; Weißbach, B
-
On the complexity of some geometric problems in unbounded dimensionMegiddo, N
-
A volume inequality concerning sections of convex setsMeyer, M
-
Optimal estimation theory for dynamic systems with set membership uncertainty: an overviewMilanese, M; Vicino, A
-
Volumen und OberflächeMinkowski, H
-
Finding minimal enclosing boxesO’Rourke, J
-
Convex profiles from asteroid lightcurvesOstro, SJ; Connelly, R
-
Convex bodies associated with a given convex bodyRogers, CA; Shephard, GC
-
The mean surface area of the boxes circumscribed about a convex bodySchneider, R
-
Convexity and Its ApplicationsSchneider, R; Weil, W
-
Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete MathematicsSchrijver, A
-
A Practical Guide to Fluid Inclusion StudiesShepherd, TJ; Rankin, AH; Alderton, DHM
-
Local StereologyVedel, JEB
-
Restricted chord projection and affine inequalitiesZhang, GY
@Phil_Robichaud
@deepthiw
@JoseServera