Linear programming bounds in homogeneous spaces, I: Optimal packing density

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Wackenhuth, Maximilian
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918038227386368
author Wackenhuth, Maximilian
author_facet Wackenhuth, Maximilian
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2505_23572
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Linear programming bounds in homogeneous spaces, I: Optimal packing density
Wackenhuth, Maximilian
Metric Geometry
Group Theory
Probability
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.
title Linear programming bounds in homogeneous spaces, I: Optimal packing density
topic Metric Geometry
Group Theory
Probability
url https://arxiv.org/abs/2505.23572