C-(k,l)-SUM-FREE SETS.

The Minkowski sum of two subsets A and B of a finite abelian group G is defined as all pairwise sums of elements of A and B: A + B = {a + b: a ∈ A, b ∈ B}. The largest size of a (k, l)-sum-free set in G has been of interest for many years and in the case G = Z/nZ has recently been computed by Bajnok and Matzke. Motivated by sum-free sets of the torus, Kravitz introduces the noisyMinkowski sum of two sets, which can be thought of as discrete evaluations of these continuous sumsets. That is, given a noise set C, the noisy Minkowski sum is defined as A +C B = A + B + C. We give bounds on the maximum size of a (k, l)-sum-free subset of Z/nZ under this new sum, for C equal to an arithmetic progression with common difference relatively prime to n and for any two element set C. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Combinatorics & Number Theory is the property of Nova Science Publishers, Inc. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)