On the maximal density of sum-free sets
From MaRDI portal
Publication:4522646
Recommendations
Cited in
(22)- An improved upper bound for the sum-free subset constant
- Appendix to `Roth's theorem on progressions revisited' by J. Bourgain
- Subset sums avoiding quadratic nonresidues
- Blocks and progressions in subset sum sets
- Long arithmetic progressions in sumsets: Thresholds and bounds
- The upper logarithmic density of monochromatic subset sums
- Maximal sum-free sets of integer lattice grids
- On the structure of a random sum-free set
- On a question of Erdős and Moser
- Sets of integers with no large sum-free subset
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sumsets without powerful numbers
- The size of Max\((p)\) sets and density bases.
- Highly spare sets as additive complements for a prescribed density: an open problem
- A sharp bound on the number of maximal sum-free sets
- Structural approach to subset sum problems
- Signed sums of terms of a sequence
- Weighted sums of consecutive values of a polynomial
- On the density of sumsets
- On the number of primes yielding square-free sums with given numbers
- Bounds on the Number of Maximal Sum-Free Sets
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)