2000 character limit reached
Variants of a theorem of Macbeath in finite dimensional normed spaces
Published 15 Jul 2025 in math.MG | (2507.11496v1)
Abstract: A classical theorem of Macbeath states that for any integers $d \geq 2$, $n \geq d+1$, $d$-dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with $n$ vertices. In this paper we investigate normed variants of this problem: we intend to find the extremal values of the Busemann volume, Holmes-Thompson volume, Gromov's mass and Gromov's mass$*$ of a largest volume convex polytope with $n$ vertices, inscribed in the unit ball of a $d$-dimensional normed space.
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.