On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
From MaRDI portal
Publication:5838418
DOI10.1112/jlms/19.76_Part_4.208zbMath0061.07302WikidataQ105584118 ScholiaQ105584118MaRDI QIDQ5838418
Publication date: 1944
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://www.renyi.hu/~p_erdos/1944-02.pdf
Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Representation functions (11B34)
Related Items
New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, The number of \(B_3\)-sets of a given cardinality, An upper bound for \(B_{2}[g\) sets], Some remarks on \(B_ h[g\) sequences], An old problem of Erdős: a graph without two cycles of the same length, Infinite Sidon Sets Contained in Sparse Random Sets of Integers, On the Number ofBh-Sets, Erdős and the integers, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On Costas sets and Costas clouds, The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, Constructions of generalized Sidon sets., On strong infinite Sidon and \(B_h\) sets and random sets of integers, On strong Sidon sets of integers, On the number of generalized Sidon sets, Sum-avoiding sets in groups, Infinite Sperner's theorem, Sum of elements in finite Sidon sets
