Cade Sullivan

Fibonacci Fronts in Iterated Pairwise-Distance Sets

For a finite set of integers A, let D(A)=\{|x-y|:x,y\in A\} be its set of distinct pairwise distances, with distance zero included, and iterate A_{k+1}=D(A_k). We determine the complete orbit of two natural three-point families. If n\ge5 is odd and A_0=\{0,2,n\}, then before a co...