Counting sets of integers, no \(k\) of which sum to another

DOI10.1006/jnth.1996.0051zbMath0860.11010OpenAlexW2474137725MaRDI QIDQ1912293

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

zbMATH Keywords

number of sum-free subsets

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Related Items (5)

Counting generalized 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\)-solution-free sets in abelian groups ⋮ Asymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of Naturals ⋮ 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