Counting generalized sum-free sets

DOI10.1006/jnth.1997.2191zbMath0898.11005OpenAlexW2082980644MaRDI QIDQ1379641

Jan McDonald Thomson, Neil J. Calkin

Publication date: 2 November 1998

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1997.2191

zbMATH Keywords

generalized sum-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Related Items (6)

Classifications of $\ell$-Zero-Sumfree Sets ⋮ On solution-free sets of integers ⋮ Enumerating solution-free sets in the integers ⋮ 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

Cites Work

• Unnamed Item
• Independent sets in regular graphs and sum-free subsets of finite groups
• Sum-free sets and related sets
• Counting sets of integers, no \(k\) of which sum to another
• On the Number of Sum-Free Sets
• On sets of integers containing k elements in arithmetic progression

This page was built for publication: Counting generalized sum-free sets