On a Problem of Sidon in Additive Number Theory, and on some Related Problems

From MaRDI portal
Publication:5838417


DOI10.1112/jlms/s1-16.4.212zbMath0061.07301WikidataQ56083332 ScholiaQ56083332MaRDI QIDQ5838417

Paul Erdős, Pál Turán

Publication date: 1941

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s1-16.4.212


11B75: Other combinatorial number theory

11B13: Additive bases, including sumsets

11B34: Representation functions


Related Items

Unnamed Item, Finding finite 𝐵₂-sequences faster, Concentration of non‐Lipschitz functions and applications, B h [ g sequences], A NOTE ON A RESULT OF RUZSA, Paul Erdős, 1913-1996, An anti-Ramsey theorem, A new upper bound for \(B_2 [2\) sets], Trigonometric series with gaps, On sums of a Sidon-sequence, An upper bound for \(B_{2}[g\) sets], A combinatorial property of points and ellipsoids, The analogue of Erdős-Turán conjecture in \(\mathbb Z_m\), \(B_ s\)-sequences, Sidon sets in groups and induced subgraphs of Cayley graphs, Estimations de produits de polynômes. (Estimates of products of polynomials), Parallelepipeds in sets of integers, Some remarks on \(B_ h[g\) sequences], A dense infinite Sidon sequence, On the combinatorial problems which I would most like to see solved, Bounds for arrays of dots with distinct slopes or lengths, On the uniform distribution in residue classes of dense sets of integers with distinct sums, Can visibility graphs be represented compactly?, On the Erdős-Turán conjecture., Generalized additive bases, König's lemma, and the Erdős--Turán conjecture, Integer sets with prescribed pairwise differences being distinct, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Minimal bases and maximal nonbases in additive number theory, On a refinement of Waring's problem, Covering non-uniform hypergraphs, Upper and lower bounds for finite \(B_h[g\) sequences.], Bases in some additive groups and the Erdős-Turán conjecture, Erdős and the integers, An upper bound for \(B_2 [2\) sequences], Largest cliques in connected supermagic graphs, Discrete radar ambiguity problems, Constructions of generalized Sidon sets., On \(B_ 2\)-sequences of vectors, An upper bound for Hilbert cubes, On Additive Bases and Harmonious Graphs