12 problems
If then the distance between and is defined by Let be the maximal number of un…
If is a finite set of distinct points in in convex position, does determine at least distinct Euclidean distances?
Let be a finite set of points in whose points are in convex position. Let be the set of distances determined by pairs of points of , and…
Let distinct points form a convex polygon. Must there exist a vertex having at least distinct distances from t…
Let be maximal such that any points in , with no three on a line, determine at least different convex subsets. Estimate - in particular, does…
Let be the vertices of a convex polyhedron. Are there at least many distinct distances between the ?
For , let be the least integer such that every set of points in general position in contains points in convex position. Is…
For each , does there exist such that every set of planar points in general position contains points in convex position whose convex hull contains no other poi…
Let be the least integer such that every set of points in , with no three points collinear, contains points that are the vertices of a convex -g…
For a finite set , a point has at least equidistant points in if there exists such that at least points satisfy . Say…
If points in form a convex polygon then there are many pairs which are distance apart.
For points in the plane, let be the number of pairs at the th distinct distance. Is for every fixed and all sufficiently large ?