DOCSLIB.ORG

Optimal Area-Sensitive Bounds for Polytope Approximation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Optimal Area-Sensitive Bounds for Polytope Approximation Optimal Area-Sensitive Bounds for Polytope Approximation Sunil Arya∗ Guilherme D. da Fonseca† David M. Mount‡ Department of Computer Dept. de Informática Aplicada Department of Computer Science and Engineering Universidade Federal do Science and Institute for The Hong Kong University of Estado do Rio de Janeiro Advanced Computer Studies Science and Technology (UniRio) University of Maryland Clear Water Bay, Kowloon Rio de Janeiro, Brazil College Park, Maryland 20742 Hong Kong [email protected] [email protected] [email protected] ABSTRACT Mahler volume, it is possible to achieve the desired width- Approximating convex bodies is a fundamental question in based sampling. geometry and has applications to a wide variety of optimiza- tion problems. Given a convex body K in Rd for fixed d, Categories and Subject Descriptors the objective is to minimize the number of vertices or facets F.2.2 [Analysis of Algorithms and Problem Complex- of an approximating polytope for a given Hausdorff error ity]: Nonnumerical Algorithms and Problems—Geometrical ε. The best known uniform bound, due to Dudley (1974), problems and computations shows that O((diam(K)/ε)(d−1)/2) facets suffice. While this bound is optimal in the case of a Euclidean ball, it is far General Terms from optimal for skinny convex bodies. We show that, under the assumption that the width of the Algorithms, Theory body in any direction is at least ε, it is possible to approx- imate a convex body using O( area(K)/ε(d−1)/2) facets, Keywords where area(K) is the surface area of the body. This bound Convexity, polytopes, approximation, Macbeath regions is never worse than the previousp bound and may be signifi- cantly better for skinny bodies. This bound is provably op- 1. INTRODUCTION timal in the worst case and improves upon our earlier result Approximating convex bodies by polytopes is a funda- (which appeared in SODA 2012). mental problem, which has been extensively studied in the Our improved bound arises from a novel approach to sam- literature. (See Bronstein [13] for a recent survey.) At issue pling points on the boundary of a convex body in order to is the minimum number of vertices (alternatively, the min- stab all (dual) caps of a given width. This approach in- imum number of facets) needed in an approximating poly- volves the application of an elegant concept from the theory tope for a given error ε > 0. Consider a convex body K of convex bodies, called Macbeath regions. While Macbeath in Euclidean d-dimensional space. A polytope P is said to regions are defined in terms of volume considerations, we ε-approximate K if the Hausdorff distance [13] between K show that by applying them to both the original body and and P is at most ε. Throughout, we will restrict attention its dual, and then combining this with known bounds on the to the Hausdorff metric, and we assume that the dimension d is a constant. ∗This author’s work was supported by the Research Grants Our interest is in establishing bounds on the combinato- Council, Hong Kong, China under project number 610108. rial complexity of approximating general convex bodies. Ap- †This author’s work was supported by CNPq and FAPERJ proximation bounds are of two common types. In both cases, grants. it is shown that there exists ε0 > 0 such that the bounds hold for all ε ε0. In the first type, which we call nonuni- ‡This author’s work was supported in part by the National ≤ Science Foundation under grant CCF-1117259 and the Office form bounds, the value of ε0 depends on K (for example, of Naval Research under grant N00014-08-1-1015. on K’s maximum curvature). Such bounds are often stated as holding “in the limit” as ε approaches zero, or equiva- lently as the combinatorial complexity of the approximating polytope approaches infinity. Examples include bounds by Permission to make digital or hard copies of all or part of this work for Gruber [22], Clarkson [16], and others [9,26,28,29]. personal or classroom use is granted without fee provided that copies are In the second type, which we call uniform bounds, the not made or distributed for profit or commercial advantage and that copies value of ε0 is independent of K. For example, these include bear this notice and the full citation on the first page. To copy otherwise, to the results of Dudley [19] and Bronshteyn and Ivanov [12]. republish, to post on servers or to redistribute to lists, requires prior specific These bounds hold without any smoothness assumptions. permission and/or a fee. Dudley showed that, for ε 1, any convex body K can be ε- SCG'12, June 17–20, 2012, Chapel Hill, North Carolina, USA. ≤ (d−1)/2 Copyright 2012 ACM 978-1-4503-1299-8/12/06 ...$10.00. approximated by a polytope P with O((diam(K)/ε) ) facets. Bronshteyn and Ivanov showed the same bound holds caps, we define a hyperplanar surface, which we call a base, for the number of vertices. Constants hidden in the O- whose area is less than or equal to the associate cap or dual notation depend only on d. These results have many ap- cap, respectively. Of particular interest are caps and dual plications, for example, in the construction of coresets [1]. caps whose defining width is ε. Depending on the formu- The approximation bounds of both Dudley and Bron- lation, the approximation problem reduces to computing a shteyn and Ivanov are tight up to constant factors (specif- small set of points on the boundary of K such that every ically when K is a Euclidean ball). These bounds may be cap of width ε contains one of these points or every dual significantly suboptimal if K is skinny, however. In an ear- cap of width ε contains one of these points. lier paper [3], we presented an upper bound that is based The source of slackness in the bound of [3] arises from a not on diameter, but on surface area. In particular, let sampling method that is based on a relatively heavy-handed area(K) denote the (d 1)-dimensional Hausdorff measure tool, namely ε-nets for halfspace ranges. In light of recent of ∂K. We showed that,− under the assumption that the lower bounds on the size of ε-nets for halfspace ranges [27], width of the body in any direction is at least ε, there ex- it is clear that the elimination of the log factor requires a ists an ε-approximating polytope whose number of facets is sampling process that is specially tailored to caps or dual O(t log t), where t = area(K)/ε(d−1)/2. For a given diam- caps. The principal contribution of this paper is such a eter, the surface area of a convex body is maximized for a sampling method. Euclidean ball, implyingp that area(K) = O(diam(K)d−1). Our new approach makes use of a classical structure from Thus, this bound is tight in the worst case up to the log- the theory of convexity, called Macbeath regions. Intuitively, arithmic factor. The additional log factor is disconcerting for any convex body K and a volume parameter v, there ex- since it implies that the bound is suboptimal even for the ists a collection of pairwise disjoint bodies, each of volume simple case of a Euclidean ball. In this paper we show that Ω(v), such that for every halfspace H where the cap K H the logarithmic factor can be eliminated. In particular, we has volume v, one of these bodies will be completely con-∩ prove the following result, which is worst-case optimal, up tained within this cap. (The formal statement is given in to constant factors. Section 2.4.) Macbeath regions have found numerous uses in the theory of convex sets and the geometry of numbers (see Theorem 1.1. Consider real d-space, Rd. There exists a B´ar´any [7]). To date, the application of Macbeath regions in positive ε0 and constant cd such that for any convex body the field of computational geometry has been quite limited. d K R and any ε, 0 < ε ε0, if the width of K in any For example, they have been used as a technical device in ⊂ ≤ direction is at least ε, then there exists an ε-approximating proving lower bounds for range searching (see, e.g., [4,5,10]). polytope P whose number of facets is at most Because their definition is based on volume, not width, the (d−1)/2 use of Macbeath regions in the context of uniform bounds cd area(K)/ε . for convex approximation has been limited to volume-based notions of distance, such as the Nikodym metric (which is Note that the widthp assumption seems to be a technical based on the volume of the symmetric difference) [6,8]. The necessity. For example, consider a (d 2)-dimensional unit ′ difficulty in adapting Macbeath regions to width-based sam- ball B embedded within Rd, and let B −denote its Minkowski pling is that caps of a given volume may have widely vary- sum with a d-dimensional ball of radius δ ε. By the opti- − ing widths. Our approach to dealing with this is through mality of Dudley’s bound for Euclidean balls,≪ Ω(1/ε(d 3)/2)) the application of a two-pronged strategy, which combines facets are needed to approximate B and hence to approxi- ′ ′ Macbeath-based sampling in both the original body and its mate B . But, the surface area of B can be made arbitrarily dual.
Load more

Recommended publications
  • Topics in Algorithmic, Enumerative and Geometric Combinatorics
    Thesis for the Degree of Doctor of Philosophy Topics in algorithmic, enumerative and geometric combinatorics Ragnar Freij Division of Mathematics Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg G¨oteborg, Sweden 2012 Topics in algorithmic, enumerative and geometric combinatorics Ragnar Freij ISBN 978-91-7385-668-3 c Ragnar Freij, 2012. Doktorsavhandlingar vid Chalmers Tekniska H¨ogskola Ny serie Nr 3349 ISSN 0346-718X Department of Mathematical Sciences Chalmers University of Technology and University of Gothenburg SE-412 96 GOTEBORG,¨ Sweden Phone: +46 (0)31-772 10 00 [email protected] Printed in G¨oteborg, Sweden, 2012 Topics in algorithmic, enumerative and geometric com- binatorics Ragnar Freij ABSTRACT This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman’s discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. As an application, we determine the S2 × Sn−2-homotopy type of the complex of non-connected graphs on n nodes. In the introduction, connections are drawn between the first paper and the evasiveness conjecture for monotone graph properties. In the second paper, we investigate Hansen polytopes of split graphs. By applying a partitioning technique, the number of nonempty faces is counted, and in particular we confirm Kalai’s 3d-conjecture for such polytopes. Further- more, a characterization of exactly which Hansen polytopes are also Hanner polytopes is given.
    [Show full text]
  • Abstract Adaptive Sampling for Geometric
    ABSTRACT Title of dissertation: ADAPTIVE SAMPLING FOR GEOMETRIC APPROXIMATION Ahmed Abdelkader Abdelrazek, Doctor of Philosophy, 2020 Dissertation directed by: Professor David M. Mount Computer Science Geometric approximation of multi-dimensional data sets is an essential algorith- mic component for applications in machine learning, computer graphics, and scientific computing. This dissertation promotes an algorithmic sampling methodology for a number of fundamental approximation problems in computational geometry. For each problem, the proposed sampling technique is carefully adapted to the geometry of the input data and the functions to be approximated. In particular, we study proximity queries in spaces of constant dimension and mesh generation in 3D. We start with polytope membership queries, where query points are tested for inclusion in a convex polytope. Trading-off accuracy for efficiency, we tolerate one-sided errors for points within an "-expansion of the polytope. We propose a sampling strategy for the placement of covering ellipsoids sensitive to the local shape of the polytope. The key insight is to realize the samples as Delone sets in the intrinsic Hilbert metric. Using this intrinsic formulation, we considerably simplify state-of-the-art techniques yielding an intuitive and optimal data structure. Next, we study nearest-neighbor queries which retrieve the most similar data point to a given query point. To accommodate more general measures of similarity, we consider non-Euclidean distances including convex distance functions and Bregman divergences. Again, we tolerate multiplicative errors retrieving any point no farther than (1 + ") times the distance to the nearest neighbor. We propose a sampling strategy sensitive to the local distribution of points and the gradient of the distance functions.
    [Show full text]
  • Approximate Polytope Membership Queries | SIAM Journal on Computing
    SIAM J. COMPUT. c 2018 Society for Industrial and Applied Mathematics Vol. 47, No. 1, pp. 1{51 ∗ APPROXIMATE POLYTOPE MEMBERSHIP QUERIES SUNIL ARYAy , GUILHERME D. DA FONSECAz , AND DAVID M. MOUNTx Abstract. In the polytope membership problem, a convex polytope K in d is given, and R d the objective is to preprocess K into a data structure so that, given any query point q 2 R , it is possible to determine efficiently whether q 2 K. We consider this problem in an approximate setting. Given an approximation parameter ", the query can be answered either way if the distance from q to K's boundary is at most " times K's diameter. We assume that the dimension d is fixed, and K is presented as the intersection of n halfspaces. Previous solutions to approximate polytope membership were based on straightforward applications of classic polytope approximation techniques by Dudley [Approx. Theory, 10 (1974), pp. 227{236] and Bentley, Faust, and Preparata [Commun. ACM, 25 (1982), pp. 64{68]. The former is optimal in the worst case with respect to space, and the latter is optimal with respect to query time. We present four main results. First, we show how to combine the two above techniques to obtain a simple space-time trade-off. Second, we present an algorithm that dramatically improves this trade-off. In particular, for any constant α ≥ 4, this data structure achieves query time roughly O(1="(d−1)/α) and space roughly O (1="(d−1)(1−Ω(log α)/α)). We do not know whether this space bound is tight, but our third result showsp that there is a convex body such (d−1)(1−O( α)/α that our algorithm achieves a space of at least Ω(1=" ).
    [Show full text]
  • Ten Problems in Geometry
    Ten Problems in Geometry Moritz W. Schmitt G¨unter M. Ziegler∗ Institut f¨urMathematik Institut f¨urMathematik Freie Universit¨atBerlin Freie Universit¨atBerlin Arnimallee 2 Arnimallee 2 14195 Berlin, Germany 14195 Berlin, Germany [email protected] [email protected] May 1, 2011 Abstract We describe ten problems that wait to be solved. Introduction Geometry is a field of knowledge, but it is at the same time an active field of research | our understanding of space, about shapes, about geometric structures develops in a lively dialog, where problems arise, new questions are asked every day. Some of the problems are settled nearly immediately, some of them need years of careful study by many authors, still others remain as challenges for decades. Contents 1 Unfolding polytopes 2 2 Almost disjoint triangles 4 3 Representing polytopes with small coordinates 6 4 Polyhedra that tile space 8 5 Fatness 10 6 The Hirsch conjecture 12 7 Unimodality for cyclic polytopes 14 8 Decompositions of the cube 16 9 A problem concerning the ball and the cube 19 10 The 3d conjecture 21 ∗Partially supported by DFG, Research Training Group \Methods for Discrete Structures" 1 1 Unfolding polytopes In 1525 Albrecht D¨urer'sfamous geometry masterpiece \Underweysung der Messung mit dem Zirckel und Richtscheyt"1 was published in Nuremberg. Its fourth part contains many drawings of nets of 3-dimensional polytopes. Implicitly it contains the following conjecture: Every 3-dimensional convex polytope can be cut open along a spanning tree of its graph and then unfolded into the plane without creating overlaps.
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger 2 FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th{19th, 2017 Books of abstracts 4 FoCM 2017 Contents Presentation . .7 Governance of FoCM . .9 Local Organizing Committee . .9 Administrative and logistic support . .9 Technical support . 10 Volunteers . 10 Workshops Committee . 10 Plenary Speakers Committee . 10 Smale Prize Committee . 11 Funding Committee . 11 Plenary talks . 13 Workshops . 21 A1 { Approximation Theory Organizers: Albert Cohen { Ron Devore { Peter Binev . 21 A2 { Computational Algebraic Geometry Organizers: Marta Casanellas { Agnes Szanto { Thorsten Theobald . 36 A3 { Computational Number Theory Organizers: Christophe Ritzenhaler { Enric Nart { Tanja Lange . 50 A4 { Computational Geometry and Topology Organizers: Joel Hass { Herbert Edelsbrunner { Gunnar Carlsson . 56 A5 { Geometric Integration and Computational Mechanics Organizers: Fernando Casas { Elena Celledoni { David Martin de Diego .
    [Show full text]
  • Arxiv:Math/0610904V3 [Math.MG] 2 Jul 2008
    From the Mahler conjecture to Gauss linking integrals Greg Kuperberg∗ Department of Mathematics, University of California, Davis, CA 95616 Dedicated to my father, on no particular occasion We establish a version of the bottleneck conjecture, which in turn implies a partial solution to the Mahler conjecture on the product v(K) = (Vol K)(Vol K ) of the volume of a symmetric convex body K Rn and its ◦ ∈ polar body K◦. The Mahler conjecture asserts that the Mahler volume v(K) is minimized (non-uniquely) when K is an n-cube. The bottleneck conjecture (in its least general form) asserts that the volume of a certain domain π nγ K♦ K K◦ is minimized when K is an ellipsoid. It implies the Mahler conjecture up to a factor of 4 n, ⊆ × 4 where γn is a monotonic factor that begins at π and converges to √2. This strengthens a result of Bourgain and Milman, who showed that there is a constant c such that the Mahler conjecture is true up to a factor of cn. The proof uses a version of the Gauss linking integral to obtain a constant lower bound on Vol K♦, with equality when K is an ellipsoid. It applies to a more general conjecture concerning the join of any two necks of the pseudospheres of an indefinite inner product space. Because the calculations are similar, we will also n 1 n 1 analyze traditional Gauss linking integrals in the sphere S − and in hyperbolic space H − . 1. INTRODUCTION Theorem 1.3 (Bourgain, Milman). There is a constant c > 0 such that for any n and any centrally-symmetric convex body n K of dimension n, If K R is a centrally symmetric convex body, let K◦ de- note its⊂ dual or polar body.
    [Show full text]
  • Isotropic Constants and Mahler Volumes
    Isotropic constants and Mahler volumes Bo’az Klartag Abstract This paper contains a number of results related to volumes of projective perturba- tions of convex bodies and the Laplace transform on convex cones. First, it is shown that a sharp version of Bourgain’s slicing conjecture implies the Mahler conjecture for convex bodies that are not necessarily centrally-symmetric. Second, we find that by slightly translating the polar of a centered convex body, we may obtain another body with a bounded isotropic constant. Third, we provide a counter-example to a conjecture by Kuperberg on the distribution of volume in a body and in its polar. 1 Introduction This paper describes interrelations between duality and distribution of volume in convex bodies. A convex body is a compact, convex subset K Rn whose interior Int(K) is non-empty. If 0 Int(K), then the polar body is defined by⊆ ∈ K◦ = y Rn ; x K, x, y 1 . { ∈ ∀ ∈ h i ≤ } The polar body K◦ is itself a convex body with the origin in its interior, and moreover (K◦)◦ = K. The Mahler volume of a convex body K Rn with the origin in its interior is defined as ⊆ ◦ s(K)= V oln(K) V oln(K ), arXiv:1710.08084v2 [math.MG] 1 Mar 2018 · where V oln is n-dimensional volume. In the class of convex bodies with barycenter at the origin, the Mahler volume is maximized for ellipsoids, as proven by Santal´o[29], see also Meyer and Pajor [20]. The Mahler conjecture suggests that for any convex body K Rn containing the origin in its interior, ⊆ (n + 1)n+1 s(K) s(∆n)= , (1) ≥ (n!)2 where ∆n Rn is any simplex whose vertices span Rn and add up to zero.
    [Show full text]
  • Mahler's Conjecture in Convex Geometry
    MAHLER'S CONJECTURE IN CONVEX GEOMETRY: A SUMMARY AND FURTHER NUMERICAL ANALYSIS A Thesis Presented to The Academic Faculty by Philipp Hupp In Partial Fulfillment of the Requirements for the Degree Master of Science in the School of Mathematics Georgia Institute of Technology December 2010 MAHLER'S CONJECTURE IN CONVEX GEOMETRY: A SUMMARY AND FURTHER NUMERICAL ANALYSIS Approved by: Professor Evans Harrell, Advisor School of Mathematics Georgia Institute of Technology Professor Mohammad Ghomi School of Mathematics Georgia Institute of Technology Professor Michael Loss School of Mathematics Georgia Institute of Technology Date Approved: July 23, 2010 ACKNOWLEDGEMENTS My deepest appreciation to my supervisor, Prof. Evans Harrell, for his encourage- ment and guidance during my studies. I feel fortunate to have him as my advisor. His original mind, his keen insight in approaching hard problems, and his vast knowledge have served as an inspiration for me throughout this thesis. I am particularly thank- ful to him for introducing me to the subjects of convex and differential geometry. He taught these subjects in an effortless manner and just that allowed me to accomplish this thesis. A special thanks goes to Prof. Mohammad Ghomi for sharing his expertise on Mahler's conjecture with me and I would like to express my gratitude to him and Prof. Michael Loss as the members of my committee. Furthermore I like to thank Michael Music who shared Prof. Harrell's working semi- nar with me. It was fun working with you Michael and all the best for your graduate studies. iii TABLE OF CONTENTS ACKNOWLEDGEMENTS . iii LIST OF TABLES .
    [Show full text]
  • On the Local Minimizers of the Mahler Volume
    On the local minimizers of the Mahler volume E. M. Harrell A. Henrot School of Mathematics Institut Elie´ Cartan Nancy Georgia Institute of Technology UMR 7502, Nancy Universit´e- CNRS - INRIA Atlanta, GA 30332-0160 B.P. 239 54506 Vandoeuvre les Nancy Cedex, France [email protected] [email protected] J. Lamboley CEREMADE Universit´eParis-Dauphine Place du Mar´echal de Lattre de Tassigny 75775 Paris, France November 10, 2018 Abstract We focus on the analysis of local minimizers of the Mahler volume, that is to say the local solutions to the problem ◦ d min{M(K) := |K||K | / K ⊂ R open and convex, K = −K}, ◦ d d where K := {ξ ∈ R ; ∀x ∈ K,x · ξ < 1} is the polar body of K, and | · | denotes the volume in R . According to a famous conjecture of Mahler the cube is expected to be a global minimizer for this problem. In this paper we express the Mahler volume in terms of the support functional of the convex body, which allows us to compute first and second derivatives of the obtained functional. We deduce from these computations a concavity property of the Mahler volume which seems to be new. As a consequence of this property, we retrieve a result which supports the conjecture, namely that any local minimizer has a Gauss curvature that vanishes at any point where it is defined (first proven by Reisner, Sch¨utt and Werner in 2012, see [18]). Going more deeply into the analysis in the two-dimensional case, we generalize the concavity property of the Mahler volume and also deduce a new proof that any local minimizer must be a parallelogram (proven by B¨or¨oczky, Makai, Meyer, Reisner in 2013, see [3]).
    [Show full text]
  • Basic (And Some More) Facts from Convexity
    1 Basic (and some more) facts from Convexity In this chapter we will briefly collect some basic results and concepts con- cerning convex bodies, which may be considered as the main ”continuous” component/ingredient of the Geometry of Numbers. For proofs of the results we will refer to the literature, mainly to the books [2, 5, 6, 7, 9, 11, 13, 14], which are also excellent sources for further information on the state of the art concerning convex bodies, polytopes and their applications. As usual we will start with setting up some basic notation; more specific ones will be introduced when needed. n Let R = x =(x1,...,xn)| : xi R be the n-dimensional Euclidean { 2 } space, equipped with the standard inner product x, y = n x y , x, y h i i=1 i i 2 Rn. P For a subset X Rn,letlinX and a↵ X be its linear and affine hull, ✓ respectively, i.e., with respect to inclusions, the smallest linear or affine subspace containing X.IfX = we set lin X = 0 , and a↵ X = .The ; { } ; dimension of a set X is the dimension of its affine hull and will be denoted by dim X.ByX +Y we mean the vectorwise addition of subsets X, Y Rn, ✓ i.e., X + Y = x + y : x X, y Y . { 2 2 } The multiplication λX of a set X Rn with λ R is also declared vec- ✓ 2 torwise, i.e., λX = λ x : x X .Wewrite X =( 1) X, X Y = { 2 } − − − X +( 1) Y and x + Y instead of x + Y .
    [Show full text]
  • On Nazarov's Complex Analytic Approach to the Mahler Conjecture and the Bourgain-Milman Inequality
    On Nazarov’s Complex Analytic Approach to the Mahler Conjecture and the Bourgain-Milman Inequality Zbigniew Błocki Abstract We survey the several complex variables approach to the Mahler conjecture from convex analysis due to Nazarov. We also show, although only numer- ically, that his proof of the Bourgain-Milman inequality using estimates for the Bergman kernel for tube domains cannot be improved to obtain the Mahler con- jecture which would be the optimal version of this inequality. Keywords Mahler conjecture · Bergman kernel · Pluricomplex Green function 1 Introduction Let K be a convex symmetric body in Rn. This means that K =−K , K is convex, bounded, closed and has non-empty interior. The dual (or polar) body of K is given by K ={y ∈ Rn : x · y ≤ 1 for all x ∈ K }, where x · y = x1 y1 +···+xn yn. The Mahler volume of K is defined by M(K ) = λn(K )λn(K ), n where λn denotes the Lebesgue measure in R . It is easy to see that it is independent of linear transformations and thus also on the inner product in Rn. The Mahler volume n is therefore an invariant of the Banach space (R , qK ), where qK is the Minkowski functional of K : −1 qK (x) = inf{t > 0: t x ∈ K }=sup{x · y : y ∈ K }. Z. Błocki (B) Uniwersytet Jagiello´nski, Instytut Matematyki, Łojasiewicza 6,30-348 Kraków, Poland e-mail: [email protected]; [email protected] © Springer Japan 2015 89 F. Bracci et al. (eds.), Complex Analysis and Geometry, Springer Proceedings in Mathematics & Statistics 144, DOI 10.1007/978-4-431-55744-9_6 90 Z.
    [Show full text]
  • Geometric Inequalities for Anti-Blocking Bodies 3
    GEOMETRIC INEQUALITIES FOR ANTI-BLOCKING BODIES SHIRI ARTSTEIN-AVIDAN, SHAY SADOVSKY, AND RAMAN SANYAL Abstract. We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding vol- umes and mixed volumes, including Godberson’s conjecture, near-optimal bounds on Mahler volumes, Saint-Raymond-type inequalities on mixed volumes, and reverse Kleitman inequal- ities for mixed volumes. We apply our results to the combinatorics of posets and prove Sidorenko-type inequalities for linear extensions of pairs of 2-dimensional posets. The results rely on some elegant decompositions of differences of anti-blocking bodies, which turn out to hold for anti-blocking bodies with respect to general polyhedral cones. 1. Introduction and results A convex body K Rn is called 1-unconditional if (x ,...,x ) K implies that the ⊆ 1 n ∈ points ( x ,..., x ) also belong to K. Clearly such a body is determined by its subset ± 1 ± n K := K Rn , which is itself a convex set of a special kind, called an “anti-blocking + ∩ + body” [17, 18] or a “convex corner” [8]. A convex body K Rn is called anti-blocking if ⊂ + for all y K and x Rn with x y for all i = 1,...,n, it holds that x K. It is clear ∈ ∈ + i ≤ i ∈ that 1-unconditional bodies and anti-blocking bodies are in one-to-one correspondence. The class of locally anti-blocking bodies is defined to be those bodies in Rn such that all of their orthants are anti-blocking.
    [Show full text]