Kissing numbers, sphere packings, and some unexpected proofs

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Unknown venue

• Publication date

  2004-04-20

• Fields of study

  Mathematics

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimality and uniqueness of the Leech lattice among lattices

  2004influential reference
• Kepler’s conjecture

  2004cited by this paper
• Oleg Musinの論文「The kissing number in four dimensions 」の紹介 (代数的組合せ論)

  2004cited by this paper
• The densest lattice in twenty-four dimensions

  2004cited by this paper
• Kepler's Conjecture: How Some of the Greatest Minds in History Helped Solve One of the Oldest Math Problems in the World

  2003cited by this paper
• The kissing number in four dimensions

  2003cited by this paper
• A computer verification of the Kepler conjecture

  2003cited by this paper
• The problem of the twenty-five spheres

  2003cited by this paper
• Numerical recipes in C

  2002cited by this paper
• New upper bounds on sphere packings I

  2001influential reference
• polymake: a Framework for Analyzing Convex Polytopes

  2000cited by this paper
• Cannonballs and Honeycombs

  2000cited by this paper
• Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in ℝ4

  2000cited by this paper
• The problem of the thirteen spheres

  1998influential reference
• Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions

  1998cited by this paper
• Sphere packings, I

  1998cited by this paper
• Special Functions

  1996cited by this paper
• Numerical Recipes in C: The Art of Scientific Computing

  1989cited by this paper
• Sphere Packings, Lattices and Groups

  1987cited by this paper
• Numerical Recipes in C: The Art of Sci-entific Computing

  1986cited by this paper
• Lecture Notes in Math

  1984cited by this paper
• From error-correcting codes through sphere packings to simple groups

  1983cited by this paper
• Packing and Covering in Combinatorics

  1980cited by this paper
• New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions

  1979cited by this paper
• Spherical codes and designs

  1977cited by this paper
• Proceedings of the International Congress of Mathematicians

  1975cited by this paper
• Positive definite functions on spheres

  1973influential reference
• Bounds for unrestricted codes, by linear programming

  1972cited by this paper
• Das Problem der dreizehn Kugeln

  1952cited by this paper
• Lecture Notes On

  year unknowncited by this paper

• Machine Learning on Systematically Curated Data Reveals Key Determinants of Magnetic Hyperthermia Performance.

  2026cites this paper
• The entrywise calculus and dimension-free positivity preservers, with an Appendix on sphere packings

  2025cites this paper
• p-adic Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound

  2025cites this paper
• Noncommutative Spherical Codes

  2025cites this paper
• Single-cell 3D genome reconstruction in the haploid setting using rigidity theory

  2024cites this paper
• The Tammes Problem in $\mathbb{R}^{n}$ and Linear Programming Method

  2024cites this paper
• Functional Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein-Pfender Bound

  2024cites this paper
• On Statistical Properties of a New Family of Geometric Random Graphs

  2024cites this paper
• A few remarks on intermediate subalgebras of an inclusion of C*-algebras

  2023cites this paper
• Convex Geometry

  2023cites this paper
• Tammes Problem and Contact Number for Spheres in Spaces of Constant Curvature

  2023cites this paper
• Dynamic space packing

  2023cites this paper
• Communication-Efficient Federated Learning for Resource-Constrained Edge Devices

  2023cites this paper
• Information ’ s Magic Numbers : The Numerology of Library and Information Science

  2022cites this paper
• Kissing Numbers for Balls with Varying Radii

  2022cites this paper
• Random sequential covering

  2022cites this paper
• Solving clustered low-rank semidefinite programs arising from polynomial optimization

  2022cites this paper
• Eggs With Trilobite Larvae in a Cambrian Community. Modeling the Hydrodynamics

  2021cites this paper
• On energy ground states among crystal lattice structures with prescribed bonds

  2021cites this paper
• New lower bounds on kissing numbers and spherical codes in high dimensions

  2021cites this paper
• Persistence Diagram Cardinality and its Applications

  2021cites this paper
• Method development for in situ study of marine vanadium peroxidase based on SERS and chemometrics

  2020cites this paper
• VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram

  2020cites this paper
• Kissing numbers of closed hyperbolic manifolds

  2019cites this paper
• Optimality

  2019cites this paper
• On kissing numbers and spherical codes in high dimensions

  2018cites this paper
• A stable cardinality distance for topological classification

  2018cites this paper
• University of Birmingham On kissing numbers and spherical codes in high dimensions

  2018cites this paper
• On an SDP relaxation for kissing number

  2018cites this paper
• Information ’ s Magic Numbers : The Numerology of Library and Information Science

  2018cites this paper
• Persistent Homology and the Upper Box Dimension

  2018cites this paper
• City Research Online

  2017cites this paper
• Cutting Planes for Union-Closed Families

  2017cites this paper
• La fórmula de sumación de Poisson y parientes cercanos

  2017cites this paper
• Towards a proof of the 24-cell conjecture

  2017cites this paper
• FULL-VIEW COVERAGE PROBLEMS IN CAMERA SENSOR NETWORKS

  2017cites this paper
• Mass-spectrum of Charged Leptons from the Planck Mass

  2016cites this paper
• Optimization Methods in Discrete Geometry

  2016cites this paper
• The sphere packing problem in dimension 8The sphere packing problem in dimension 8

  2016cites this paper
• The sphere packing problem in dimension 24

  2016cites this paper
• Treball final de grau GRAU DE MATEMÀTIQUES Facultat de Matemàtiques Universitat de Barcelona

  2016cites this paper
• A copositive formulation for the stability number of infinite graphs

  2016cites this paper
• Minimizing Co-location Potential of Moving Entities

  2016cites this paper
• Fluids with competing interactions. II. Validating a free energy model for equilibrium cluster size

  2016cites this paper
• Discrete Minimal Energy on Flat Tori and Four-Point Maximal Polarization on S^2

  2015cites this paper
• Coordinating services embedded everywhere via hierarchical planning

  2015cites this paper
• Face-Centered Cubic Crystallization of Atomistic Configurations

  2014cites this paper
• Euclidean graph distance matrices of generalizations of the star graph

  2014cites this paper
• The Tammes Problem for N = 14

  2014cites this paper
• Packing twelve spherical caps to maximize tangencies

  2013cites this paper
• A copositive formulation for the stability number of infinite graphs

  2013cites this paper
• Mathematics in the age of the Turing machine

  2013cites this paper
• Strong Connectivity of Wireless Sensor Networks with Double Directional Antennae in 3D

  2013cites this paper
• Illustrating Mathematics using 3D Printers

  2013cites this paper
• Quantum information and Cosmology : the connections

  2013cites this paper
• Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase

  2012cites this paper
• Interference management for multiple access relay channel in LTE-advanced using nested lattice

  2012cites this paper
• Connectivity Trade-offs in 3D Wireless Sensor Networks Using Directional Antennae

  2011cites this paper
• Extremal Betti Numbers of Vietoris–Rips Complexes

  2011cites this paper
• Nonparametric Clustering for Studying RNA Conformations

  2011cites this paper
• PARTIAL CAD I: THE LIFTING PHASE (EXTENDED TECHNICAL REPORT)

  2011cites this paper
• Kissing numbers for surfaces

  2011cites this paper
• Combined decision procedures for nonlinear arithmetics, real and complex

  2011cites this paper
• Matematyka współczesna dla myślących laików

  2011cites this paper
• Perfect Lattices in Euclidean Spaces

  2010cites this paper
• Practical Ways to Accelerate Delaunay Triangulations

  2010cites this paper
• Reverse Nearest Neighbors Search in High Dimensions using Locality-Sensitive Hashing

  2010cites this paper
• The sphere by itself: can we distribute points on it evenly?

  2010cites this paper
• The Strong Thirteen Spheres Problem

  2010cites this paper
• Topological determination of early morphogenesis in Metazoa

  2010cites this paper
• A survey on spherical designs and algebraic combinatorics on spheres

  2009cites this paper
• The revolution of 1907 – Brouwer’s dissertation

  2009cites this paper
• There are finitely many Q-polynomial association schemes with given first multiplicity at least three

  2009cites this paper
• Positive definite functions in distance geometry

  2009cites this paper
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers

  2009cites this paper
• Bounds for codes via semidefinite programming

  2009cites this paper
• The Geometry of Numbers

  2009cites this paper
• On the Low Rank Solutions for Linear Matrix Inequalities

  2008cites this paper
• PACKING OF GRANULAR MATERIALS

  2008influential citation
• Lecture notes: Semidefinite programs and harmonic analysis

  2008cites this paper
• 2 2 D ec 2 00 6 A Very Intuitive Geometric Picture of the 24-cell , E 8 and Λ 16 Lattices Given by Using the Hopf Maps

  2008cites this paper
• Coding Theory and Algebraic Combinatorics

  2008cites this paper
• Nearest-Neighbor Graphs

  2008cites this paper
• Multivariate positive definite functions on spheres

  2007influential citation
• Semidefinite programming bounds for spherical codes

  2007cites this paper
• The problem of thirteen spheres - a proof for undergraduates

  2007cites this paper
• A ug 2 00 6 NEW UPPER BOUNDS FOR KISSING NUMBERS FROM SEMIDEFINITE PROGRAMMING

  2006cites this paper
• A Very Intuitive Geometric Picture of the 24-cell, $E_8$ and $\Lambda_{16}$ Lattices Given by Using the Hopf Maps

  2006cites this paper
• Bounds for codes by semidefinite programming

  2006cites this paper
• C O ] 5 S ep 2 00 6 Bounds for Codes by Semidefinite Programming

  2006cites this paper
• New upper bounds for kissing numbers from semidefinite programming

  2006cites this paper
• 2 5 Se p 20 07 NEW UPPER BOUNDS FOR KISSING NUMBERS FROM SEMIDEFINITE PROGRAMMING

  2006cites this paper
• Sphere packings revisited

  2006cites this paper
• 17 O ct 2 00 6 NEW UPPER BOUNDS FOR KISSING NUMBERS FROM SEMIDEFINITE PROGRAMMING

  2006cites this paper
• The one-sided kissing number in four dimensions

  2005cites this paper
• On approximately symmetric informationally complete positive operator-valued measures and related systems of quantum states

  2005cites this paper
• Quantization-based semi-fragile public-key watermarking for secure image authentication

  2005cites this paper
• 2 1 A pr 2 00 5 THE KISSING NUMBER IN FOUR DIMENSIONS

  2005cites this paper
• An extension of Delsarte's method. The kissing problem in three and four dimensions

  2005cites this paper
• Sphere packings in 3-space Károly Bezdek

  2004cites this paper