Duality Bounds for Convexified Packing in Hilbert Geometry
Abstract
Let and be convex bodies in , where and . Given , the Hilbert packing number is the maximum cardinality of a set of points in , each pair of which is separated by a distance of at least in the Hilbert geometry defined by . The Hilbert convexified packing number is the maximum length of a sequence of points in , 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 and denote the polar bodies, we show that there exist absolute constants such that, for every , As a direct corollary, we have 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 by to covering by . Our results represent a key step in extending the work of Artstein, Milman, Szarek, and Tomczak-Jaegermann from normed spaces to Hilbert geometries.
Keywords
Cite
@article{arxiv.2608.05533,
title = {Duality Bounds for Convexified Packing in Hilbert Geometry},
author = {Sunil Arya and David M. Mount},
journal= {arXiv preprint arXiv:2608.05533},
year = {2026}
}