International audienceWe show that the volume entropy of a Hilbert geometry on a convex body is exactly twice the flag-approximability of the body. We then show that both of these quantities are maximized in the case of the Euclidean ball. We also compute explicitly the asymptotic volume of a convex polytope, which allows us to prove that simplices have the least asymptotic volume, as was conjectured by the first author
International audienceWe survey the Hilbert geometry of convex polytopes. In particular we present t...
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) an...
International audienceWe survey the Hilbert geometry of convex polytopes. In particular we present t...
International audienceWe show that the volume entropy of a Hilbert geometry on a convex body is exac...
We show that the volume entropy of a Hilbert geometry on a convex body is exactly twice the flag-app...
Abstract. The approximability of a convex body is a number which measures the difficulty to approxim...
The aim of this paper is to provide two examples in Hilbert geometry which show that volume growth e...
Abstract. We prove that the metric balls of a Hilbert geometry admit a volume growth at least polyno...
The largest volume ratio of a given convex body K ⊂ Rn is defined as lvr(K) := sup L⊂Rn vr(K, L), wh...
It is a classic result that the expected volume difference between a convex body and a random polyto...
Abstract. It is shown that the volume entropy of a Hilbert ge-ometry associated to an n-dimensional ...
The problem of approximating convex bodies by polytopes is an important and well studied problem. Gi...
36 pages, 3 figuresWe consider the Holmes-Thompson volume of balls in the Funk geometry on the inter...
Approximating convex bodies is a fundamental question in geometry and has applications to a wide var...
International audienceWe prove that the Hilbert geometry of a product of convex sets is bi-lipschitz...
International audienceWe survey the Hilbert geometry of convex polytopes. In particular we present t...
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) an...
International audienceWe survey the Hilbert geometry of convex polytopes. In particular we present t...
International audienceWe show that the volume entropy of a Hilbert geometry on a convex body is exac...
We show that the volume entropy of a Hilbert geometry on a convex body is exactly twice the flag-app...
Abstract. The approximability of a convex body is a number which measures the difficulty to approxim...
The aim of this paper is to provide two examples in Hilbert geometry which show that volume growth e...
Abstract. We prove that the metric balls of a Hilbert geometry admit a volume growth at least polyno...
The largest volume ratio of a given convex body K ⊂ Rn is defined as lvr(K) := sup L⊂Rn vr(K, L), wh...
It is a classic result that the expected volume difference between a convex body and a random polyto...
Abstract. It is shown that the volume entropy of a Hilbert ge-ometry associated to an n-dimensional ...
The problem of approximating convex bodies by polytopes is an important and well studied problem. Gi...
36 pages, 3 figuresWe consider the Holmes-Thompson volume of balls in the Funk geometry on the inter...
Approximating convex bodies is a fundamental question in geometry and has applications to a wide var...
International audienceWe prove that the Hilbert geometry of a product of convex sets is bi-lipschitz...
International audienceWe survey the Hilbert geometry of convex polytopes. In particular we present t...
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) an...
International audienceWe survey the Hilbert geometry of convex polytopes. In particular we present t...