Papers
Topics
Authors
Recent
Search
2000 character limit reached

From simplex slicing to sharp reverse Hölder inequalities

Published 2 May 2025 in math.MG, math.FA, and math.PR | (2505.00944v1)

Abstract: Simplex slicing (Webb, 1996) is a sharp upper bound on the volume of central hyperplane sections of the regular simplex. We extend this to sharp bounds in the probabilistic framework of negative moments, and beyond, of centred log-concave random variables, establishing a curious phase transition of the extremising distribution for new sharp reverse H\"older-type inequalities.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.