Linear programming bounds in homogeneous spaces, I: Optimal packing density
Metric Geometry
2025-05-30 v1 Group Theory
Probability
Abstract
In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in hyperbolic space.
Cite
@article{arxiv.2505.23572,
title = {Linear programming bounds in homogeneous spaces, I: Optimal packing density},
author = {Maximilian Wackenhuth},
journal= {arXiv preprint arXiv:2505.23572},
year = {2025}
}
Comments
39 pages