Asymptotic formula for sum-free sets in abelian groups

DOI10.4064/AA127-2-2zbMATH Open1127.11016arXivmath/0507259OpenAlexW1997803604MaRDI QIDQ3426727FDOQ3426727

Authors: R. Balasubramanian, Gyan Prakash 

Publication date: 13 March 2007

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. Let SF(G) denotes the set of all sum-free subets of $G$ and $sigma(G)$ denotes the number $n^{-1}(lo{g}_2|SF(G)|)$. In this article we shall improve the error term in the asymptotic formula of $sigma(G)$ which was obtained recently by Ben Green and Ruzsa. The methods used are a slight refinement of methods developed by Ben Green and Ruzsa.

Full work available at URL: https://arxiv.org/abs/math/0507259

Recommendations

• Sum-free sets in abelian groups
• Sum-free sets in Abelian groups.
• The number of sum-free sets in abelian groups
• Asymptotics of the number of sum-free sets in abelian groups of even order.
• Publication:5749346

zbMATH Keywords

sumfree sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Cited In (6)

• Sum-free sets in abelian groups
• Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order
• Sum-free subsets of finite abelian groups of type III
• Asymptotics of the logarithm of the number of \((k, l)\)-sum-free sets in an abelian group
• Asymptotics of the number of sum-free sets in groups of prime order
• Analytic number theory in India during 2001-2010

This page was built for publication: Asymptotic formula for sum-free sets in abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3426727)