A small maximal Sidon set

DOI10.1023/A:1009757824153MaRDI QIDQ1265259zbMATH OpenOpenAlexFDO

Authors Imre Z. Ruzsa

Publication date 5 May 1999

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1009757824153

zbMATH Keywords

small maximal Sidon set

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Additive bases, including sumsets (11B13) Representation functions (11B34) Other combinatorial number theory (11B75)

Review text

Eine Menge \(A\subseteq \mathbb{N}_0\) heißt Sidon-Menge, wenn alle Summen \(a+a'\) für alle \(a,a'\in A\) \((a\leq a')\) verschieden sind. Eine Sidon-Menge \(A\subset [1,N]\) heißt maximal für \(N\), wenn es keine Sidon-Menge \(A'\) gibt mit \(A\subset A'\subset [1,N]\) \((A'\neq A)\). Auf Grund einer Frage von \textit{P. Erdős, A. Sárközy} and \textit{T. Sós} [J. Number Theory 47, 329-347 (1994; Zbl 0811.11014)] wird gezeigt: Es gibt eine maximale Sidon-Menge \(A\subset [1,N]\) mit \(| A|\ll (N\log N)^{\frac 13}\).

Recommendations

• Sumsets of Sidon sets
• scientific article; zbMATH DE number 795113
• Sum of elements in finite Sidon sets

Cited in

(7)

• Maximal Sidon sets and matroids
• Sumsets of Sidon sets
• A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems
• Complete 3-term arithmetic progression free sets of small size in vector spaces and other abelian groups
• Sidon sets from Erdős and Turán to yesterday
• On sums of a Sidon-sequence

This page was built for publication: A small maximal Sidon set

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