On the maximal density of sum-free sets
From MaRDI portal
Publication:4522646
DOI10.4064/AA-95-3-225-229zbMATH Open0962.11013OpenAlexW318240701MaRDI QIDQ4522646FDOQ4522646
Authors: Tomasz Łuczak, Tomasz Schoen 
Publication date: 2 January 2001
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/207449
Recommendations
Cited In (22)
- Long arithmetic progressions in sumsets: Thresholds and bounds
- On a question of Erdős and Moser
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Signed sums of terms of a sequence
- Bounds on the Number of Maximal Sum-Free Sets
- Appendix to `Roth's theorem on progressions revisited' by J. Bourgain
- Sumsets without powerful numbers
- On the number of primes yielding square-free sums with given numbers
- On the density of sumsets
- Subset sums avoiding quadratic nonresidues
- The upper logarithmic density of monochromatic subset sums
- Highly spare sets as additive complements for a prescribed density: an open problem
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- Weighted sums of consecutive values of a polynomial
- Sets of integers with no large sum-free subset
- A sharp bound on the number of maximal sum-free sets
- On the structure of a random sum-free set
- The size of Max\((p)\) sets and density bases.
- Blocks and progressions in subset sum sets
- An improved upper bound for the sum-free subset constant
- Maximal sum-free sets of integer lattice grids
- Structural approach to subset sum problems
This page was built for publication: On the maximal density of sum-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522646)
