A new upper bound for the size of \(s\)-distance sets in boxes (Q2300121)

The subject is related to the following distance problem by Erdős: Given \(n\) points in the plane, what is the smallest number of distinct distances they can determine? In 1946 Erdős gave some inequalities for the minimum number of these distances. \par An \(s\)-distance set is any subset \(G\) of \(n\)-dimensional Euclidean space such that the size of the set of distances among points of \(G\) (the number of distinct distances) is at most \(s\). \par In the paper, the author investigates \(s\)-distance sets in the direct product of finite sets of points (boxes) in \(n\)-dimensional Euclidean space. A new upper bound for the size of \(s\)-distance sets in boxes is given. In the proof, the author uses Tao's slice rank method.