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

DOI10.1007/S00454-017-9882-YzbMATH Open1376.52036arXiv1510.02331OpenAlexW2268390549WikidataQ110622662 ScholiaQ110622662MaRDI QIDQ2408217FDOQ2408217

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

Publication date: 10 October 2017

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

Abstract: In this paper we determine new upper bounds for the maximal density of translative packings of superballs in three dimensions (unit balls for the $l_3^p$-norm) and of Platonic and Archimedean solids having tetrahedral symmetry. Thereby, we improve Zong's recent upper bound for the maximal density of translative packings of regular tetrahedra from $0.3840ldots$ to $0.3745ldots$, getting closer to the best known lower bound of $0.3673ldots$ We apply the linear programming bound of Cohn and Elkies which originally was designed for the classical problem of densest packings of round spheres. The proofs of our new upper bounds are computational and rigorous. Our main technical contribution is the use of invariant theory of pseudo-reflection groups in polynomial optimization.

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

Recommendations

• On the translative packing densities of tetrahedra and cuboctahedra
• A computer approach to determine the densest translative tetrahedron packings
• Computing upper bounds for the packing density of congruent copies of a convex body
• A new packing density bound in 3-space
• A density bound for efficient packings of 3‐space with centrally symmetric convex bodies

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)

Cites Work

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

Cited In (13)

• A computer approach to determine the densest translative tetrahedron packings
• On parallel packing and covering of squares and cubes
• Lower Bound on Translative Covering Density of Tetrahedra
• Reflection groups and cones of sums of squares
• \(k\)-point semidefinite programming bounds for equiangular lines
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• Title not available (Why is that?)
• Lower bound on the translative covering density of octahedra
• Exact Semidefinite Programming Bounds for Packing Problems
• Computing upper bounds for the packing density of congruent copies of a convex body
• The poset of Specht ideals for hyperoctahedral groups
• On the translative packing densities of tetrahedra and cuboctahedra
• New dense superball packings in three dimensions

Uses Software

• MPFI
• SageMath
• SDPA
• kepler98

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408217)