Counting sets of integers, no k of which sum to another
From MaRDI portal
Publication:1912293
DOI10.1006/JNTH.1996.0051zbMATH Open0860.11010OpenAlexW2474137725MaRDI QIDQ1912293FDOQ1912293
Authors: Angela C. Taylor, Neil J. Calkin 
Publication date: 24 April 1997
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jnth.1996.0051
Recommendations
Cited In (20)
- Counting generalized sum-free sets
- On the generalized antiaverage problem.
- Strongly \(k\)-sum sets in dense set
- Title not available (Why is that?)
- 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
- Counting the number of unavoidable sets of a given size in a finite set of integers
- On a generalisation of Roth's theorem for arithmetic progressions and applications to sum-free subsets
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
