2000 character limit reached
A note on Bourgain's slicing problem
Published 12 Dec 2024 in math.MG | (2412.09075v1)
Abstract: This note is to study Bourgain's slicing problem following the routes investigated in the last decade. We show that the slicing constant $L_n$ is bounded by $C\log(\log n) $, $n\geq 3$, for some universal constant $C$.
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.