Crescent configurations in three dimensions

arXiv:2610.38368 · math.CO · Submitted 2026-10-28 · Read on arXiv

math.CO

Submitted: 2026-10-28

Updated: 2026-10-28

License: http://creativecommons.org/licenses/by-sa/4.0/

The gist: A crescent configuration of n points in R d is a set in general position whose distinct pairwise distances have multiplicities 1,,n-1.

Abstract

A crescent configuration of n points in R d is a set in general position whose distinct pairwise distances have multiplicities 1,,n-1. We construct such a configuration in R cubed for every n at least3, giving a uniform bound of three for the minimum dimension. The proof uses equally spaced parameters on a short circular helix and Rolle's theorem. We also give explicit integer-coordinate configurations with O(n n) bits per coordinate, and prove that every finite initial segment of the sequence (j, j,2j) j at least0 of length at least three is a crescent configuration.

Related papers