On the boundary of a finite set of points in the plane
✍ Scribed by Václav Medek
- Publisher
- Elsevier Science
- Year
- 1981
- Weight
- 485 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0146-664X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Let n k denote the number of times the kth largest distance occurs among a set S of n points. We show that if S is the set of vertices of a convex polygone in the euclidean plane, then n1+2n2~3n and n2<~n +n 1. Together with the well-known inequality n~<~n and the trivial inequalities n~>~O and n2>~
In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li