New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
From MaRDI portal
Publication:2408217
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 -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 to , getting closer to the best known lower bound of 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.
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
Cites work
- scientific article; zbMATH DE number 3824586 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 1318047 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 1746887 (Why is no real title available?)
- scientific article; zbMATH DE number 194874 (Why is no real title available?)
- scientific article; zbMATH DE number 3367521 (Why is no real title available?)
- Algorithms in invariant theory
- An improvement to the Minkowski‐Hiawka bound for packing superballs
- Computing upper bounds for the packing density of congruent copies of a convex body
- Cube group invariant spherical harmonics and Krawtchouk polynomials
- Dense crystalline dimer packings of regular tetrahedra
- Densest lattice packings of 3-polytopes.
- Hermitian analogues of Hilbert's 17-th problem
- Invariant Semidefinite Programs
- Invariants of finite groups and their applications to combinatorics
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Mysteries in Packing Regular Tetrahedra
- New upper bounds on sphere packings. I
- On the packing densities of superballs and other bodies
- On the translative packing densities of tetrahedra and cuboctahedra
- Semidefinite Optimization and Convex Algebraic Geometry
- Sphere packing bounds via spherical codes
- Symmetry groups, semidefinite programs, and sums of squares
- The densest lattice packing of tetrahedra
- The packing density of the \(n\)-dimensional cross-polytope
- The sphere packing problem in dimension 8
- The sphere packing problem in dimension \(24\)
- Three mathematics competitions
- Universally optimal distribution of points on spheres
- Upper bound on the packing density of regular tetrahedra and octahedra
- Upper bounds for packings of spheres of several radii
- Über die dichteste gitterförmige Lagerung kongruenter Tetraeder
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
- scientific article; zbMATH DE number 2149368 (Why is no real title available?)
- Lower bound on the translative covering density of octahedra
- Computing upper bounds for the packing density of congruent copies of a convex body
- On the translative packing densities of tetrahedra and cuboctahedra
- Exact Semidefinite Programming Bounds for Packing Problems
- The poset of Specht ideals for hyperoctahedral groups
- New dense superball packings in three dimensions
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)
