The minimal volume of simplices containing a convex body
|
|
- Judith Bonnie Kelley
- 5 years ago
- Views:
Transcription
1 The minimal volume of simplices containing a convex body Mariano Merzbacher (Joint work with Damián Pinasco and Daniel Galicer) Universidad de Buenos Aires and CONICET NonLinear Functional Analysis, Valencia 2017
2 The basics Notation A convex body K R n is a compact convex set with nonempty interior.
3 The basics Notation A convex body K R n is a compact convex set with nonempty interior.
4 The basics Notation A convex body K R n is a compact convex set with nonempty interior. The barycenter of K is bar(k) := 1 vol(k) K xdx.
5 The basics Notation A simplex in R n is always an n-simplex, the convex hull of n + 1 affinely independents points. 3-Simplex
6 The problem Given a convex body K,approximate it a by a simpler one, in this case a simplex S. K
7 The problem Given a convex body K,approximate it a by a simpler one, in this case a simplex S. K S
8 The problem Given a convex body K,approximate it a by a simpler one, in this case a simplex S. K S Approximating: enclosing it and having similar volume (Lebesgue measure).
9 Definition For a convex body K we define the outer simplex ratio of K as Sout(K) := min ( ) vol(s) 1/n, vol(k) the minimum is taken over all simplices S R n containing K.
10 Definition For a convex body K we define the outer simplex ratio of K as Sout(K) := min ( ) vol(s) 1/n, vol(k) the minimum is taken over all simplices S R n containing K. Problem How small can Sout(K) be?
11 Historical background This is the generalization of an old geometrical problem. n = 2 Wilhelm Gross at the early 20 s: every convex body K R 2 can be inscribed in a triangle of area 2vol(K).
12 Historical background This is the generalization of an old geometrical problem. n = 2 Wilhelm Gross at the early 20 s: every convex body K R 2 can be inscribed in a triangle of area 2vol(K). In this case the square is the worst posible fit.
13 n = 3 No exact bound has been given, Sout(K) 9 2 is conjectured. For a parallelepiped K a tethraedron of volume 9 2vol(K) can be found, but is not know if it is the best posible bound.
14 n = 3 No exact bound has been given, Sout(K) 9 2 is conjectured. For a parallelepiped K a tethraedron of volume 9 2vol(K) can be found, but is not know if it is the best posible bound. For n 4 no exact bound was even conjectured.
15 Some examples The Euclidean ball, B n 2
16 Some examples The Euclidean ball, B n 2 B n 2 S,the regular simplex, and is the smallest one.
17 Some examples The Euclidean ball, B n 2 B n 2 S,the regular simplex, and is the smallest one. vol(b n 2 ) = π n 2 Γ( n 2 +1) vol(s) = (n+1) n+1 2 n n 2 n!
18 Some examples The Euclidean ball, B n 2 B n 2 S,the regular simplex, and is the smallest one. vol(b n 2 ) = π n 2 Γ( n 2 +1) vol(s) = (n+1) n+1 2 n n 2 n! Applying Stirling s formula: ( ) 1 Sout(B2 n) = vol(s) n vol(b2 n) n 1 2
19 Some examples The unit cube, C = [0, 1] n.
20 Some examples The unit cube, C = [0, 1] n. C S = {0, ne 1,..., ne n }
21 Some examples The unit cube, C = [0, 1] n. C S = {0, ne 1,..., ne n } vol(c) = 1 vol(s) = nn n!
22 Some examples The unit cube, C = [0, 1] n. C S = {0, ne 1,..., ne n } vol(c) = 1 vol(s) = nn n! Applying Stirling s formula: Sout(C) ( ) 1 vol(s) n vol(c) 1
23 Some examples The unit cube, C = [0, 1] n. C S = {0, ne 1,..., ne n } vol(c) = 1 vol(s) = nn n! Applying Stirling s formula: Sout(C) ( ) 1 vol(s) n vol(c) For higher dimensions this is no longer the worst fit. 1
24 Known general bounds
25 Known general bounds Chakerian in 1973, Sout(K) n n 1 n n,
26 Known general bounds Chakerian in 1973, Sout(K) n n 1 n n, Giannopoulos-Hartzoulaki 2002/Pivovarov-Paoruis 2017, Sout(K) C log(n) n.
27 Known general bounds Chakerian in 1973, Sout(K) n n 1 n n, Giannopoulos-Hartzoulaki 2002/Pivovarov-Paoruis 2017, Sout(K) C log(n) n. Theorem (Galicer, Pinasco, M.) Sout(K) C n for some absolute constant C > 0.
28 Known general bounds Chakerian in 1973, Sout(K) n n 1 n n, Giannopoulos-Hartzoulaki 2002/Pivovarov-Paoruis 2017, Sout(K) C log(n) n. Theorem (Galicer, Pinasco, M.) Sout(K) C n for some absolute constant C > 0. Up to an absolute constant this bound cannot be lessened, as Sout(B n 2 ) n.
29 Polar bodies Definition Given a convex body K R n, with 0 int(k), its polar body is K = {y R n : x, y 1 x K}.
30 Polar bodies Definition Given a convex body K R n, with 0 int(k), its polar body is K = {y R n : x, y 1 x K}.
31 Polar bodies Definition Given a convex body K R n, with 0 int(k), its polar body is K = {y R n : x, y 1 x K}. Some facts If K is the unit ball of E = (R n, K ), K is the ball of E.
32 Polar bodies Definition Given a convex body K R n, with 0 int(k), its polar body is K = {y R n : x, y 1 x K}. Some facts If K is the unit ball of E = (R n, K ), K is the ball of E. The polar of a simplex is also a simplex.
33 Polar bodies Definition Given a convex body K R n, with 0 int(k), its polar body is K = {y R n : x, y 1 x K}. Some facts If K is the unit ball of E = (R n, K ), K is the ball of E. The polar of a simplex is also a simplex. If 0 / int(k), K is unbounded.
34 Polar bodies Definition Given a convex body K R n, with 0 int(k), its polar body is K = {y R n : x, y 1 x K}. Some facts If K is the unit ball of E = (R n, K ), K is the ball of E. The polar of a simplex is also a simplex. If 0 / int(k), K is unbounded. (K ) = K and K L L K.
35 Polarity and volume Theorem (Balschke-Santaló and Bourgain-Milman) If K has barycenter at the origin then (vol(k)vol(k )) 1 n vol(b n 2 ) 2 n 1 n
36 Polarity and volume Theorem (Balschke-Santaló and Bourgain-Milman) If K has barycenter at the origin then (vol(k)vol(k )) 1 n vol(b n 2 ) 2 n 1 n Observations The barycenter condition is central for this inequality to hold.
37 Polarity and volume Theorem (Balschke-Santaló and Bourgain-Milman) If K has barycenter at the origin then (vol(k)vol(k )) 1 n vol(b n 2 ) 2 n 1 n Observations The barycenter condition is central for this inequality to hold. In this case polarity reverses volume.
38 A dual problem Two equivalent problems
39 A dual problem Two equivalent problems Original problem Approximating a convex body by a simplex enclosing it of small volume.
40 A dual problem Two equivalent problems Original problem Approximating a convex body by a simplex enclosing it of small volume. Dual problem Approximating a convex body by a simplex inside it of large volume.
41 A dual problem Two equivalent problems Original problem Approximating a convex body by a simplex enclosing it of small volume and same barycenter. Dual problem Approximating a convex body by a simplex inside it of large volume and same barycenter.
42 Inner volume ratio S inn (K) := max S K ( ) 1 vol(s) n vol(k)
43 Inner volume ratio Theorem (dual version) S inn (K) := max S K ( ) 1 vol(s) n vol(k) S inn (K) C n for some absolute constant C > 0.
44 Goal Given K R n find a simplex S K satisfying: 1 vol(s) 1 n C vol(k) 1 n n 2 bar(s) = bar(k) with the same barycenter and large volume.
45 A random approach
46 A random approach Objective A simplex inside K with same barycenter and large volume.
47 A random approach Objective A simplex inside K with same barycenter and large volume. Strategy Define an adequate probabilty measure on K.
48 A random approach Objective A simplex inside K with same barycenter and large volume. Strategy Define an adequate probabilty measure on K. Consider the random simplex S := co{0, X 1... X n }, with X i distributed according to this measure.
49 A random approach Objective A simplex inside K with same barycenter and large volume. Strategy Define an adequate probabilty measure on K. Consider the random simplex S := co{0, X 1... X n }, with X i distributed according to this measure. Prove that with postive probability there is a simplex similar to the objective.
50 A random approach Objective A simplex inside K with same barycenter and large volume. Strategy Define an adequate probabilty measure on K. Consider the random simplex S := co{0, X 1... X n }, with X i distributed according to this measure. Prove that with postive probability there is a simplex similar to the objective. Adjust it.
51 The uniforme measure on a general body can be hard to handle.
52 The uniforme measure on a general body can be hard to handle. Affine invariance S inn (K) = S inn (TK) for every affin transformation T.
53 The uniforme measure on a general body can be hard to handle. Affine invariance S inn (K) = S inn (TK) for every affin transformation T. S inn (K) is a property of the affine class of K rather than a property of K.
54 The uniforme measure on a general body can be hard to handle. Affine invariance S inn (K) = S inn (TK) for every affin transformation T. S inn (K) is a property of the affine class of K rather than a property of K. Choose a representative with a controllable uniform measure.
55 Isotropic bodies Definition A convex body K is isotropic if:
56 Isotropic bodies Definition A convex body K is isotropic if: vol(k) = 1, bar(k) = 0, there is L K R such that K x ix j = L 2 K δ ij. ( K X X = L K Id )
57 Isotropic bodies Definition A convex body K is isotropic if: vol(k) = 1, bar(k) = 0, there is L K R such that K x ix j = L 2 K δ ij. ( K X X = L K Id )
58 Isotropic bodies Definition A convex body K is isotropic if: vol(k) = 1, bar(k) = 0, there is L K R such that K x ix j = L 2 K δ ij. ( K X X = L K Id ) Fact Every convex body K has a unique (up to orthogonal transformations) affine isotropic image.
59 Random simplex on isotropic bodies Proposition Let K be an isotropic convex body and X 1,... X n independent random variables distributed uniformly on K. S = co{0, X 1,..., X n }. With probabilty grater than 1 e n :
60 Random simplex on isotropic bodies Proposition Let K be an isotropic convex body and X 1,... X n independent random variables distributed uniformly on K. S = co{0, X 1,..., X n }. With probabilty grater than 1 e n : bar(s) = 1 n+1 n i=1 X i L K C 1
61 Random simplex on isotropic bodies Proposition Let K be an isotropic convex body and X 1,... X n independent random variables distributed uniformly on K. S = co{0, X 1,..., X n }. With probabilty grater than 1 e n : bar(s) = 1 n+1 n i=1 X i L K C 1 vol(s) = det X 1...X n n! C n 2 n n 2 Ln K
62 Random simplex on isotropic bodies Proposition Let K be an isotropic convex body and X 1,... X n independent random variables distributed uniformly on K. S = co{0, X 1,..., X n }. With probabilty grater than 1 e n : bar(s) = 1 n+1 n i=1 X i L K C 1 vol(s) = det X 1...X n n! C n 2 n n 2 Ln K S has large volume and barycenter close to the origin.
63 0 bar(s) S K
64 0 bar(s) S K
65 A non-probabilistic approach A convex body K is in John s position if B2 n ellipsoide inside it. is the maximal volume
66 A non-probabilistic approach A convex body K is in John s position if B2 n ellipsoide inside it. is the maximal volume Lemma (Dvoresky-Rogers) Let K R n be a convex body in John s position, there are y 1... y n Bd(B2 n ) Bd(K) such that ( ) 1 n i + 1 P span{y1...y i 1 } (y 2 i). n
67 A non-probabilistic approach A convex body K is in John s position if B2 n ellipsoide inside it. is the maximal volume Lemma (Dvoresky-Rogers) Let K R n be a convex body in John s position, there are y 1... y n Bd(B2 n ) Bd(K) such that ( ) 1 n i + 1 P span{y1...y i 1 } (y 2 i). n det y 1... y n = y 1 n i=2 P span{y 1...y i 1 } (y i) ( ) n n 1 2 n!
68 Case K symmetric
69 Case K symmetric Consider the points y 1,..., y n given by Dvoretsky-Rogers. 0 y 1 y 2
70 Case K symmetric y 2 0 y 1 y 1 y 2 Consider the points y 1,..., y n given by Dvoretsky-Rogers. K is symmetric, so y 1,..., y n Bd(K)
71 Case K symmetric y 2 0 y 1 y 1 y 2 Consider the points y 1,..., y n given by Dvoretsky-Rogers. K is symmetric, so y 1,..., y n Bd(K) P = n i { x, y i 1} P
72 Case K symmetric y 2 0 y 1 y 1 y 2 Consider the points y 1,..., y n given by Dvoretsky-Rogers. K is symmetric, so y 1,..., y n Bd(K) P = n i { x, y i 1} 2 vol(p) = n det y 1...y C n n P
73 Case K symmetric y 2 0 y 1 P y 1 y 2 Consider the points y 1,..., y n given by Dvoretsky-Rogers. K is symmetric, so y 1,..., y n Bd(K) P = n i { x, y i 1} 2 vol(p) = n det y 1...y C n n vol(p) vol(k) vol(p) vol(b n 2 ) C n n n 2
74 Case K symmetric S y 2 0 y 1 P y 1 y 2 Consider the points y 1,..., y n given by Dvoretsky-Rogers. K is symmetric, so y 1,..., y n Bd(K) P = n i { x, y i 1} 2 vol(p) = n det y 1...y C n n vol(p) vol(p) C n n n vol(k) vol(b2 n) 2 Finally take S so that ( vol(s) vol(p) ) 1 n C
75 Case K symmetric S y 2 0 y 1 P y 1 y 2 Consider the points y 1,..., y n given by Dvoretsky-Rogers. K is symmetric, so y 1,..., y n Bd(K) P = n i { x, y i 1} 2 vol(p) = n det y 1...y C n n vol(p) vol(p) C n n n vol(k) vol(b2 n) 2 Finally take S so that ( vol(s) vol(p) ) 1 n C
76 General case Rogers-Shephard Inequality Given a convex body K with barycenter at the origin, vol(k K) 4 n vol(k).
77 General case Rogers-Shephard Inequality Given a convex body K with barycenter at the origin, vol(k K) 4 n vol(k). A centered body can be approximated by outside by a symmetric body with essentialy the same volume. ( vol(k K) vol(k) ) 1 n 4.
78 Thank you!
8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationAnother Low-Technology Estimate in Convex Geometry
Convex Geometric Analysis MSRI Publications Volume 34, 1998 Another Low-Technology Estimate in Convex Geometry GREG KUPERBERG Abstract. We give a short argument that for some C > 0, every n- dimensional
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More informationEstimates for the affine and dual affine quermassintegrals of convex bodies
Estimates for the affine and dual affine quermassintegrals of convex bodies Nikos Dafnis and Grigoris Paouris Abstract We provide estimates for suitable normalizations of the affine and dual affine quermassintegrals
More informationIsomorphic Steiner symmetrization of p-convex sets
Isomorphic Steiner symmetrization of p-convex sets Alexander Segal Tel-Aviv University St. Petersburg, June 2013 Alexander Segal Isomorphic Steiner symmetrization 1 / 20 Notation K will denote the volume
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationRapid Steiner symmetrization of most of a convex body and the slicing problem
Rapid Steiner symmetrization of most of a convex body and the slicing problem B. Klartag, V. Milman School of Mathematical Sciences Tel Aviv University Tel Aviv 69978, Israel Abstract For an arbitrary
More informationGAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. 2π) n
GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. A. ZVAVITCH Abstract. In this paper we give a solution for the Gaussian version of the Busemann-Petty problem with additional
More informationConvex inequalities, isoperimetry and spectral gap III
Convex inequalities, isoperimetry and spectral gap III Jesús Bastero (Universidad de Zaragoza) CIDAMA Antequera, September 11, 2014 Part III. K-L-S spectral gap conjecture KLS estimate, through Milman's
More informationMahler Conjecture and Reverse Santalo
Mini-Courses Radoslaw Adamczak Random matrices with independent log-concave rows/columns. I will present some recent results concerning geometric properties of random matrices with independent rows/columns
More informationProbabilistic Methods in Asymptotic Geometric Analysis.
Probabilistic Methods in Asymptotic Geometric Analysis. C. Hugo Jiménez PUC-RIO, Brazil September 21st, 2016. Colmea. RJ 1 Origin 2 Normed Spaces 3 Distribution of volume of high dimensional convex bodies
More informationThe Covering Index of Convex Bodies
The Covering Index of Convex Bodies Centre for Computational and Discrete Geometry Department of Mathematics & Statistics, University of Calgary uary 12, 2015 Covering by homothets and illumination Let
More informationGeometric problems. Chapter Projection on a set. The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as
Chapter 8 Geometric problems 8.1 Projection on a set The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as dist(x 0,C) = inf{ x 0 x x C}. The infimum here is always achieved.
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
More informationVolume of convex hull of two bodies and related problems
Volume of convex hull of two bodies and related problems Ákos G.Horváth Department of Geometry, Mathematical Institute, Budapest University of Technology and Economics (BME) Geometry and Symmetry, Veszprém,
More informationON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES
ON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES DAVID ALONSO-GUTIÉRREZ, JESÚS BASTERO, JULIO BERNUÉS, AND PAWE L WOLFF Abstract. The isotropy constant of any d-dimensional polytope with n vertices
More informationSections of Convex Bodies via the Combinatorial Dimension
Sections of Convex Bodies via the Combinatorial Dimension (Rough notes - no proofs) These notes are centered at one abstract result in combinatorial geometry, which gives a coordinate approach to several
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More informationCentrally Symmetric Convex Sets
Journal of Convex Analysis Volume 14 (2007), No. 2, 345 351 Centrally Symmetric Convex Sets V. G. Boltyanski CIMAT, A.P. 402, 36000 Guanajuato, Gto., Mexico boltian@cimat.mx J. Jerónimo Castro CIMAT, A.P.
More informationCS675: Convex and Combinatorial Optimization Spring 2018 The Ellipsoid Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 The Ellipsoid Algorithm Instructor: Shaddin Dughmi History and Basics Originally developed in the mid 70s by Iudin, Nemirovski, and Shor for use
More informationA glimpse into convex geometry. A glimpse into convex geometry
A glimpse into convex geometry 5 \ þ ÏŒÆ Two basis reference: 1. Keith Ball, An elementary introduction to modern convex geometry 2. Chuanming Zong, What is known about unit cubes Convex geometry lies
More information9. Geometric problems
9. Geometric problems EE/AA 578, Univ of Washington, Fall 2016 projection on a set extremal volume ellipsoids centering classification 9 1 Projection on convex set projection of point x on set C defined
More informationVolumes of projection bodies of some classes of convex bodies
Volumes of projection bodies of some classes of convex bodies Christos Saroglou University of Crete Department of Mathematics Abstract Schneider posed the problem of determining the maximal value of the
More informationAbstracts. Analytic and Probabilistic Techniques in Modern Convex Geometry November 7-9, 2015 University of Missouri-Columbia
Abstracts Analytic and Probabilistic Techniques in Modern Convex Geometry November 7-9, 2015 University of Missouri-Columbia Rotations of shadows of convex bodies: Positive Results and Counterexamples
More informationBergman Kernel and Pluripotential Theory
Bergman Kernel and Pluripotential Theory Zbigniew B locki Uniwersytet Jagielloński, Kraków, Poland http://gamma.im.uj.edu.pl/ blocki İstanbul Analysis Seminar March 21, 2014 Bergman Completeness Bergman
More informationAsymptotic shape of a random polytope in a convex body
Asymptotic shape of a random polytope in a convex body N. Dafnis, A. Giannopoulos, and A. Tsolomitis Abstract Let K be an isotropic convex body in R n and let Z qk be the L q centroid body of K. For every
More informationApproximately Gaussian marginals and the hyperplane conjecture
Approximately Gaussian marginals and the hyperplane conjecture Tel-Aviv University Conference on Asymptotic Geometric Analysis, Euler Institute, St. Petersburg, July 2010 Lecture based on a joint work
More informationMeasuring Ellipsoids 1
Measuring Ellipsoids 1 Igor Rivin Temple University 2 What is an ellipsoid? E = {x E n Ax = 1}, where A is a non-singular linear transformation of E n. Remark that Ax = Ax, Ax = x, A t Ax. The matrix Q
More informationThis chapter reviews some basic geometric facts that we will need during the course.
Chapter 1 Some Basic Geometry This chapter reviews some basic geometric facts that we will need during the course. 1.1 Affine Geometry We will assume that you are familiar with the basic notions of linear
More informationOn Mahler s conjecture a symplectic aspect
Dec 13, 2017 Differential Geometry and Differential Equations On Mahler s conjecture a symplectic aspect Hiroshi Iriyeh (Ibaraki University) Contents 1. Convex body and its polar 2. Mahler s conjecture
More informationA NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES
A NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES Erwin Lutwak, Deane Yang, and Gaoyong Zhang Department of Mathematics Polytechnic University Brooklyn, NY 11201 Abstract. It is shown that corresponding to
More informationOn isotropicity with respect to a measure
On isotropicity with respect to a measure Liran Rotem Abstract A body is said to be isoptropic with respect to a measure µ if the function θ x, θ dµ(x) is constant on the unit sphere. In this note, we
More informationRandomized isoperimetric inequalities
Randomized isoperimetric inequalities Grigoris Paouris Peter Pivovarov May 6, 2016 Abstract We discuss isoperimetric inequalities for convex sets. These include the classical isoperimetric inequality and
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
More informationarxiv: v1 [math.mg] 27 Jan 2016
On the monotonicity of the moments of volumes of random simplices arxiv:67295v [mathmg] 27 Jan 26 Benjamin Reichenwallner and Matthias Reitzner University of Salzburg and University of Osnabrueck Abstract
More informationPacking convex bodies by cylinders
Packing convex bodies by cylinders K. Bezdek A. E. Litvak Abstract In [BL] in relation to the unsolved Bang s plank problem (1951) we obtained a lower bound for the sum of relevant measures of cylinders
More informationThe M-ellipsoid, Symplectic Capacities and Volume
The M-ellipsoid, Symplectic Capacities and Volume Shiri Artstein-Avidan, Vitali Milman and Yaron Ostrover January 26, 2007 Abstract: In this work we bring together tools and ideology from two different
More informationNotes for Functional Analysis
Notes for Functional Analysis Wang Zuoqin (typed by Xiyu Zhai) November 6, 2015 1 Lecture 18 1.1 The convex hull Let X be any vector space, and E X a subset. Definition 1.1. The convex hull of E is the
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationGaussian Measure of Sections of convex bodies
Gaussian Measure of Sections of convex bodies A. Zvavitch Department of Mathematics, University of Missouri, Columbia, MO 652, USA Abstract In this paper we study properties of sections of convex bodies
More informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
More informationAsymptotic Geometric Analysis, Fall 2006
Asymptotic Geometric Analysis, Fall 006 Gideon Schechtman January, 007 1 Introduction The course will deal with convex symmetric bodies in R n. In the first few lectures we will formulate and prove Dvoretzky
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More informationThe degree of lattice polytopes
The degree of lattice polytopes Benjamin Nill - FU Berlin Graduiertenkolleg MDS - December 10, 2007 Lattice polytopes having h -polynomials with given degree and linear coefficient. arxiv:0705.1082, to
More informationARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY
ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY MÁRTON NASZÓDI, JÁNOS PACH, AND KONRAD SWANEPOEL Abstract. Answering a question of Füredi and Loeb (1994 we show that the maximum number of pairwise intersecting
More informationProblem Set 6: Solutions Math 201A: Fall a n x n,
Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series
More informationSuper-Gaussian directions of random vectors
Weizmann Institute & Tel Aviv University IMU-INdAM Conference in Analysis, Tel Aviv, June 2017 Gaussian approximation Many distributions in R n, for large n, have approximately Gaussian marginals. Classical
More informationStar bodies with completely symmetric sections
Star bodies with completely symmetric sections Sergii Myroshnychenko, Dmitry Ryabogin, and Christos Saroglou Abstract We say that a star body is completely symmetric if it has centroid at the origin and
More informationAn Algorithmist s Toolkit Nov. 10, Lecture 17
8.409 An Algorithmist s Toolkit Nov. 0, 009 Lecturer: Jonathan Kelner Lecture 7 Johnson-Lindenstrauss Theorem. Recap We first recap a theorem (isoperimetric inequality) and a lemma (concentration) from
More informationSUCCESSIVE-MINIMA-TYPE INEQUALITIES. U. Betke, M. Henk and J.M. Wills
SUCCESSIVE-MINIMA-TYPE INEQUALITIES U. Betke, M. Henk and J.M. Wills Abstract. We show analogues of Minkowski s theorem on successive minima, where the volume is replaced by the lattice point enumerator.
More informationThe Ellipsoid Algorithm
The Ellipsoid Algorithm John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA 9 February 2018 Mitchell The Ellipsoid Algorithm 1 / 28 Introduction Outline 1 Introduction 2 Assumptions
More informationOn the spectrum of the Hodge Laplacian and the John ellipsoid
Banff, July 203 On the spectrum of the Hodge Laplacian and the John ellipsoid Alessandro Savo, Sapienza Università di Roma We give upper and lower bounds for the first eigenvalue of the Hodge Laplacian
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationMotivating examples Introduction to algorithms Simplex algorithm. On a particular example General algorithm. Duality An application to game theory
Instructor: Shengyu Zhang 1 LP Motivating examples Introduction to algorithms Simplex algorithm On a particular example General algorithm Duality An application to game theory 2 Example 1: profit maximization
More informationMinkowski Valuations
Minkowski Valuations Monika Ludwig Abstract Centroid and difference bodies define SL(n) equivariant operators on convex bodies and these operators are valuations with respect to Minkowski addition. We
More informationINEQUALITIES FOR DUAL AFFINE QUERMASSINTEGRALS
INEQUALITIES FOR DUAL AFFINE QUERMASSINTEGRALS YUAN JUN AND LENG GANGSONG Received 18 April 2005; Revised 2 November 2005; Accepted 8 November 2005 For star bodies, the dual affine quermassintegrals were
More informationLecture 1: Convex Sets January 23
IE 521: Convex Optimization Instructor: Niao He Lecture 1: Convex Sets January 23 Spring 2017, UIUC Scribe: Niao He Courtesy warning: These notes do not necessarily cover everything discussed in the class.
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationA remark on the slicing problem
A remark on the slicing problem A. Giannopoulos, G. Paouris and B-H. Vritsiou Abstract The purpose of this article is to describe a reduction of the slicing problem to the study of the parameter I 1(,
More informationExercises: Brunn, Minkowski and convex pie
Lecture 1 Exercises: Brunn, Minkowski and convex pie Consider the following problem: 1.1 Playing a convex pie Consider the following game with two players - you and me. I am cooking a pie, which should
More informationTopics in Theoretical Computer Science: An Algorithmist's Toolkit Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.409 Topics in Theoretical Computer Science: An Algorithmist's Toolkit Fall 2007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationGeometry of isotropic convex bodies and the slicing problem
Geometry of isotropic convex bodies and the slicing problem Apostolos Giannopoulos Abstract Lecture notes for the introductory worshop of the program Geometric Functional Analysis and Applications at the
More informationInner approximation of convex cones via primal-dual ellipsoidal norms
Inner approximation of convex cones via primal-dual ellipsoidal norms by Miaolan Xie A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of
More informationComplexity of linear programming: outline
Complexity of linear programming: outline I Assessing computational e ciency of algorithms I Computational e ciency of the Simplex method I Ellipsoid algorithm for LP and its computational e ciency IOE
More informationIE 521 Convex Optimization Homework #1 Solution
IE 521 Convex Optimization Homework #1 Solution your NAME here your NetID here February 13, 2019 Instructions. Homework is due Wednesday, February 6, at 1:00pm; no late homework accepted. Please use the
More informationLectures in Geometric Functional Analysis. Roman Vershynin
Lectures in Geometric Functional Analysis Roman Vershynin Contents Chapter 1. Functional analysis and convex geometry 4 1. Preliminaries on Banach spaces and linear operators 4 2. A correspondence between
More informationGeometry of log-concave Ensembles of random matrices
Geometry of log-concave Ensembles of random matrices Nicole Tomczak-Jaegermann Joint work with Radosław Adamczak, Rafał Latała, Alexander Litvak, Alain Pajor Cortona, June 2011 Nicole Tomczak-Jaegermann
More informationON SUCCESSIVE RADII AND p-sums OF CONVEX BODIES
ON SUCCESSIVE RADII AND p-sums OF CONVEX BODIES BERNARDO GONZÁLEZ AND MARÍA A. HERNÁNDEZ CIFRE Abstract. We study the behavior of the so called successive inner and outer radii with respect to the p-sums
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationHyperplane sections of convex bodies
Hyperplane sections of convex bodies Carla Peri Università Cattolica S.C. - Milano Fourth International Workshop on Convex Geometry - Analytic Aspects Cortona, June 4th - 8th, 2007 K R n convex body K
More informationLinear Analysis Lecture 5
Linear Analysis Lecture 5 Inner Products and V Let dim V < with inner product,. Choose a basis B and let v, w V have coordinates in F n given by x 1. x n and y 1. y n, respectively. Let A F n n be the
More informationNote on shortest and nearest lattice vectors
Note on shortest and nearest lattice vectors Martin Henk Fachbereich Mathematik, Sekr. 6-1 Technische Universität Berlin Straße des 17. Juni 136 D-10623 Berlin Germany henk@math.tu-berlin.de We show that
More information1: Introduction to Lattices
CSE 206A: Lattice Algorithms and Applications Winter 2012 Instructor: Daniele Micciancio 1: Introduction to Lattices UCSD CSE Lattices are regular arrangements of points in Euclidean space. The simplest
More informationALEXANDER KOLDOBSKY AND ALAIN PAJOR. Abstract. We prove that there exists an absolute constant C so that µ(k) C p max. ξ S n 1 µ(k ξ ) K 1/n
A REMARK ON MEASURES OF SECTIONS OF L p -BALLS arxiv:1601.02441v1 [math.mg] 11 Jan 2016 ALEXANDER KOLDOBSKY AND ALAIN PAJOR Abstract. We prove that there exists an absolute constant C so that µ(k) C p
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationNAKAJIMA S PROBLEM: CONVEX BODIES OF CONSTANT WIDTH AND CONSTANT BRIGHTNESS
NAKAJIMA S PROBLEM: CONVEX BODIES OF CONSTANT WIDTH AND CONSTANT BRIGHTNESS RALPH HOWARD AND DANIEL HUG Dedicated to Rolf Schneider on the occasion of his 65th birthday ABSTRACT. For a convex body K R
More informationThe location of the hot spot in a grounded convex conductor
The location of the hot spot in a grounded convex conductor ROLANDO MAGNANINI joint paper with Lorenzo BRASCO and Paolo SALANI R. Magnanini (Università di Firenze) The location of the hot spot Cortona,
More informationOn the monotonicity of the expected volume of a random. Luis Rademacher Computer Science and Engineering The Ohio State University
On the monotonicity of the expected volume of a random simplex Luis Rademacher Computer Science and Engineering The Ohio State University Sylvester s problem 4 random points: what is the probability that
More informationCSE 206A: Lattice Algorithms and Applications Spring Minkowski s theorem. Instructor: Daniele Micciancio
CSE 206A: Lattice Algorithms and Applications Spring 2014 Minkowski s theorem Instructor: Daniele Micciancio UCSD CSE There are many important quantities associated to a lattice. Some of them, like the
More informationSome Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets Santanu S. Dey and Diego A. Morán R. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationAn Optimal Affine Invariant Smooth Minimization Algorithm.
An Optimal Affine Invariant Smooth Minimization Algorithm. Alexandre d Aspremont, CNRS & École Polytechnique. Joint work with Martin Jaggi. Support from ERC SIPA. A. d Aspremont IWSL, Moscow, June 2013,
More informationNormal Fans of Polyhedral Convex Sets
Set-Valued Analysis manuscript No. (will be inserted by the editor) Normal Fans of Polyhedral Convex Sets Structures and Connections Shu Lu Stephen M. Robinson Received: date / Accepted: date Dedicated
More informationContents Real Vector Spaces Linear Equations and Linear Inequalities Polyhedra Linear Programs and the Simplex Method Lagrangian Duality
Contents Introduction v Chapter 1. Real Vector Spaces 1 1.1. Linear and Affine Spaces 1 1.2. Maps and Matrices 4 1.3. Inner Products and Norms 7 1.4. Continuous and Differentiable Functions 11 Chapter
More informationPOLARS AND DUAL CONES
POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.
More informationVolumes on Normed and Finsler Spaces
Riemann Finsler Geometry MSRI Publications Volume 50, 2004 Volumes on Normed and Finsler Spaces J. C. ÁLVAREZ PAIVA AND A. C. THOMPSON Contents 1. Introduction 1 2. A Short Review of the Geometry of Normed
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationExtreme points of compact convex sets
Extreme points of compact convex sets In this chapter, we are going to show that compact convex sets are determined by a proper subset, the set of its extreme points. Let us start with the main definition.
More informationLargest dual ellipsoids inscribed in dual cones
Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that
More informationThe Entropy Per Coordinate of a Random Vector is Highly Constrained Under Convexity Conditions Sergey Bobkov and Mokshay Madiman, Member, IEEE
4940 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 8, AUGUST 2011 The Entropy Per Coordinate of a Random Vector is Highly Constrained Under Convexity Conditions Sergey Bobkov and Mokshay Madiman,
More informationContinuous Optimisation, Chpt 7: Proper Cones
Continuous Optimisation, Chpt 7: Proper Cones Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2017co.html version: 10/11/17 Monday 13th November
More informationAN APPLICATION OF SHADOW SYSTEMS TO MAHLER S CONJECTURE.
AN APPLICATION OF SHADOW SYSTEMS TO MAHLER S CONJECTURE. MATTHIEU FRADELIZI, MATHIEU MEYER AND ARTEM ZVAVITCH Abstract. We elaborate on the use of shadow systems to prove particular case of the conjectured
More informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationNotes taken by Costis Georgiou revised by Hamed Hatami
CSC414 - Metric Embeddings Lecture 6: Reductions that preserve volumes and distance to affine spaces & Lower bound techniques for distortion when embedding into l Notes taken by Costis Georgiou revised
More informationOn the distribution of the ψ 2 -norm of linear functionals on isotropic convex bodies
On the distribution of the ψ 2 -norm of linear functionals on isotropic convex bodies Joint work with G. Paouris and P. Valettas Cortona 2011 June 16, 2011 (Cortona 2011) Distribution of the ψ 2 -norm
More informationChapter 2: Preliminaries and elements of convex analysis
Chapter 2: Preliminaries and elements of convex analysis Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-14-15.shtml Academic year 2014-15
More informationInequality Constraints
Chapter 2 Inequality Constraints 2.1 Optimality Conditions Early in multivariate calculus we learn the significance of differentiability in finding minimizers. In this section we begin our study of the
More informationShadow systems and volumes of polar convex bodies
Shadow systems and volumes of polar convex bodies arxiv:math/0606305v [math.mg] 14 Jul 008 Mathieu Meyer Equipe d Analyse et de Mathématiques Appliquées Université de Marne-la-Vallée Cité Descartes 5,
More information