scientific article; zbMATH DE number 1498641

DOI10.5281/ZENODO.7554449MaRDI QIDQ4500966zbMATH OpenFDO

Authors Javier Cilleruelo

Publication date 25 September 2000

Full work available at URL https://eudml.org/doc/122005

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

combinatorial number theorySidon set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Special sequences and polynomials (11B83) Well-distributed sequences and other variations (11K36)

Review text

\textit{P. Erdős} and \textit{R. Freud} [J. Number Theory 38, 196--205 (1991; Zbl 0731.11008)] proved that if a Sidon set in \([1, N]\) has \(\sim \sqrt N\) elements, that is, near the possible maximum, then it must be fairly uniformly distributed in \([1, N]\). \textit{S. W. Graham} [Proc. Conf. in honor of H. Halberstam, Birkhäuser, Prog. Math. 138, 431--449 (1996; Zbl 0859.11009)] proved an effective version. Here Graham's result is improved. An interesting corollary is that in a Sidon set in \([1, N]\) with \(\sqrt N + O(N^{1/4})\) elements, the length of a gap is at most \(O(N^{3/4})\), which is in this form best possible.

Recommendations

• scientific article; zbMATH DE number 795113
• The distribution of dense Sidon subsets of \({\mathbb Z}_m\)
• On sum sets of Sidon sets. I

Cited in

(10)

• On the complexity of constructing Golomb rulers
• Uniform dilations
• The distribution of dense Sidon subsets of \({\mathbb Z}_m\)
• Sum of elements in finite Sidon sets
• New upper bounds for finite B_h sequences
• Extremal Sidon sets are Fourier uniform, with applications to partition regularity
• A graph labeling problem
• The m-th element of a Sidon set
• An upper bound for \(B_{2}[g]\) sets
• Sidon sets in \(\mathbb N^d\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500966)