Maximal sum-free sets in finite abelian groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sum-free Sets in Abelian Groups

Let A be a subset of an abelian group G with |G| = n. We say that A is sum-free if there do not exist x, y, z ∈ A with x+ y = z. We determine, for any G, the maximal density μ(G) of a sum-free subset of G. This was previously known only for certain G. We prove that the number of sum-free subsets of G is 2, which is tight up to the o-term. For certain groups, those with a small prime factor of t...

متن کامل

Counting Sum-free Sets in Abelian Groups

In this paper we study sum-free sets of order m in finite Abelian groups. We prove a general theorem about independent sets in 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting. As a consequence, we determine the typical structure and asymptotic number of sum-free sets of order m in Abelian groups G whose order ...

متن کامل

2 00 5 Large sum - free sets in abelian groups

Let A be a subset of a finite abelian group G. We say that A is sum-free if the equation x + y = z, has no solution (x, y, z) with x, y, z belonging to the set A. In this paper we shall characterise the largest possible sum-free subsets of G in case the order of G is only divisible by primes which are congruent to 1 modulo 3.

متن کامل

Asymptotic formula for sum-free sets in abelian groups

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) the sel of all sum-free subets of G and σ(G) deonotes the number n(log 2 |SF (G)|). In this article we shall improve the error term in asymptotic formula of σ(G) obtained in [GR05]. The methods used are a slight refinement of ...

متن کامل

Sum-dominant sets and restricted-sum-dominant sets in finite abelian groups

A+A = {ai + aj : ai, aj ∈ A}, A−A = {ai − aj : ai, aj ∈ A}, A +̂A = {ai + aj : ai, aj ∈ A and ai 6= aj} respectively. Here we refer to sets A with |A+A| > |A−A| as sum-dominant (some authors use the term MSTD, for more sums than differences sets). Though the fact that addition is commutative but subtraction usually is not might naively suggest that sum-dominant sets are rare if they exist at all...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1970

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s000497270004199x