Counting generalized sum-free sets

DOI10.1006/JNTH.1997.2191zbMATH Open0898.11005OpenAlexW2082980644MaRDI QIDQ1379641FDOQ1379641

Authors: Neil J. Calkin, Jan McDonald Thomson 

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

Recommendations

• Counting sets of integers, no \(k\) of which sum to another
• Generalized sum-free subsets
• scientific article; zbMATH DE number 895331

zbMATH Keywords

generalized sum-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Cites Work

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

Cited In (7)

• Classifications of \(\ell\)-zero-sumfree 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 solution-free sets of integers
• Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups
• Title not available (Why is that?)
• Enumerating solution-free sets in the integers

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)