New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry

DOI10.1007/s00454-017-9882-yzbMath1376.52036arXiv1510.02331OpenAlexW2268390549WikidataQ110622662 ScholiaQ110622662MaRDI QIDQ2408217

Fernando Mário de Oliveira Filho, Maria Dostert, Frank Vallentin, Cristóbal Guzmán

Publication date: 10 October 2017

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programminginterval arithmeticArchimedean solidsplatonic solidspseudo-reflectionssums of Hermitian squaressuperballsHilbert's 18th problemtranslative packings

Mathematics Subject Classification ID

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

Related Items (7)

\(k\)-point semidefinite programming bounds for equiangular lines ⋮ A Computer Approach to Determine the Densest Translative Tetrahedron Packings ⋮ New dense superball packings in three dimensions ⋮ Reflection groups and cones of sums of squares ⋮ The poset of Specht ideals for hyperoctahedral groups ⋮ On parallel packing and covering of squares and cubes ⋮ Exact Semidefinite Programming Bounds for Packing Problems

Uses Software

• MPFI
• SageMath
• SDPA
• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sphere packing bounds via spherical codes
• Hermitian analogues of Hilbert's 17-th problem
• Upper bound on the packing density of regular tetrahedra and octahedra
• Über die dichteste gitterförmige Lagerung kongruenter Tetraeder
• Cube group invariant spherical harmonics and Krawtchouk polynomials
• On the packing densities of superballs and other bodies
• New upper bounds on sphere packings. I
• Symmetry groups, semidefinite programs, and sums of squares
• The packing density of the \(n\)-dimensional cross-polytope
• The sphere packing problem in dimension 8
• The sphere packing problem in dimension \(24\)
• Computing upper bounds for the packing density of congruent copies of a convex body
• On the translative packing densities of tetrahedra and cuboctahedra
• Densest lattice packings of 3-polytopes.
• Motivations for an arbitrary precision interval arithmetic and the MPFI library
• Invariant Semidefinite Programs
• Universally optimal distribution of points on spheres
• An improvement to the Minkowski‐Hiawka bound for packing superballs
• Invariants of finite groups and their applications to combinatorics
• Semidefinite Optimization and Convex Algebraic Geometry
• Three Mathematics Competitions
• Mysteries in Packing Regular Tetrahedra
• Upper bounds for packings of spheres of several radii
• The densest lattice packing of tetrahedra
• Algorithms in invariant theory
• Dense crystalline dimer packings of regular tetrahedra

This page was built for publication: New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry