Skip to content

Duality Bounds for Convexified Packing in Hilbert Geometry

Sunil Arya, David M. Mount

math.MGarXiv:2608.05533

Abstract

Let G and K be convex bodies in Rd, where 0 ∈ int G and G ⊂ int K. Given α> 0, the Hilbert packing number MH(G, K; α) is the maximum cardinality of a set of points in G, each pair of which is separated by a distance of at least α in the Hilbert geometry defined by K. The Hilbert convexified packing number MH(G, K; α) is the maximum length of a sequence of points in G, such that each point is separated by distance at least α from the convex hull of its predecessors. We prove a dimension-free primal-polar bound for convexified packing in Hilbert geometry. Letting G and K denote the polar bodies, we show that there exist absolute constants C, c > 0 such that, for every α> 0, \[ MH(G, K; α) ~ ≤ ~ C · MH(K, G; cα)2 MH(K, G; cα). \] As a direct corollary, we have \[ MH(G, K; α) ~ ≤ ~ C · MH(K, G; cα)3. \] Thus, the primal convexified packing number is bounded by a fixed polynomial in the ordinary packing number for the reversed polar bodies, with absolute constants independent of the dimension. This is motivated by the duality conjecture for packing and covering numbers, which relates covering G by K to covering K by G. Our results represent a key step in extending the work of Artstein, Milman, Szarek, and Tomczak-Jaegermann from normed spaces to Hilbert geometries.

Create a lesson