55 problems
Let with no four points on a circle. Must there exist some with at least distinct distances to other ?
Let be an integer and . For a set of distinct points, define its set of pairwise distances by … Define … Thus is the least numbe…
Let be minimal such that every collection of points in determines at least many distinct distances. Estimate . In particular, does…
Does there exist a sequence of finite sets such that , every subset of four points of determines at least three distinct distances, and the…
If then the distance between and is defined by Let be the maximal number of un…
Let be a measurable set with no integer distances, that is, such that for any distinct…
Let be a set of size and let be the set of distinct distances determined by . Let be the number of times the distance …
Consider the triangular lattice with minimal distance between two points . Denote by the number of distances from any points . For example ,…
Let be a set such that for all , . Must there exist four points forming a…
For a finite set , let , let be the set of distances determined by unordered pairs of distinct points of , and let the multiplicity of a dista…
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?
Let and let , where the points are ordered such that Let…
Fix an integer . For a finite set , say that its pairwise distances are distinct if different unordered pairs of distinct points determine different d…
Let be positive integers, and let be the largest integer such that every set of exactly distinct points has a subset of…
For each positive integer , does Euclidean space admit a partition into countably many sets such that no positive distance occurs between two dis…
For an integer , let be a set of distinct points. For each four-point subset , call degenerate if two distinct unordered pa…
For an integer , let be a set of distinct points. For , let be the number of unordered three-point subsets of whose triangle h…
For positive integers and , and a finite set , let denote the number of unordered pairs of distinct points of at Euclidean distance . The…
Let be positive integers. For points with whenever , count the pairs at exactly the minimum allowed distance. The ext…
Let be a finite set of distinct points, with no three distinct points of collinear. Write … for the number of distinct distances determined by p…
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 and let consist of distinct points. For each unordered pair of distinct points, take its Euclidean distance, and let and…
Let be a set of size such that every subset with has . Find the best constant such that…
For a finite set , let be the set of distances between distinct points of , and for define its multiplicity by … For each positive intege…