Counting sets of integers, no k of which sum to another
From MaRDI portal
Recommendations
Cited in
(20)- Counting generalized sum-free sets
- On the generalized antiaverage problem.
- Strongly \(k\)-sum sets in dense set
- scientific article; zbMATH DE number 4137896 (Why is no real title available?)
- On the complexity of finding and counting solution-free sets of integers
- Partitions into sum-free sets
- Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order
- Asymptotics for the logarithm of the number of \((k,l)\)-solution-free collections in an interval of naturals
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- Counting the number of unavoidable sets of a given size in a finite set of integers
- scientific article; zbMATH DE number 3886013 (Why is no real title available?)
- Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups
- On the cardinality of \(k\)-sum-avoiding subsets
- On the number and structure of sum-free sets in a segment of positive integers
- Sum-free sets of integers with a forbidden sum
- scientific article; zbMATH DE number 4181425 (Why is no real title available?)
- Full subsets of \(\mathbb N\)
- Generalized sum-free subsets
- NUMBER OF SUBSETS OF THE SET [n] INCLUDING NO TWO CONSECUTIVE ODD INTEGERS
- ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
This page was built for publication: Counting sets of integers, no \(k\) of which sum to another
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1912293)
