Counting generalized sum-free sets
From MaRDI portal
Let \(k\), \(l\), \(n\) be nonnegative integers such that \(k\geq 4l- 1\). The authors show that the number of subsets of \(\{1,\dots, n\}\) which have no solutions to the equation \[ x_1+ x_2+\cdots+ x_k= x_1+ x_2+\cdots+ x_l \] is at most \(c2^{(k- 1)n/k}\).
Recommendations
Cites work
- Counting sets of integers, no \(k\) of which sum to another
- scientific article; zbMATH DE number 4137896 (Why is no real title available?)
- Independent sets in regular graphs and sum-free subsets of finite groups
- On sets of integers containing k elements in arithmetic progression
- On the Number of Sum-Free Sets
- Sum-free sets and related sets
Cited in
(10)- Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order
- Counting sets of integers, no \(k\) of which sum to another
- A note on the number of \((k,l)\)-sum-free sets
- Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups
- On solution-free sets of integers
- scientific article; zbMATH DE number 68287 (Why is no real title available?)
- scientific article; zbMATH DE number 895331 (Why is no real title available?)
- Asymptotics for the logarithm of the number of (k,l)-solution-free collections in an interval of naturals
- Enumerating solution-free sets in the integers
- Classifications of \(\ell\)-zero-sumfree sets
This page was built for publication: Counting generalized sum-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379641)
