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.07301OpenAlexW1968319543WikidataQ56083332 ScholiaQ56083332MaRDI QIDQ5838417
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
Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13) Representation functions (11B34)
Related Items
Upper and lower bounds on the size of $B_k[g$ sets], Problems on Two-Dimensional Synchronization Patterns, Recovering affine linearity of functions from their restrictions to affine lines, On the Number ofBh-Sets, Unnamed Item, Unnamed Item, 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], The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers, On a generalization of a theorem of Sárközy and Sós, Representation functions avoiding integers with density zero, On Additive Bases and Harmonious Graphs, B h [ g sequences], New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings, Bases in some additive groups and the Erdős-Turán conjecture, The number of \(B_3\)-sets of a given cardinality, Non-repeated cycle lengths and Sidon sequences, Can visibility graphs be represented compactly?, Parallelepipeds in sets of integers, Concentration of non‐Lipschitz functions and applications, Multiplicative Representations of Integers and Ramsey’s Theorem, Palindromic Complexity of Trees, On Sidon sets and asymptotic bases, The Generalized Rainbow Turán Problem for Cycles, Online containers for hypergraphs, with applications to linear equations, An upper bound for Hilbert cubes, Suitable Permutations, Binary Covering Arrays, and Paley Matrices, An upper bound for \(B_{2}[g\) sets], Anticoncentration and the Exact Gap-Hamming Problem, On bounded basis of integers, The Erdős–Turán Conjecture in the positive rational numbers, Some remarks on \(B_ h[g\) sequences], A note on sparse supersaturation and extremal results for linear homogeneous systems, On solution-free sets of integers, How to play hot and cold, Minkowski Complexity of Sets: An Easy Lower Bound, Hilbert’s Proof of His Irreducibility Theorem, On a question of Sárközy on gaps of product sequences, A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$, ON ADDITIVE REPRESENTATION FUNCTIONS, Information gathering in ad-hoc radio networks with tree topology, Partitions of \(\mathbb Z_m\) with the same weighted representation functions, Minimum-weight edge discriminators in hypergraphs, Complexity of tropical Schur polynomials, Sets arising as minimal additive complements in the integers, A new class of minimal asymptotic bases, Unique representation bi-basis for rational numbers field, Threshold functions and Poisson convergence for systems of equations in random sets, A combinatorial property of points and ellipsoids, A dense infinite Sidon sequence, On the Erdős-Turán conjecture., Popular differences and generalized Sidon sets, Probabilistic constructions of \(B_2[g\) sequences], On the combinatorial problems which I would most like to see solved, Erdős and the integers, \(k\)-fold Sidon sets, On additive representation functions of finite sets. I: Variation, On structural parameterizations of the bounded-degree vertex deletion problem, Structural properties of Costas arrays, An upper bound for \(B_2 [2\) sequences], Generalized additive bases, König's lemma, and the Erdős--Turán conjecture, Bounds for generalized Sidon sets, Largest cliques in connected supermagic graphs, Hypergraph containers, A compendium of results in additive number theory, Discrete radar ambiguity problems, The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints, A Numerical Note on Upper Bounds for B2[g Sets], Constructions and nonexistence results for suitable sets of permutations, Enumerating solution-free sets in the integers, Bounds for arrays of dots with distinct slopes or lengths, Embedding arbitrary finite simple graphs into small strongly regular graphs, The analogue of Erdős-Turán conjecture in \(\mathbb Z_m\), On Costas sets and Costas clouds, Finding finite 𝐵₂-sequences faster, Suitable sets of permutations, packings of triples, and Ramsey's theorem, Constructions of generalized Sidon sets., A NOTE ON A RESULT OF RUZSA, II, Integer sets with prescribed pairwise differences being distinct, On the general Erdős-Turán conjecture, Triangles of nearly equal area, On grids in point-line arrangements in the plane, Sidon sets in \(\mathbb N^d\), Parameterized Complexity of the Workflow Satisfiability Problem, On polynomial representation functions for multivariate linear forms, On strong infinite Sidon and \(B_h\) sets and random sets of integers, ON ASYMPTOTIC BASES WHICH HAVE DISTINCT SUBSET SUMS, On Grids in Point-Line Arrangements in the Plane, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, Sum-avoiding sets in groups, Infinite Sperner's theorem, Tropical Complexity, Sidon Sets, and Dynamic Programming, Inverse Problems for Representation Functions in Additive Number Theory, On \(B_ 2\)-sequences of vectors, A note on distinct distances, Sidon basis in polynomial rings over finite fields, On the uniform distribution in residue classes of dense sets of integers with distinct sums, On distinct distances among points in general position and other related problems, A Sidon basis, Minimal bases and maximal nonbases in additive number theory, On a refinement of Waring's problem, Covering non-uniform hypergraphs, Trigonometric series with gaps, \(B_ s\)-sequences, Sidon sets in groups and induced subgraphs of Cayley graphs, A GENERALIZATION OF CHEN'S THEOREM ON THE ERDŐS–TURÁN CONJECTURE, Estimations de produits de polynômes. (Estimates of products of polynomials), On sums of a Sidon-sequence, The spum and sum-diameter of graphs: labelings of sum graphs, Upper and lower bounds for finite \(B_h[g\) sequences.]
