Abstract :
A sequence image of integers is weak Sidon or well-spread if the sums image, for image, are all different. Let image denote the maximum integer n for which there exists a weak Sidon sequence image. Using an idea of Lindström [An inequality for image-sequences, J. Combin. Theory 6 (1969) 211–212], we offer an alternate proof that image, an inequality due to Ruzsa [Solving a linear equation in a set of integers I, Acta. Arith. 65 (1993) 259–283]. The present proof improves Ruzsaʹs bound by decreasing the implicit constant, essentially from 4 to image.
