Probabilistic construction of small strongly sum-free sets via large Sidon sets
نویسندگان
چکیده
منابع مشابه
Small Maximal Sum-Free Sets
Let G be a group and S a non-empty subset of G. If ab / ∈ S for any a, b ∈ S, then S is called sum-free. We show that if S is maximal by inclusion and no proper subset generates 〈S〉 then |S| ≤ 2. We determine all groups with a maximal (by inclusion) sum-free set of size at most 2 and all of size 3 where there exists a ∈ S such that a / ∈ 〈S \ {a}〉.
متن کاملOn the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials
We derive necessary conditions related to the notions, in additive combinatorics, of Sidon sets and sum-free sets, on those exponents d ∈ Z/(2 − 1)Z which are such that F (x) = x is an APN function over F2n (which is an important cryptographic property). We study to which extent these new conditions may speed up the search for new APN exponents d. We also show a new connection between APN expon...
متن کاملLARGE SUM-FREE SETS IN Z/pZ
We show that if p is prime and A is a sum-free subset of Z/pZ with n := |A| > 0.33p, then A is contained in a dilation of the interval [n, p−n] (mod p).
متن کاملZero-sum free sets with small sum-set
Let A be a zero-sum free subset of Zn with |A| = k. We compute for k ≤ 7 the least possible size of the set of all subset-sums of A.
متن کاملSum-Free Sets and Related Sets
A set A of integers is sum-free if A\(A+A) = ;. Cameron conjectured that the number of sum-free sets A f1; : : : ; Ng is O(2 N=2). As a step towards this conjecture, we prove that the number of sets A f1
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2000
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-86-2-171-176