finite sphere packing concerns the question of how a finite number of equally-sized spheres can be most efficiently packed. The question of packing finitely...
16 KB (2,655 words) - 20:49, 19 June 2025
In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical...
29 KB (3,550 words) - 18:02, 7 July 2025
Sphere packing in a sphere is a three-dimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. It...
3 KB (58 words) - 00:34, 21 June 2024
which is homeomorphic to the sphere. The circle packing theorem guarantees the existence of a circle packing with finitely many circles whose intersection...
30 KB (3,857 words) - 17:30, 23 June 2025
structures offer the best lattice packing of spheres, and is believed to be the optimal of all packings. With 'simple' sphere packings in three dimensions ('simple'...
22 KB (2,676 words) - 07:08, 25 April 2025
Kakeya set (redirect from Finite field Kakeya conjecture)
conjecture could be carried over to the Euclidean case. Finite Field Kakeya Conjecture: Let F be a finite field, let K ⊆ Fn be a Kakeya set, i.e. for each vector...
30 KB (3,630 words) - 23:19, 19 June 2025
Sphere Packings, Lattices and Groups is a book about geometry and group theory by John Conway and Neil Sloane, with contributions by other mathematicians...
4 KB (436 words) - 15:13, 30 June 2025
Hamming bound (redirect from Sphere-packing bound)
block code: it is also known as the sphere-packing bound or the volume bound from an interpretation in terms of packing balls in the Hamming metric into...
9 KB (1,446 words) - 00:06, 24 June 2025
randomly pack in a finite container up to a packing fraction between 75% and 76%. In 2008, Chen was the first to propose a packing of hard, regular tetrahedra...
9 KB (1,005 words) - 18:00, 14 August 2024
Kepler conjecture (category Packing problems)
mathematical theorem about sphere packing in three-dimensional Euclidean space. It states that no arrangement of equally sized spheres filling space has a greater...
22 KB (2,721 words) - 15:39, 5 June 2025
this area include: Circle packings Sphere packings Kepler conjecture Quasicrystals Aperiodic tilings Periodic graph Finite subdivision rules Structural...
15 KB (1,575 words) - 05:36, 16 October 2024
Kissing number (redirect from Sphere kissing problem)
unit spheres that can be arranged in that space such that they each touch a common unit sphere. For a given sphere packing (arrangement of spheres) in...
18 KB (2,204 words) - 04:53, 30 June 2025
lowest maximum packing density of all centrally-symmetric convex plane sets Sphere packing problems, including the density of the densest packing in dimensions...
195 KB (20,072 words) - 22:03, 9 July 2025
defines the translative packing constant of that body. Atomic packing factor Sphere packing List of shapes with known packing constant Groemer, H. (1986)...
4 KB (555 words) - 18:24, 2 June 2025
A finite geometry is any geometric system that has only a finite number of points. The familiar Euclidean geometry is not finite, because a Euclidean line...
22 KB (2,841 words) - 13:36, 12 April 2024
Hilbert's eighteenth problem (section Sphere packing)
questions about lattices and sphere packing in Euclidean space. The first part of the problem asks whether there are only finitely many essentially different...
3 KB (336 words) - 09:41, 29 May 2024
n-dimensional spheres of a fixed radius in Rn so that no two spheres overlap. Lattice packings are special types of sphere packings where the spheres are centered...
22 KB (3,576 words) - 20:57, 19 June 2025
Steinitz's theorem (section Circle packing)
variant of the circle packing theorem, for every polyhedral graph, there exists a system of circles in the plane or on any sphere, representing the vertices...
50 KB (5,973 words) - 06:51, 27 May 2025
Block code (section Sphere packings and lattices)
\right)\right)+o\left(1\right)} Block codes are tied to the sphere packing problem which has received some attention over the years. In two dimensions...
20 KB (3,324 words) - 15:25, 28 March 2025
Crystal structure (redirect from Crystal packing)
atomic packing factor (APF). This is calculated by assuming that all the atoms are identical spheres, with a radius large enough that each sphere abuts...
46 KB (5,173 words) - 05:44, 7 July 2025
configuration for the packing of four equal spheres. The dense random packing of hard spheres problem can thus be mapped on the tetrahedral packing problem. It...
30 KB (3,809 words) - 07:09, 2 May 2025
In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges...
14 KB (2,455 words) - 22:51, 11 March 2025
unimodular lattice II25,1 plays a significant role in sphere packing problems and the classification of finite simple groups. In particular, the Leech lattice...
5 KB (611 words) - 22:45, 20 April 2025
Boerdijk–Coxeter helix (redirect from Boerdijk helical sphere packing)
ISBN 052120125X. Boerdijk, A.H. (1952). "Some remarks concerning close-packing of equal spheres". Philips Res. Rep. 7: 303–313. Fuller, R.Buckminster (1975). Applewhite...
11 KB (990 words) - 19:00, 5 June 2025
investigated the sphere packing problem. He was the first to show, in 1953, that proof of the Kepler conjecture can be reduced to a finite case analysis...
26 KB (2,552 words) - 20:58, 17 January 2025
Hyperplane Lattice Ehrhart polynomial Leech lattice Minkowski's theorem Packing Sphere packing Kepler conjecture Kissing number problem Honeycomb Andreini tessellation...
13 KB (938 words) - 15:07, 19 June 2025
contributions to group theory, the representation theory of finite groups, the geometry of numbers, sphere packing, and quadratic forms. He is the namesake of Blichfeldt's...
15 KB (1,219 words) - 10:07, 12 December 2024
Apollonian gasket (redirect from Apollonian packing)
Apollonian network, a graph derived from finite subsets of the Apollonian gasket Apollonian sphere packing, a three-dimensional generalization of the...
27 KB (2,896 words) - 20:34, 23 June 2025
Square (section Tiling and packing)
subdividing squares into unequal squares. Mathematicians have also studied packing squares as tightly as possible into other shapes. Squares can be constructed...
84 KB (8,991 words) - 18:27, 9 July 2025
contact graph of a sphere packing (a graph where vertices are the centers of spheres and edges exist if the corresponding packing elements touch each...
14 KB (1,992 words) - 00:21, 18 May 2025