Crescent configurations in three dimensions
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
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality