Pages that link to "Item:Q5838417"

The following pages link to On a Problem of Sidon in Additive Number Theory, and on some Related Problems (Q5838417):

Displayed 40 items.

• Trigonometric series with gaps (Q796571) ‎ (← links)
• On sums of a Sidon-sequence (Q807658) ‎ (← links)
• An upper bound for \(B_{2}[g]\) sets (Q863968) ‎ (← links)
• A combinatorial property of points and ellipsoids (Q911052) ‎ (← links)
• The analogue of Erdős-Turán conjecture in \(\mathbb Z_m\) (Q954876) ‎ (← links)
• \(B_ s\)-sequences (Q1059666) ‎ (← links)
• Sidon sets in groups and induced subgraphs of Cayley graphs (Q1063041) ‎ (← links)
• Estimations de produits de polynômes. (Estimates of products of polynomials) (Q1066298) ‎ (← links)
• Parallelepipeds in sets of integers (Q1090707) ‎ (← links)
• Some remarks on \(B_ h[g]\) sequences (Q1115910) ‎ (← links)
• A dense infinite Sidon sequence (Q1159234) ‎ (← links)
• On the combinatorial problems which I would most like to see solved (Q1164626) ‎ (← links)
• Bounds for arrays of dots with distinct slopes or lengths (Q1193531) ‎ (← links)
• On the uniform distribution in residue classes of dense sets of integers with distinct sums (Q1293693) ‎ (← links)
• Can visibility graphs be represented compactly? (Q1338961) ‎ (← links)
• On the Erdős-Turán conjecture. (Q1418471) ‎ (← links)
• Generalized additive bases, König's lemma, and the Erdős--Turán conjecture (Q1434336) ‎ (← links)
• Integer sets with prescribed pairwise differences being distinct (Q1775027) ‎ (← links)
• Extremal problems for sets forming Boolean algebras and complete partite hypergraphs (Q1818218) ‎ (← links)
• Minimal bases and maximal nonbases in additive number theory (Q1845774) ‎ (← links)
• On a refinement of Waring's problem (Q1847774) ‎ (← links)
• Covering non-uniform hypergraphs (Q1850546) ‎ (← links)
• Upper and lower bounds for finite \(B_h[g]\) sequences. (Q1867418) ‎ (← links)
• Bases in some additive groups and the Erdős-Turán conjecture (Q1881687) ‎ (← links)
• Erdős and the integers (Q1961096) ‎ (← links)
• An upper bound for \(B_2 [2]\) sequences (Q1971018) ‎ (← links)
• Largest cliques in connected supermagic graphs (Q2461778) ‎ (← links)
• Discrete radar ambiguity problems (Q2465770) ‎ (← links)
• Constructions of generalized Sidon sets. (Q2490858) ‎ (← links)
• On \(B_ 2\)-sequences of vectors (Q2551781) ‎ (← links)
• An upper bound for Hilbert cubes (Q2642028) ‎ (← links)
• On Additive Bases and Harmonious Graphs (Q3964614) ‎ (← links)
• Finding finite 𝐵₂-sequences faster (Q4396456) ‎ (← links)
• (Q4487070) ‎ (← links)
• Concentration of non‐Lipschitz functions and applications (Q4537624) ‎ (← links)
• <i> B _h </i> [ <i>g</i> ] sequences (Q4786394) ‎ (← links)
• A NOTE ON A RESULT OF RUZSA (Q5387228) ‎ (← links)
• An anti-Ramsey theorem (Q5902976) ‎ (← links)
• Paul Erdős, 1913-1996 (Q5906850) ‎ (← links)
• A new upper bound for \(B_2 [2]\) sets (Q5930029) ‎ (← links)