Let x1, , x, be n distinct points in the plane. Denote by D(x,, ,x,) the minimum number of distinct distances determined by x1, , x,. Put f(n) = min D(x,,
On some geometrical problems of paperfolding
β Scribed by J. Justin
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 836 KB
- Volume
- 176
- Category
- Article
- ISSN
- 0373-3114
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper examines the complexity of several geometric problems due to unbounded dimension. The problems considered are: (i) minimum cover of points by unit cubes, (ii) minimum cover of points by unit ball% and (iii) minimum number of lines to hit a set of balls. Each of these problems is proven no
We consider some indeterminate moment problems which all have a discrete solution concentrated on geometric progressions of the form cq k, k E 7/ or Β± cq k, k E ~-. It turns out to be possible that such a moment problem has infinitely many solutions concentrated on the geometric progression.