Classification of crescent configurations

MaRDI QIDQ6279021zbMATH OpenFDO

Authors Rebecca Durst, Max Hlavacek, Chi N. Y. Huynh, Steven J. Miller, Eyvindur Ari Palsson

Publication date 25 October 2016

Abstract: Let $n$ points be in crescent configurations in $mathbb{R}^d$ if they lie in general position in $mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1leqileqn-1$ there is a distance that occurs exactly $i$ times. Since ErdH{o}s' conjecture in 1989 on the existence of $N$ sufficiently large such that no crescent configurations exist on $N$ or more points, he, Pomerance, and Pal'asti have given constructions for $n$ up to $8$ but nothing is yet known for $ngeq9$. Most recently, Burt et. al. had proven that a crescent configuration on $n$ points exists in $mathbb{R}^{n-2}$ for $ngeq3$. In this paper, we study the classification of these configurations on $4$ and $5$ points through graph isomorphism and rigidity. Our techniques, which can be generalized to higher dimensions, offer a new viewpoint on the problem through the lens of distance geometry and provide a systematic way to construct crescent configurations.

This page was built for publication: Classification of crescent configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6279021)