Abstract
We give a very short survey of the results on placing of points into the unit n-dimensional cube with mutual distances at least one. The main result is that into the 5-dimensional unit cube there can be placed no more than 40 points.
Similar content being viewed by others
References
P. Brass, W. O. J. Moser and J. Pach, Research Problems in Discrete Geometry, Springer, New York, 2005.
V. Bálint, Combinatorial Geometry — a collection of some structural problems, EDIS, Zilina, 2007 (in Slovakian).
V. Bálint and V. Bálint Jr, On the number of points at distance at least 1 in the unit cube, Geombinatorics, 12 (2003), 157–166.
V. Bálint and V. Bálint Jr, Unicity of one optimal arrangement of points in the cube, Symposium on Computer Geometry, STU, Bratislava, 2006, 8–10 (in Slovakian).
V. Bálint and V. Bálint Jr, On the maximum number of points at least one unit away from each other in the unit n-cube, Period. Math. Hungar., 57 (2008), 83–91.
V. Bálint and V. Bálint Jr, Placing of points into the unit cube, Slovak Journal for Geometry and Graphics, 5 (2008), 5–12 (in Slovakian).
G. Fejes Tóth and W. Kuperberg, Packing and covering with convex sets, Handbook of Convex Geometry, Volume B, Elsevier, 1993, 799–860.
R. K. Guy, Problems, The geometry of linear and metric spaces, Lecture Notes Math. 490 (ed.: L. M. Kelly), Springer, 1975, 233–244.
A Joós, On the number of points at distance at least 1 in the 5-dimensional unit cube, microCAD 2007 International Scientific Conference, Mathematics and Computer Science, Miskolc, 2007, 41–47.
A Joós, Arrangement of points in convex bodies, PhD thesis, 2008 (in Hungarian).
G. A. Kabatjanskij and V. I. Levenshtein, Bounds for packings on a sphere and space, Problemy Peredachi Informacii (Problems of Information Transmission), 14 (1978), 3–24.
E. Makai, Private communication, 2009.
L. Moser, Problem 24 (corrected), Canad. Math. Bull., 3 (1960), 78.
L. Moser, Poorly formulated unsolved problems of combinatorial geometry, Mimeographed, 1966.
W. O. J. Moser, Problems, problems, problems, Discrete Appl. Math., 31 (1991), 201–225.
W. O. J. Moser and J. Pach, Research Problems in Discrete Geometry, Privately published collection of problems, McGill University, Montreal, 1994.
J. Schaer, On the densest packing of spheres in a cube, Canad. Math. Bull., 9 (1966), 265–270.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Imre Bárány
Supported by the Discrete and Convex Geometry project MTKD-CT-2005-01433
Rights and permissions
About this article
Cite this article
Bálint, V., Bálint, V. Placing of points into the 5-dimensional unit cube. Period Math Hung 65, 1–16 (2012). https://doi.org/10.1007/s10998-012-2275-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-012-2275-3