Infinite Sidon sets contained in sparse random sets of integers

DOI10.1137/17M1114934MaRDI QIDQ4602863zbMATH OpenOpenAlexWikidataFDO

Authors Yoshiharu Kohayakawa, Sang June Lee, C. Moreira, Vojtěch Rödl

Publication date 7 February 2018

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/17m1114934

zbMATH Keywords

Sidon setrandom sets of integersuncrowded hypergraphs

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)

Recommendations

• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• The maximum size of a Sidon set contained in a sparse random set of integers
• An infinite Sidon sequence
• On strong Sidon sets of integers
• scientific article; zbMATH DE number 795113

Cites work

• scientific article; zbMATH DE number 3784967 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3103684 (Why is no real title available?)
• A dense infinite Sidon sequence
• An infinite Sidon sequence
• Arithmetic progressions of length three in subsets of a random set
• B2-Folgen und verwandte Zahlenfolgen.
• Combinatorial theorems in sparse random sets
• Combinatorial theorems relative to a random set
• Concentration of multivariate polynomials and its applications
• Counting configuration-free sets in groups
• Extremal results for random discrete structures
• Extremal uncrowded hypergraphs
• Hypergraph containers
• Independent sets in hypergraphs
• Infinite Sidon sequences
• Infinite Sidon sets contained in sparse random sets of integers
• On Certain Sets of Integers
• On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
• On sets of integers containing k elements in arithmetic progression
• On the independence number of non-uniform uncrowded hypergraphs
• On the number of \(B_h\)-sets
• On uncrowded hypergraphs
• The number of Bh‐sets of a given cardinality
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• The number of \(B_3\)-sets of a given cardinality
• The probabilistic method. With an appendix on the life and work of Paul Erdős.

Cited in

(14)

• Greedy Sidon sets for linear forms
• Representation functions avoiding integers with density zero
• Infinite Sperner's theorem
• The maximum size of a Sidon set contained in a sparse random set of integers
• On the independence number of non-uniform uncrowded hypergraphs
• On strong infinite Sidon and \(B_h\) sets and random sets of integers
• On strong Sidon sets of integers
• Infinite Sidon sets contained in sparse random sets of integers
• Random sequences of integers, Sidon sets, density in the Bohr group, and sets of analyticity.
• Existence of some sparse sets of nonstandard natural numbers
• Sidon sets for linear forms
• The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
• On Sidon sets in a random set of vectors
• No cubic integer polynomial generates a Sidon sequence

This page was built for publication: Infinite Sidon sets contained in sparse random sets of integers

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