Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order
From MaRDI portal
Publication:1759154
DOI10.3103/S0278641912020045zbMath1281.11024MaRDI QIDQ1759154
Publication date: 20 November 2012
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
11B75: Other combinatorial number theory
20K01: Finite abelian groups
05A16: Asymptotic enumeration
11B34: Representation functions
Cites Work
- Unnamed Item
- Independent sets in regular graphs and sum-free subsets of finite groups
- Sum-free sets and related sets
- Counting generalized sum-free sets
- Cameron-Erdős modulo a prime
- Counting sets of integers, no \(k\) of which sum to another
- A note on the number of \((k,l)\)-sum-free sets
- Sum-free sets in abelian groups
- On (k, l)-sets in cyclic groups of odd prime order
- Counting sumsets and sum-free sets modulo a prime
- On the Number of Sum-Free Sets
- Solution of the Cameron-Erdös problem for groups of prime order
- A Generalisation of the Theorem of Cauchy and Davenport
- THE CAMERON–ERDOS CONJECTURE
- Sharp estimates for the number of sum-free sets