The nonexistence of nine-point crescent configurations
Abstract
A planar crescent configuration consists of n points, no three collinear and no four concyclic, whose distinct distances have multiplicities 1,2,…,n−1. We prove by exact computation that no such configuration exists for n=9. The three pairs carrying the two least frequent distances yield a six-point subset with at most six distances. Rational linear algebra on quartic polynomials separates the possible six-point distance patterns into those with certified finite lists of normalized distance tuples and a residual family. Compatibility of overlapping subsets forces at least one core into the first family, without classifying the residual realizations. The remaining three points are then obtained by rational constructions over the field of the squared core distances. The multiplication matrices used to enumerate the core distances have order at most twelve. Exhaustive label assignments and exact algebraic comparisons exclude all remaining extensions.
Related
- Crescent configurations in three dimensions
- Weighted configurations and the nonexistence of arithmetic ball quotient compactifications
- Long-time stability of hierarchical point vortex configurations
- Classification of Stationary Configurations of Four Identical Point Vortices
- Quasipolynomial density bounds for K-point configurations in ℤd
BibTeX
@misc{wang2026nonexistence,
title = {{The nonexistence of nine-point crescent configurations}},
author = {Yifei Wang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.03688},
eprint = {2611.03688},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.03688},
note = {CC BY-NC-SA 4.0},
}
RIS
TY - UNPB
TI - The nonexistence of nine-point crescent configurations
AU - Yifei Wang
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.03688
UR - https://arxiv.org/abs/2611.03688
AB - A planar crescent configuration consists of n points, no three collinear and no four concyclic, whose distinct distances have multiplicities 1,2,…,n−1. We prove by exact computation that no such configuration exists for n=9. The three pairs carrying the two least frequent distances yield a six-point subset with at most six distances. Rational linear algebra on quartic polynomials separates the possible six-point distance patterns into those with certified finite lists of normalized distance tuples and a residual family. Compatibility of overlapping subsets forces at least one core into the first family, without classifying the residual realizations. The remaining three points are then obtained by rational constructions over the field of the squared core distances. The multiplication matrices used to enumerate the core distances have order at most twelve. Exhaustive label assignments and exact algebraic comparisons exclude all remaining extensions.
ER -