Advertisement

A Remark on Vertex Index of the Convex Bodies

  • Efim D. Gluskin
  • Alexander E. Litvak
Chapter
Part of the Lecture Notes in Mathematics book series (LNM, volume 2050)

Abstract

The vertex index of a symmetric convex body \(\mathbf{K} \subset {\mathbb{R}}^{n}\), vein(K), was introduced in [Bezdek, Litvak, Adv. Math. 215, 626–641 (2007)]. Bounds on the vertex index were given in the general case as well as for some basic examples. In this note we improve these bounds and discuss their sharpness. We show that
$$\mathrm{vein}(\mathbf{K}) \leq 24{n}^{3/2},$$
which is asymptotically sharp. We also show that the estimate
$$\frac{{n}^{3/2}} {\sqrt{2\pi e}\ \mbox{ ovr}(\mathbf{K})} \leq \mathrm{vein}(\mathbf{K}),$$
obtained in [Bezdek, Litvak, Adv. Math. 215, 626–641 (2007)] (here ovr(K) denotes the outer volume ratio of K), is not always sharp. Namely, we construct an example showing that there exists a symmetric convex body K which simultaneously has large outer volume ratio and large vertex index. Finally, we improve the constant in the latter bound for the case of the Euclidean ball from \(\sqrt{2\pi e}\) to \(\sqrt{3}\), providing a completely new approach to the problem.

Keywords

Convex Hull Convex Body Absolute Constant Logarithmic Term Euclidean Ball 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

Part of this research was conducted while the second named author participated in the Thematic Program on Asymptotic Geometric Analysis at the Fields Institute in Toronto in Fall 2010. He thanks the Institute for the hospitality. His research partially supported by the E.W.R. Steacie Memorial Fellowship.

References

  1. 1.
    K. Ball, A. Pajor, Convex bodies with few faces. Proc. Am. Math. Soc. 110, 225–231 (1990)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    I. Bárány, Z. Füredy, Approximation of the sphere by polytopes having few vertices. Proc. Am. Math. Soc. 102(3), 651–659 (1988)zbMATHCrossRefGoogle Scholar
  3. 3.
    J.D. Batson, D.A. Spielman, N. Srivastava, Twice-Ramanujan Sparsifiers. STOC’09 – Proceedings of 2009 ACM International Symposium on Theory of Computing, 255–262, ACM, New York, 2009Google Scholar
  4. 4.
    K. Bezdek, in Hadwiger-Levi’s Covering Problem Revisited, ed. by J. Pach. New Trends in Discrete and Computational Geometry. Algorithms Comb., vol. 10 (Springer, Berlin, 1993), pp. 199–233Google Scholar
  5. 5.
    K. Bezdek, The illumination conjecture and its extensions. Period. Math. Hungar. 53, 59–69 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    K. Bezdek, A.E. Litvak, On the vertex index of convex bodies. Adv. Math. 215, 626–641 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    B. Carl, A. Pajor, Gelfand numbers of operators with values in a Hilbert space. Invent. Math. 94, 479–504 (1988)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    E.D. Gluskin, Extremal properties of orthogonal parallelepipeds and their applications to the geometry of Banach spaces (Russian). Mat. Sb. (N.S.) 136(178:1), 85–96 (1988); English translation in Math. USSR-Sb. 64(1), 85–96 (1989)Google Scholar
  9. 9.
    E.D. Gluskin, A.E. Litvak, Asymmetry of convex polytopes and vertex index of symmetric convex bodies. Discrete Comput. Geom. 40, 528–536 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    F. John, in Extremum Problems with Inequalities as Subsidiary Conditions. Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948 (Interscience Publishers Inc., New York, 1948), pp. 187–204Google Scholar
  11. 11.
    H. Martini, V. Soltan, Combinatorial problems on the illumination of convex bodies. Aequationes Math. 57, 121–152 (1999)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Sackler Faculty of Exact Sciences, Department of MathematicsTel Aviv UniversityTel AvivIsrael
  2. 2.Department of Mathematical and Statistical SciencesUniversity of AlbertaEdmontonCanada

Personalised recommendations