Computing upper bounds for the packing density of congruent copies of a convex body

DOI10.1007/978-3-662-57413-3_7zbMath1423.52035arXiv1308.4893OpenAlexW2171453190MaRDI QIDQ2417583

Fernando Mário de Oliveira Filho, Frank Vallentin

Publication date: 12 June 2019

Full work available at URL: https://arxiv.org/abs/1308.4893

zbMATH Keywords

semidefinite programming\(n\)-dimensional Euclidean spacepolynomial optimizationEuclidean motion groupsphere packingsLovász theta numberDelsarte's methodmaximum densityconvex body packingpentagon packingstetrahedra packings

Mathematics Subject Classification ID

Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

The local optimality of the double lattice packing, New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry, A recursive Lovász theta number for simplex-avoiding sets, The theta number of simplicial complexes