Fetching the paper…
Reading the bibliography…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings.
G.N. Watson, A Treatise on the Theory of Bessel Functions
1922
Earlier work this paper cites.
S. Bochner, Hilbert distances and positive definite functions, Annals of Mathematics
1941
Earlier work this paper cites.
C.A. Rogers, Packing and Covering
1964
Earlier work this paper cites.
R.M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations
1972
Earlier work this paper cites.
P. Delsarte, J.M. Goethals, and J.J. Seidel, Spherical codes and designs, Geometriae Dedicata
1977
Earlier work this paper cites.
R.J. McEliece, E.R. Rodemich, and H.C. Rumsey, Jr., The Lovász bound and some generalizations, Journal of Combinatorics, Information & System Sciences
1978
Earlier work this paper cites.
L. Lovász, On the Shannon capacity of a graph, IEEE Transactions on Information Theory
1979
Earlier work this paper cites.
A. Schrijver, A comparison of the Delsarte and Lovász bounds, IEEE Transactions on Information Theory
1979
Earlier work this paper cites.
M.D. Choi, T.Y. Lam, and B. Reznick, Real zeros of positive semidefinite forms I, Mathematische Zeitschrift
1980
Earlier work this paper cites.
J.B. Conway, A Course in Functional Analysis
1985
Earlier work this paper cites.
J. Kepler, Vom sechseckigen Schnee ( Strena seu de Nive sexangula
1987
Earlier work this paper cites.
N.I. Akhiezer, Lectures on Integral Transforms
1988
Earlier work this paper cites.
P. Delsarte and V.I. Levensthein, Association schemes and coding theory, IEEE Transactions on Information Theory
1988
Earlier work this paper cites.
G. Kuperberg and W. Kuperberg, Double-lattice packings of convex bodies in the place, Discrete & Computational Geometry
1990
Earlier work this paper cites.
M. Sugiura, Unitary Representations and Harmonic Analysis: An Introduction
1990
Earlier work this paper cites.
G. Fejes Tóth and W. Kuperberg, Packing and covering with convex sets, in: Handbook of convex geometry. Vol. B
1993
Earlier work this paper cites.
G.B. Folland, A Course in Abstract Harmonic Analysis
1995
Earlier work this paper cites.
G.E. Andrews, R. Askey, and R. Roy, Special Functions
1999
Cited alongside, same era.
B. Borchers, CSDP, A C Library for Semidefinite Programming, Optimization Methods and Software
1999
Cited alongside, same era.
J.H. Conway and N.J.A. Sloane, Sphere packings, lattices and groups
1999
Cited alongside, same era.
A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
2001
Cited alongside, same era.
H. Cohn and Y. Zhao, Sphere packing bounds via spherical codes, Duke Mathematical Journal
2002
Cited alongside, same era.
H. Cohn and N.D. Elkies, New upper bounds on sphere packings I, Annals of Mathematics
2003
Cited alongside, same era.
2011
Later among the works it cites.
S. Atkinson, Y. Jiao, and S. Torquato, Maximally dense packings of two-dimensional convex and concave noncircular particles, Physical Review E
2012
Later among the works it cites.
B. Casselman, Can you do better?, Feature Column of the AMS
2012
Later among the works it cites.
J.C. Lagarias and C. Zong, Mysteries in packing regular tetrahedra, Notices of the AMS
2012
Later among the works it cites.
W.A. Stein et al
2012
Later among the works it cites.
A. Bezdek and W. Kuperberg, Dense packing of space with various convex solids, in: Geometry — Intuitive, Discrete, and Convex, A Tribute to László Fejes Tóth
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry
2005
Cited alongside, same era.
T.C. Hales, A proof of the Kepler conjecture, Annals of Mathematics
2005
Cited alongside, same era.
Aristotle, On the Heavens
2006
Cited alongside, same era.
J.H. Conway and S. Torquato, Packing, tiling, and covering with tetrahedra, Proceedings of the National Academy of Sciences of the USA
2006
Cited alongside, same era.
E. Aylward, S. Itani, and P.A. Parrilo, Explicit SOS decompositions of univariate polynomial matrices and the Kalman-Yakubovich-Popov Lemma, in: Proceedings of the 46th IEEE Conference on Decision and Control
2007
Cited alongside, same era.
C. Bachoc, G. Nebe, F.M. de Oliveira Filho, and F. Vallentin, Lower bounds for measurable chromatic numbers, Geometric and Functional Analysis
2009
Cited alongside, same era.
2013
Closest in time.
D. de Laat, F.M. de Oliveira Filho, and F. Vallentin, Upper bounds for packings of spheres of several radii, Forum of Mathematics, Sigma
2014
Closest in time.
2015
Closest in time.
G. Fejes Tóth, F. Fodor, and V. Vígh, The packing density of the n n -dimensional cross-polytope, Discrete & Computational Geometry
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
2016
Closest in time.
2016
Closest in time.
2016
Closest in time.