Skip to main content
Springer Nature Link
Log in

On the maximum number of points at least one unit away from each other in the unit n-cube

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

We present a very short survey of known results and many new estimates and results on the maximum number of points that can be chosen in the n-dimensional unit cube so that every distance between them is at least 1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. Bálint and V. Bálint, On the number of points at distance at least 1 in the unit cube, Geombinatorics, 12 (2003), 157–166.

    MATH  MathSciNet  Google Scholar 

  2. V. Bálint and V. Bálint, Jednoznačnosť jednej optimálnej konfigurácie bodov v kocke, Proceedings of Symposium on Computer Geometry, STU, Bratislava, 2006, 8–10 (Slovak).

  3. V. Bálint and V. Bálint, Horný odhad pre rozmiestňovanie bodov v kocke, Sborník 5. konference o matematice a fyzice na VŠT, Univerzita obrany, Brno, 2007, 32–35 (Slovak).

    Google Scholar 

  4. V. Bálint and V. Bálint, Ukladanie bodov do jednotkovej kocky, Slovak Journal for Geometry and Graphics, 5:9 (2008), 5–12 (Slovak, English summary).

    Google Scholar 

  5. V. Bálint, Kombinatorická geometria-výber niektorých štrukturálnych problémov, EDIS, Žilina, 2007 (Slovak).

    Google Scholar 

  6. P. Brass, W. O. J. Moser and J. Pach, Research Problems in Discrete Geometry, Springer, New York, 2005.

    MATH  Google Scholar 

  7. G. Fejes Tóth and W. Kuperberg, Packing and covering with convex sets, Hand-book of Convex Geometry, Vol. B, North-Holland, Amsterdam-London-New York-Tokyo, 1993, 799–860.

    Google Scholar 

  8. G. A. Kabatjanskij and V. I. Levenshtein, Bounds for packings on a sphere and space, Problemy Peredachi Informacii, 14 (1978), 3–24; Problems Information Transmission, 14 (1978), 1–17.

    Google Scholar 

  9. E. MAKAI, Private communication.

  10. W. O. J. Moser and J. Pach, Research Problems in Discrete Geometry, Privately published collection of problems, McGill University, Montreal, 1994. 93–99

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Univerzitná 1, 01026, Žilina, Slovakia

    Vojtech Bálint

  2. Nám. Ľudovíta Fullu 15, 01008, Žilina, Slovakia

    Vojtech Bálint

Authors
  1. Vojtech Bálint
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Vojtech Bálint
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Vojtech Bálint.

Additional information

Communicated by Imre Bárány

Research was supported by Slovak national grant VEGA 1/3839/06.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bálint, V., Bálint, V. On the maximum number of points at least one unit away from each other in the unit n-cube. Period Math Hung 57, 83–91 (2008). https://doi.org/10.1007/s10998-008-7083-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-008-7083-2

Mathematics subject classification numbers

Key words and phrases