2000 character limit reached
From simplex slicing to sharp reverse Hölder inequalities (2505.00944v1)
Published 2 May 2025 in math.MG, math.FA, and math.PR
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.