On the number of sets with a given doubling constant

DOI10.1007/s11856-020-1986-zzbMath1439.05019arXiv1811.05793OpenAlexW3012130915MaRDI QIDQ2182046

Marcelo Campos

Publication date: 20 May 2020

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05793

zbMATH Keywords

sum-free setsCameron-Erdős conjecture

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Additive bases, including sumsets (11B13) Inverse problems of additive number theory, including sumsets (11P70)

Related Items (3)

On the number of sets with a given doubling constant ⋮ The Typical Approximate Structure of Sets with Bounded Sumset ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022

Cites Work

• Unnamed Item
• Hypergraph containers
• Sharp bound on the number of maximal sum-free subsets of integers
• Counting sets with small sumset and applications
• On the number of sets with a given doubling constant
• A structure theorem for sets of small popular doubling
• A Generalisation of the Theorem of Cauchy and Davenport
• THE CAMERON–ERDOS CONJECTURE
• THE METHOD OF HYPERGRAPH CONTAINERS
• Independent sets in hypergraphs
• Freiman's theorem in an arbitrary abelian group
• A refinement of the Cameron-Erdős conjecture

This page was built for publication: On the number of sets with a given doubling constant