Abstract
We study the maximum size of Sidon sets in unions of integer intervals. If \(A\subset\mathbb{N}\) is the union of two intervals and if \( |A| =n\) (where \( |A| \) denotes the cardinality of \(A\)), we prove that \(A\) contains a Sidon set of size at least \(0,876\sqrt{n}\). On the other hand, by using the small differences technique, we establish a bound of the maximum size of Sidon sets in the union of \(k\) intervals.
Similar content being viewed by others
References
H. L. Abbott, Sidon sets, Canad. Math. Bull., 33 (1990), 335–341.
J. Balogh, Z. Füredi and S. Roy, An upper bound on the size of Sidon sets arXiv:2103.15850 (2021).
S. Chowla, Solution of a problem of Erdős and Turán in additive-number theory, Proc. Nat. Acad. Sci. India. Sect. A, 14 (1944), 1–2.
P. Erdős and P. Turán, On a problem of Sidon in additive number theory, and on some related problems, J. London Math. Soc., 16 (1941), 212–215.
H. Halberstam and K. F. Roth, Sequences, Springer-Verlag (New York–Berlin, 1983).
M. N. Huxley, On the difference between consecutive primes, Invent. Math., 15 (1972), 164–170.
A. E. Ingham, On the difference between consecutive primes, Quart. J. Math., 8 (1937), 255–266.
B. Lindström, An inequality for B2-sequences, J. Combinatorial Theory, 6 (1969), 211–212.
S. Sidon, Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier–Reihen, Math. Ann., 106 (1932), 536–539.
J. Singer, A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc., 43 (1938), 377–385.
Acknowledgements
I would like to thank A. Plagne for having introduced me to the study of Sidon sets. Also, I would like to thank A. de Roton for her help and her many advices. Finally I am grateful to the referee for careful reading and comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
RIBLET, R. SIDON SETS IN A UNION OF INTERVALS. Acta Math. Hungar. 167, 533–547 (2022). https://doi.org/10.1007/s10474-022-01246-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-022-01246-x