Skip to main content

The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding

  • Chapter
  • First Online:
Geometric Aspects of Functional Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 2266))

Abstract

We study the lower bound for Koldobsky’s slicing inequality. We show that there exists a measure μ and a symmetric convex body \(K \subseteq \mathbb R^n\), such that for all \(\xi \in {{\mathbb S}^{n-1}}\) and all \(t\in \mathbb R,\)

$$\displaystyle \mu ^+(K\cap (\xi ^{\perp }+t\xi ))\leq \frac {c}{\sqrt {n}}\mu (K)|K|{ }^{-\frac {1}{n}}. $$

Our bound is optimal, up to the value of the universal constant. It improves slightly upon the results of the first named author and Koldobsky, which included a doubly-logarithmic error. The proof is based on an efficient way of discretizing the unit sphere.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M. Alexander, M. Henk, A. Zvavitch, A discrete version of Koldobsky’s slicing inequality. Israel J. Math. 222(1), 261–278 (2017)

    Article  MathSciNet  Google Scholar 

  2. N. Alon, B. Klartag, Optimal compression of approximate inner products and dimension reduction, in Symposium on Foundations of Computer Science (FOCS 2017), pp. 639–650

    Google Scholar 

  3. J. Beck, Irregularities of distribution, I. Acta Math. 159(1–2), 1–49 (1987)

    Article  Google Scholar 

  4. S. Bobkov, B. Klartag, A. Koldobsly, Estimates for moments of general measures on convex bodies. Proc. Amer. Math. Soc. 146, 4879–4888 (2018)

    Article  MathSciNet  Google Scholar 

  5. J. Bourgain, On high-dimensional maximal functions associated to convex bodies. Amer. J. Math. 108, 1467–1476 (1986)

    Article  MathSciNet  Google Scholar 

  6. J. Bourgain, Geometry of Banach spaces and harmonic analysis, in Proceedings of the International Congress of Mathematicians, vol. 1, 2 (Berkeley, 1986) (American Mathematical Society, Providence, 1987), pp. 871–878

    Google Scholar 

  7. J. Bourgain, On the distribution of polynomials on high-dimensional convex sets, in Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics, vol. 1469 (Springer, Berlin, 1991), pp. 127–137

    Google Scholar 

  8. N. Frankl, A. Nagy, M. Naszodi, Coverings: variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl. Discret. Math. 341(3), 863–874 (2018)

    Article  MathSciNet  Google Scholar 

  9. A. Giannopoulos, On some vector balancing problems. Studia Math. 122, 225–234 (1997)

    Article  MathSciNet  Google Scholar 

  10. B. Klartag, On convex perturbations with a bounded isotropic constant. Geom. Funct. Anal. (GAFA) 16, 1274–1290 (2006)

    Article  MathSciNet  Google Scholar 

  11. B. Klartag, A. Koldobsky, An example related to the slicing inequality for general measures. J. Funct. Anal. 274(7), 2089–2112 (2018)

    Article  MathSciNet  Google Scholar 

  12. A. Koldobsky, A hyperplane inequality for measures of convex bodies in \(\mathbb R^n, n\leq 4\). Discrete Comput. Geom. 47, 538–547 (2012)

    Google Scholar 

  13. A. Koldobsky, A \(\sqrt {n}\) estimate for measures of hyperplane sections of convex bodies. Adv. Math. 254, 33–40 (2014)

    Google Scholar 

  14. A. Koldobsky, Slicing inequalities for measures of convex bodies. Adv. Math. 283, 473–488 (2015)

    Article  MathSciNet  Google Scholar 

  15. A. Koldobsky, A. Pajor, A remark on measures of sections of L p -balls, in Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics, vol. 2169 (Springer, Cham, 2017), pp. 213–220

    Google Scholar 

  16. A. Lytova, K. Tikhomirov, On delocalization of eigenvectors of random non-Hermitian matrices. Preprint (2018)

    Google Scholar 

  17. P. Raghavan, C.D. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365–374 (1987)

    Article  MathSciNet  Google Scholar 

  18. E. Rebrova, K. Tikhomirov, Coverings of random ellipsoids, and invertibility of matrices with i.i.d. heavy-tailed entries. Israel J. Math. 227(2), 507–544 (2018)

    Google Scholar 

  19. O. Regev, A note on Koldobsky’s lattice slicing inequality, preprint https://arxiv.org/abs/1608.04945

  20. R. Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science (Cambridge University Press, Cambridge, 2018)

    Book  Google Scholar 

Download references

Acknowledgements

The second named author is supported in part by the NSF CAREER DMS-1753260. The work was partially supported by the National Science Foundation under Grant No. DMS-1440140 while the authors were in residence at the Mathematical Sciences Research Institute in Berkeley, California, during the Fall 2017 semester. The authors are grateful to Alexander Koldobsky for fruitful discussions and helpful comments. The authors are thankful to the anonymous referee for valuable suggestions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bo’az Klartag .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Klartag, B., Livshyts, G.V. (2020). The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding. In: Klartag, B., Milman, E. (eds) Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics, vol 2266. Springer, Cham. https://doi.org/10.1007/978-3-030-46762-3_2

Download citation

Publish with us

Policies and ethics