Search Results

You are looking at 1 - 5 of 5 items for

  • Author or Editor: Vojtech Bálint x
Clear All Modify Search

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.

Restricted access

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.

Restricted access

Abstract  

Combinatorial inequalities and some of their geometrical consequences are generalized. The result of the Theorem is the best possible one.

Restricted access

We remind some old packing problems, e.g. dense packing of spheres in the more-dimensional unit cube, maximization of the area of the union of triangles packed in the circle, potato bag problems, and briefly summarize the related known results.

Restricted access