12 problems
If then the distance between and is defined by Let be the maximal number of un…
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…
If is a finite set of distinct points in in convex position, does determine at least distinct Euclidean distances?
For an integer , let be distinct points that are the vertices of a convex -gon. For each vertex define its number of distinct distance…
Let be a positive integer. The question is: “Let be maximal such that any points in , with no three on a line, determine at least different conv…
Let be a convex polyhedron in with vertices , and let be the number of distinct Euclidean distances determined by its vertices: … Is t…
For integers and , a finite set is in general position if no of its points lie in one affine hyperplane. A subset is in convex posit…
Let be a finite set in general position, meaning that no three points of are collinear. For an integer , a -hole in is a subset…
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 , say that is in convex position if every point of is a vertex of its convex hull. For , define the largest number of other p…
For an integer , let be the set of the distinct vertices of a convex -gon, and let count unordered pairs of distinct vertices at Euclid…
Let be a set of distinct points, and let be the distinct positive distances determined by pairs of points of . For each , define t…