In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical...
28 KB (3,414 words) - 06:13, 21 May 2024
In geometry, close-packing of equal spheres is a dense arrangement of congruent spheres in an infinite, regular arrangement (or lattice). Carl Friedrich...
19 KB (2,429 words) - 15:35, 24 September 2024
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
Sphere packing in a cylinder is a three-dimensional packing problem with the objective of packing a given number of identical spheres inside a cylinder...
28 KB (3,286 words) - 05:32, 24 September 2024
Apollonian sphere packing is the three-dimensional equivalent of the Apollonian gasket. The principle of construction is very similar: with any four spheres that...
2 KB (129 words) - 17:50, 28 July 2024
this is called sphere packing, which usually deals only with identical spheres. The branch of mathematics generally known as "circle packing" is concerned...
11 KB (1,307 words) - 12:16, 13 September 2023
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,641 words) - 03:03, 10 August 2024
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) - 21:01, 23 July 2024
Half-integer (section Sphere packing)
is an integer The densest lattice packing of unit spheres in four dimensions (called the D4 lattice) places a sphere at every point whose coordinates are...
6 KB (802 words) - 01:57, 1 October 2024
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) - 20:48, 28 December 2023
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,560 words) - 15:51, 1 October 2024
2 December 1984) is a Ukrainian mathematician known for her work in sphere packing. She is a full professor and Chair of Number Theory at the Institute...
21 KB (1,578 words) - 07:16, 25 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...
17 KB (2,135 words) - 10:26, 2 September 2024
spheres therefore must not intersect, we are faced with the problem of sphere packing. How many distinct codewords can we pack into our n {\displaystyle n}...
15 KB (2,962 words) - 11:59, 26 October 2023
Random close pack (redirect from Random close packing)
Random close packing (RCP) of spheres is an empirical parameter used to characterize the maximum volume fraction of solid objects obtained when they are...
9 KB (1,111 words) - 23:15, 28 January 2023
In geometry, sphere packing in a cube is a three-dimensional sphere packing problem with the objective of packing spheres inside a cube. It is the three-dimensional...
3 KB (428 words) - 04:49, 20 May 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,700 words) - 01:20, 19 August 2024
contributions are in the fields of combinatorics, error-correcting codes, and sphere packing. Sloane is best known for being the creator and maintainer of the On-Line...
10 KB (885 words) - 21:03, 14 September 2024
projective line O P 1 {\displaystyle \mathbf {OP} ^{1}} . 23-sphere A highly dense sphere-packing is possible in 24 {\displaystyle 24} -dimensional space...
37 KB (7,168 words) - 16:00, 27 October 2024
Sphere Napkin ring problem Orb (optics) Pseudosphere Riemann sphere Solid angle Sphere packing Spherical coordinates Spherical cow Spherical helix, tangent...
41 KB (5,327 words) - 20:13, 25 October 2024
In crystallography, atomic packing factor (APF), packing efficiency, or packing fraction is the fraction of volume in a crystal structure that is occupied...
8 KB (1,382 words) - 22:31, 2 October 2023
Hilbert's eighteenth problem (section Sphere packing)
David Hilbert. It asks three separate questions about lattices and sphere packing in Euclidean space. The first part of the problem asks whether there...
3 KB (336 words) - 09:41, 29 May 2024
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,322 words) - 09:03, 5 June 2024
the 'inspheres' of their polyhedra. Circumscribed sphere Inscribed circle Midsphere Sphere packing Coxeter, H.S.M. Regular Polytopes 3rd Edn. Dover (1973)...
3 KB (314 words) - 05:56, 20 May 2022
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) - 21:45, 21 June 2022
However, sphere packing problems can be generalised to consider unequal spheres, n-dimensional Euclidean space (where the problem becomes circle packing in...
15 KB (1,575 words) - 05:36, 16 October 2024
Tesseractic honeycomb (section Sphere packing)
honeycombs, the tesseractic honeycomb corresponds to a sphere packing of edge-length-diameter spheres centered on each vertex, or (dually) inscribed in each...
8 KB (1,031 words) - 00:34, 29 July 2024
Voronoi diagram of the face-centered cubic sphere-packing, which has the densest possible packing of equal spheres in ordinary space (see Kepler conjecture)...
7 KB (401 words) - 03:59, 24 July 2024
Dan Romik (section The sphere packing problem)
Romik published a paper simplifying Maryna Viazovska's solution to the sphere packing problem in dimension 8. Viazovska's original solution relied on computer...
9 KB (744 words) - 02:20, 29 February 2024
also lists the 18th problem as "open" in his 2000 book, because the sphere-packing problem (also known as the Kepler conjecture) was unsolved, but a solution...
41 KB (3,738 words) - 10:09, 31 October 2024