A crescent configuration is a set of points in Euclidean space
with exactly
distinct interpoint distances whose unordered-pair multiplicities, in some ordering,
are 1, 2, ...,
. In dimension
, the general-position convention requires no
points in a hyperplane
and no
points on a hypersphere. The
distances need not be numerically ordered by their multiplicities (Burt et al.
2016).
For planar configurations, the conditions are no three collinear points and no four concyclic points. Their existence for arbitrary is problem 217
in the Erdős problems collection.
Chen (2026) constructed three-dimensional crescent configurations for every using
where . Pairs with index difference
have squared distance
and multiplicity .
These distances increase with
,
and the configuration has no four coplanar or five cospherical
points. Integer-coordinate constructions are also supplied.
Chen (2026) reports GPT-5.5 Pro assistance in searching for the constructions.
Wang (2026) ruled out a planar crescent configuration with nine points by an exact computation over possible distance patterns. The existence of larger planar crescent configurations remains open.