On subset sums of zero-sum free sets of abelian groups

2019 ◽  
Vol 15 (03) ◽  
pp. 645-654 ◽  
Author(s):  
Jiangtao Peng ◽  
Wanzhen Hui ◽  
Yuanlin Li ◽  
Fang Sun

Let [Formula: see text] be a finite abelian group and [Formula: see text] be a subset of [Formula: see text]. Let [Formula: see text] denote the set of group elements which can be expressed as a sum of a nonempty subset of [Formula: see text]. We say that [Formula: see text] is zero-sum free if [Formula: see text]. In this paper, we show that if [Formula: see text] is zero-sum free with [Formula: see text], then [Formula: see text]. Furthermore, if [Formula: see text] is zero-sum free and [Formula: see text], with the assumption that the subgroup generated by [Formula: see text] is noncyclic and the order [Formula: see text], we are able to show that [Formula: see text].

10.37236/840 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Weidong Gao ◽  
Yuanlin Li ◽  
Jiangtao Peng ◽  
Fang Sun

Let $G$ be an additive finite abelian group and $S \subset G$ a subset. Let f$(S)$ denote the number of nonzero group elements which can be expressed as a sum of a nonempty subset of $S$. It is proved that if $|S|=6$ and there are no subsets of $S$ with sum zero, then f$(S)\geq 19$. Obviously, this lower bound is best possible, and thus this result gives a positive answer to an open problem proposed by R.B. Eggleton and P. Erdős in 1972. As a consequence, we prove that any zero-sum free sequence $S$ over a cyclic group $G$ of length $|S| \ge {6|G|+28\over19}$ contains some element with multiplicity at least ${6|S|-|G|+1\over17}$.


10.37236/899 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Jujuan Zhuang

Let $G=C_{n_1}\oplus \ldots \oplus C_{n_r}$ be a finite abelian group with $r=1$ or $1 < n_1|\ldots|n_r$, and let $S=(a_1,\ldots,a_t)$ be a sequence of elements in $G$. We say $S$ is an unextendible sequence if $S$ is a zero-sum free sequence and for any element $g\in G$, the sequence $Sg$ is not zero-sum free any longer. Let $L(G)=\lceil \log_2{n_1}\rceil+\ldots+\lceil \log_2{n_r}\rceil$ and $d^*(G)=\sum_{i=1}^r(n_i-1)$, in this paper we prove, among other results, that the minimal length of an unextendible sequence in $G$ is not bigger than $L(G)$, and for any integer $k$, where $L(G)\leq k \leq d^*(G)$, there exists at least one unextendible sequence of length $k$.


2009 ◽  
Vol 05 (06) ◽  
pp. 953-971 ◽  
Author(s):  
BÉLA BAJNOK

A subset A of a given finite abelian group G is called (k,l)-sum-free if the sum of k (not necessarily distinct) elements of A does not equal the sum of l (not necessarily distinct) elements of A. We are interested in finding the maximum size λk,l(G) of a (k,l)-sum-free subset in G. A (2,1)-sum-free set is simply called a sum-free set. The maximum size of a sum-free set in the cyclic group ℤn was found almost 40 years ago by Diamanda and Yap; the general case for arbitrary finite abelian groups was recently settled by Green and Ruzsa. Here we find the value of λ3,1(ℤn). More generally, a recent paper by Hamidoune and Plagne examines (k,l)-sum-free sets in G when k - l and the order of G are relatively prime; we extend their results to see what happens without this assumption.


2018 ◽  
Vol 99 (2) ◽  
pp. 184-194
Author(s):  
BÉLA BAJNOK ◽  
RYAN MATZKE

A subset$A$of a finite abelian group$G$is called$(k,l)$-sum-free if the sum of$k$(not necessarily distinct) elements of$A$never equals the sum of$l$(not necessarily distinct) elements of $A$. We find an explicit formula for the maximum size of a$(k,l)$-sum-free subset in$G$for all$k$and$l$in the case when$G$is cyclic by proving that it suffices to consider$(k,l)$-sum-free intervals in subgroups of $G$. This simplifies and extends earlier results by Hamidoune and Plagne [‘A new critical pair theorem applied to sum-free sets in abelian groups’,Comment. Math. Helv. 79(1) (2004), 183–207] and Bajnok [‘On the maximum size of a$(k,l)$-sum-free subset of an abelian group’,Int. J. Number Theory 5(6) (2009), 953–971].


10.37236/2602 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Yushuang Fan ◽  
Weidong Gao ◽  
Guoqing Wang ◽  
Qinghai Zhong ◽  
Jujuan Zhuang

Let $G$ be a finite abelian group of exponent $\exp(G)$. By $D(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a nonempty zero-sum subsequence. By $\eta(G)$ we denote the smallest integer $d\in \mathbb N$ such that every sequence over $G$ of length at least $d$ contains a zero-sum subsequence $T$ with length $|T|\in [1,\exp(G)]$, such a sequence $T$ will be called a short zero-sum sequence. Let $C_0(G)$ denote the set consists of all integer $t\in [D(G)+1,\eta(G)-1]$ such that every zero-sum sequence of length exactly $t$ contains a short zero-sum subsequence. In this paper, we investigate the question whether $C_0(G)\neq \emptyset$ for all non-cyclic finite abelian groups $G$. Previous results showed that $C_0(G)\neq \emptyset$ for the groups $C_n^2$ ($n\geq 3$) and $C_3^3$. We show that more groups including the groups $C_m\oplus C_n$ with $3\leq m\mid n$, $C_{3^a5^b}^3$, $C_{3\times 2^a}^3$, $C_{3^a}^4$ and $C_{2^b}^r$ ($b\geq 2$) have this property. We also determine $C_0(G)$ completely  for some groups including the groups of rank two, and some special groups with large exponent.


Author(s):  
Bodan Arsovski

Abstract Extending a result by Alon, Linial, and Meshulam to abelian groups, we prove that if G is a finite abelian group of exponent m and S is a sequence of elements of G such that any subsequence of S consisting of at least $$|S| - m\ln |G|$$ elements generates G, then S is an additive basis of G . We also prove that the additive span of any l generating sets of G contains a coset of a subgroup of size at least $$|G{|^{1 - c{ \in ^l}}}$$ for certain c=c(m) and $$ \in = \in (m) < 1$$ ; we use the probabilistic method to give sharper values of c(m) and $$ \in (m)$$ in the case when G is a vector space; and we give new proofs of related known results.


Author(s):  
Weidong Gao ◽  
Siao Hong ◽  
Wanzhen Hui ◽  
Xue Li ◽  
Qiuyu Yin ◽  
...  

1981 ◽  
Vol 90 (2) ◽  
pp. 273-278 ◽  
Author(s):  
C. T. Stretch

The object of this paper is to prove that for a finite abelian group G the natural map is injective, where Â(G) is the completion of the Burnside ring of G and σ0(BG) is the stable cohomotopy of the classifying space BG of G. The map â is detected by means of an M U* exponential characteristic class for permutation representations constructed in (11). The result is a generalization of a theorem of Laitinen (4) which treats elementary abelian groups using ordinary cohomology. One interesting feature of the present proof is that it makes explicit use of the universality of the formal group law of M U*. It also involves a computation of M U*(BG) in terms of the formal group law. This may be of independent interest. Since writing the paper the author has discovered that M U*(BG) has previously been calculated by Land-weber(5).


10.37236/970 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Fang Sun

Let $G$ be a finite abelian group with exponent $m$, and let $S$ be a sequence of elements in $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we show that, if $|S|=m$ and $S$ contains no nonempty subsequence with zero sum, then $f(S)\geq 2m-1$. This answers an open question formulated by Gao and Leader. They proved the same result with the restriction $(m,6)=1$.


Integers ◽  
2012 ◽  
Vol 12 (4) ◽  
Author(s):  
Weidong Gao ◽  
Linlin Wang

Abstract.Letdenote the cross number ofWe determine


Sign in / Sign up

Export Citation Format

Share Document