相关论文: Sum-free sets in abelian groups

A set $A$ is an $(r,\ell)$-approximate group in the additive abelian group $G$ if $A$ is a nonempty subset of $G$ and there exists a subset $X$ of $G$ such that $|X| \leq \ell$ and $rA \subseteq X+A$. The set $A$ is an asymptotic…

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

We prove that |A^n| > c_n |A|^{[\frac{n+1}{2}]} for any finite subset A of a free group if A contains at least two noncommuting elements, where c_n>0 are constants not depending on A. Simple examples show that the order of these estimates…

We study notions such as finite presentability and coherence, for partially ordered abelian groups and vector spaces. Typical results are the following: (i) A partially ordered abelian group G is finitely presented if and only…

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

A set $S\subset\{1,2,...,n\}$ is called a Sidon set if all the sums $a+b~~(a,b\in S)$ are different. Let $S_n$ be the largest cardinality of the Sidon sets in $\{1,2,...,n\}$. In a former article, the author proved the following asymptotic…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The…

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in $[0,\frac{1}{3}]$, answering a question of Cameron, and that the number of those…

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

We show that if A is a finite set of integers then it has a subset S of size \log^{1+c} |A| (c>0 absolute) such that s+s' is never in A when s and s' are distinct elements of S.

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Let n be an integer, and consider finite sequences of elements of the group Z/nZ x Z/nZ. Such a sequence is called zero-sum free, if no subsequence has sum zero. It is known that the maximal length of such a zero-sum free sequence is 2n-2,…

In this paper, we study the minimal number of elements of maximal order within a zero-sumfree sequence in a finite Abelian p-group. For this purpose, in the general context of finite Abelian groups, we introduce a new number, for which…

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

Given a set $A$ of nonnegative integers, define the sum set $$A+A = \{a_i+a_j\mid a_i,a_j\in A\}$$ and the difference set $$A-A = \{a_i-a_j\mid a_i,a_j\in A\}.$$ The set $A$ is said to be sum-dominant if $|A+A|>|A-A|$. In answering a…

For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is…