@MISC{Tardos01ondistinct, author = {Gábor Tardos}, title = {On Distinct Sums and Distinct Distances}, year = {2001} }

Years of Citing Articles

Bookmark

OpenURL

Abstract

The paper [10] of J. Solymosi and Cs. Toth implicitly raised the following arithmetic problem. Consider n pairwise disjoint s element sets and form all s 2 n sums of pairs of elements of the same set. What is the minimum number of distinct sums one can get this way? This paper proves a lower bound on the number of distinct sums. As an application we improve the Solymosi-Toth bound on an old Erd}os problem: the number of distinct distances n points determine in the plane. Our bound also nds applications in other related results in discrete geometry. Our bounds are proven through an involved calculation of entropies of several random variables.