Approximability of convex bodies and volume entropy in Hilbert geometry
classification
🧮 math.MG
math.DGmath.SG
keywords
dimensionentropyapproximabilitybodyboundconvexgeometryhilbert
read the original abstract
The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three and that in higher dimension it is a lower bound of the entropy. As a corollary we solve the entropy upper bound conjecture in dimension three and give a new proof in dimension two from the one found in Berck-Bernig-Vernicos (arXiv:0810.1123v2, published).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.