Asymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of Naturals

DOI10.1134/S1990478919020133zbMath1438.11023OpenAlexW2950717929WikidataQ127701448 ScholiaQ127701448MaRDI QIDQ4973256

Vage G. Sargsyan, Alexander A. Sapozhenko

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478919020133

zbMATH Keywords

setcharacteristic functiongroupprogressioncoset

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Cites Work

• Unnamed Item
• Asymptotics of the logarithm of the number of \((k, l)\)-sum-free sets in an abelian group
• Independent sets in regular graphs and sum-free subsets of finite groups
• Sum-free sets and related sets
• Counting generalized sum-free sets
• The number of sum-free sets in abelian groups
• 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
• A Szemerédi-type regularity lemma in abelian groups, with applications
• On the Number of Sum-Free Sets
• Solution of the Cameron-Erdös problem for groups of prime order
• THE CAMERON–ERDOS CONJECTURE
• Sharp estimates for the number of sum-free sets
• Sum-free sets in Abelian groups.