A note on maximally repeated sub-patterns of a point set
Résumé
We answer a question raised by P. Brass on the number of maximally repeated sub-patterns in a set of $n$ points in $\mathbbR^d$. We show that this number, which was conjectured to be polynomial, is in fact $\Theta(2^n/2)$ in the worst case, regardless of the dimension $d$.