Citation: Rui Wang, Jiangtao Peng. On the inverse problems associated with subsequence sums of zero-sum free sequences over finite abelian groups Ⅱ[J]. AIMS Mathematics, 2021, 6(2): 1706-1714. doi: 10.3934/math.2021101
[1] | Guixin Deng, Shuxin Wang . On the Davenport constant of a two-dimensional box $\left[\kern-0.15em\left[ { - 1, 1} \right]\kern-0.15em\right] \times \left[\kern-0.15em\left[ { - m, n} \right]\kern-0.15em\right]$. AIMS Mathematics, 2021, 6(2): 1101-1109. doi: 10.3934/math.2021066 |
[2] | Yuting Hu, Jiangtao Peng, Mingrui Wang . On Modified Erdős-Ginzburg-Ziv constants of finite abelian groups. AIMS Mathematics, 2023, 8(3): 6697-6704. doi: 10.3934/math.2023339 |
[3] | Guoqing Wang . A generalization of Kruyswijk-Olson theorem on Davenport constant in commutative semigroups. AIMS Mathematics, 2020, 5(4): 2992-3001. doi: 10.3934/math.2020193 |
[4] | Premyuda Dechboon, Abubakar Adamu, Poom Kumam . A generalized Halpern-type forward-backward splitting algorithm for solving variational inclusion problems. AIMS Mathematics, 2023, 8(5): 11037-11056. doi: 10.3934/math.2023559 |
[5] | Zhao Xiaoqing, Yi Yuan . Square-free numbers in the intersection of Lehmer set and Piatetski-Shapiro sequence. AIMS Mathematics, 2024, 9(12): 33591-33609. doi: 10.3934/math.20241603 |
[6] | Sumaira Hafeez, Rashid Farooq . On generalized inverse sum indeg index and energy of graphs. AIMS Mathematics, 2020, 5(3): 2388-2411. doi: 10.3934/math.2020158 |
[7] | Yuchan Qi, Huaning Liu . Binary sequences and lattices constructed by discrete logarithms. AIMS Mathematics, 2022, 7(3): 4655-4671. doi: 10.3934/math.2022259 |
[8] | Arife Atay . Disjoint union of fuzzy soft topological spaces. AIMS Mathematics, 2023, 8(5): 10547-10557. doi: 10.3934/math.2023535 |
[9] | Natthaphon Artsawang . Accelerated preconditioning Krasnosel'skiĭ-Mann method for efficiently solving monotone inclusion problems. AIMS Mathematics, 2023, 8(12): 28398-28412. doi: 10.3934/math.20231453 |
[10] | Huafeng Liu, Rui Liu . The sum of a hybrid arithmetic function over a sparse sequence. AIMS Mathematics, 2024, 9(2): 4830-4843. doi: 10.3934/math.2024234 |
Let Cn denote the cyclic group of n elements. Every finite abelian group G can be written in the form G=Cn1⊕…⊕Cnr with 1<n1∣…∣nr. We call exp(G)=nr the exponent of G. Let ord(g) denote the order of g∈G. We consider sequences over G as elements in the free abelian monoid with basis G. So a sequence S over G can be written in the form
S=g1⋅…⋅gℓ=∏g∈Ggvg(S), |
where vg(S)∈N∪{0} denotes the multiplicity of g in S. We call |S|=ℓ=∑g∈Gvg(S)∈N∪{0} the length of S, and σ(S)=∑ℓi=1gi=∑g∈Gvg(S)g∈G the sum of S.
A sequence T is called a subsequence of S if vg(T)≤vg(S) for all g∈G. Whenever T is a subsequence of S, let ST−1 denote the subsequence with T deleted from S. If S1 and S2 are two sequences over G, let S1S2 denote the sequence satisfying that vg(S1S2)=vg(S1)+vg(S2) for all g∈G. Let
Σ(S)={σ(T)∣T is a subsequence of S with 1≤|T|≤|S|}. |
The sequence S is called
∙ a set if vg(S)≤1 for every g∈G,
∙ zero-sum if σ(S)=0∈G,
∙ zero-sum free if 0∉Σ(S),
∙ minimal zero-sum if σ(S)=0 and σ(T)≠0 for every subsequence T of S with 1≤|T|<|S|.
For an abelian group G, let D(G) denote the smallest integer ℓ∈N such that 0∈Σ(S) for every sequence S over G of length ℓ. We call D(G) the Davenport constant of G. We remark that the maximal length of zero-sum free sequence over G is D(G)−1. The Davenport constant of an abelian group G is one of the starting point of Zero-sum Theory. An interesting problem associated with Davenport constant is what can we say about S over an abelian group G if 0∉Σ(S).
In 1972, R.B. Eggleton and P. Erdős [2] first studied the problem of determining |Σ(S)| for zero-sum free sequences S of a finite abelian group. Since then, this problem attracts many authors including J.E. Olson [10], J.E. Olson and E.T. White [11], W. Gao et al. [6], A. Pixton [18], P. Yuan [23], P. Yuan and X. Zeng [24], Y. Qu et al. [19], J. Peng et al. [14] (see [3] and [15] for some recent progress).
Let G be a finite abelian group. For every positive integer r∈N, let
fG(r)=min{|Σ(S)|∣S is a zero-sum free sequence over G with length |S|=r}. |
If G contains no zero-sum free sequence of length r, we set fG(r)=∞.
The invariant fG(r) was first introduced by W. Gao and I. Leader [4]. They proved that fG(r)=r if 1≤r≤exp(G)−1 and fG(exp(G))=2exp(G)−1 provided that gcd(exp(G),6)=1. The latter result partly confirmed a case of the following conjecture stated by B. Bollobás and I. Leader in 1999 [1].
Conjecture 1.1. [1,Conjecture 6] Let G=Cn⊕Cn with n≥2 and 0≤k≤n−2 be an integer. Let {e1,e2} be a basis of G and S=en−11ek+12. Then fG(n+k)=|Σ(S)|=(k+2)n−1.
Let G=Cn1⊕…⊕Cnr with r≥2 and 1<n1∣…∣nr. In 2007, F. Sun [20] proved that fG(nr)=2nr−1, which implies that Conjecture 1.1 holds when k=0. In 2008, W. Gao et al. [6] proved that Conjecture 1.1 holds when k=1 by showing that fG(nr+1)=3nr−1 provided that nr−1≥3. They also confirmed Conjecture 1.1 when k=n−2 and generalized Conjecture 1.1 as follows.
Conjecture 1.2. [6,Conjecture 6.2] Let G=Cn1⊕…⊕Cnr with r≥2 and 1<n1∣…∣nr. Let 0≤k≤nr−1−2 be an integer. Let {e1,e2,…,er} be a basis of G with ord(ei)=ni for all i∈[1,r] and S=enr−1rek+1r−1. Then fG(nr+k)=|Σ(S)|=(k+2)nr−1.
In 2009, P. Yuan [23] proved that fG(nr+2)=4nr−1 provided that nr−1≥4, which implies that Conjecture 1.2 and also Conjecture 1.1 hold for the case when k=2. Recently, J. Peng et al. [16] confirmed Conjecture 1.2 and Conjecture 1.1 for the case when k=3 by showing that fG(nr+3)=5nr−1 provided that nr−1≥5.
The inverse problem associated with |Σ(S)| is to determine the structure of the sequence S over G with the given length such that Σ(S) archives the minimal cardinality (see [9,12,22] for more known results). Our main motivation is the following conjecture suggested by J. Peng et al. in 2020 [15].
Conjecture 1.3. [15,Conjecture 2.4] Let G=Cn1⊕…⊕Cnr be a finite abelian group with 1<n1∣…∣nr. Let k∈[0,nr−1−2] be an integer and S be a zero-sum free sequence over G of length |S|=nr+k. Then |Σ(S)|≥(k+2)nr−1, and the equality holds if and only if S has one of the following forms.
(1) ⟨S⟩≅Ck+2⊕Cnr, where k+2∣nr;
(2) S=gnr−1⋅(h+t1g)⋅…⋅(h+tk+1g), where g,h∈G with ord(g)=nr, ih∉⟨g⟩ for every i∈[1,k+1], and t1,…,tk+1∈[0,nr−1] are integers.
Conjecture 1.3 has been verified for the following cases
1. k=0,1; [15,Theorem 2.3]
2. G=Cn⊕Cn and k=n−3; [21,Theorem 1.3]
3. G=Cn⊕Cnm and k=n−3; [13,Theorem 1.5]
4. vg(S)≥nr−1 for some elements g∈G; [13,Theorem 1.4]
5. G=Cp⊕Cp. [17,Theorem 1.5]
In this paper we prove the following results.
Theorem 1.4. Let G=Cn1⊕Cn2 be a finite abelian group with 1<n1∣n2. Let k∈[0,n1−2] be a positive integer and S=S1S2 be a zero-sum free sequence over G of length |S|=n2+k, where N=⟨S1⟩ is a cyclic subetaoup of G. Let φ:G→G/N denote the canonical epimorphism. Suppose
|S1|≥k+1,andq=|{¯0}∪Σ(φ(S2))|>|S2|. |
Then |Σ(S)|≥(k+2)n2−1. Moreover, the equality holds if and only if S has one of the following forms:
(1) ⟨S⟩≅Ck+2⊕Cn2, where k+2∣n2;
(2) There exist g,h∈G such that S=gn2−1⋅(h+t1g)⋅…⋅(h+tk+1g), where ord(g)=n2, ih∉⟨g⟩ for i∈[1,k+1], and t1,t2,…,tk+1∈[0,n2−1] are integers.
Theorem 1.5. Conjecture 1.3 is true when k=2.
The paper is organized as follows. Section 2 provides some preliminary results. In Section 3 we prove our main results. In the last section, we give some further results.
We provide some preliminary results in this section, beginning with the famous Davenport constant.
Lemma 2.1. [8,Theorem 5.8.3] Let G=Cn1⊕Cn2 with 1≤n1∣n2. Then D(G)=n1+n2−1.
Next five lemmas provide a few results on |Σ(S)| for zero-sum free sequence S.
Lemma 2.2. [15,Lemma 3.7] Let G be a finite abelian group and let S be a zero-sum free sequence over G. Then |Σ(S)|≥|S| and the equality holds if and only if S=g|S| for some g∈G with ord(g)≥|S|+1.
Lemma 2.3. [18,Theorem 1.7] Let G be a finite abelian group and S be a zero-sum free sequence of G. Suppose the subetaoup generated by S is of rank greater than 2. Then |Σ(S)|≥4|S|−5.
Lemma 2.4. [16,Theorem 1.1] Let G be a finite abelian group and S be a zero-sum free sequence over G of length |S|≥5. Suppose
(i) ⟨S⟩≅Cn1⊕…⊕Cnr with r≥2, 1<n1∣n2∣…∣nr, and n1⋅…⋅nr−1≥6.
(ii) |Σ(φH(S))∪{¯0}|≥5 for every cyclic subetaoup H of G, where φH:G→G/H denotes the canonical epimorphism.
Then |Σ(S)|≥5|S|−16.
Lemma 2.5. [13,Theorem 1.4] Conjecture 1.3 is true when vg(S)≥nr−1 for some g∈G.
Lemma 2.6. [13,Theorem 1.5] Conjecture 1.3 is true when G=Cn⊕Cnm with k=n−3.
We also need the following technical results.
Lemma 2.7. [6,Lemma 3.1] Let G be a finite abelian group and A be a finite nonempty subset of G. Let r∈N, y1,…yr∈G and k=min{ord(yi)∣i∈[1,r]}. Then |Σ(0y1⋅…⋅yr)+A|≥min{k,r+|A|}.
Lemma 2.8. [15,Lemma 3.14] Let G be a finite abelian group and S=S1S2 be a zero-sum free sequence over G. Let H=⟨S1⟩ and φ:G→G/H denote the canonical epimorphism. Suppose q=|{¯0}∪Σ(φ(S2))|. Then
(1) |Σ(S1S2)|≥q|Σ(S1)|+q−1;
(2) If φ(S2) is not zero-sum free, then |Σ(S1S2)|≥q(|Σ(S1)|+1).
Lemma 2.9. [15,Lemma 4.2] Let G=Cn1⊕…⊕Cnr be a finite abelian group with 1<n1∣…∣nr and S be a zero-sum free sequence over G with |S|≥nr. Then
(1) ⟨S⟩ is not cyclic;
(2) If |S|=nr+k and ⟨S⟩≅Cm1⊕Cm2 where 1<m1∣m2, then m2=nr and m1≥k+2.
The following lemma states a result on the inverse problems of |Σ(S)| when S is not zero-sum free.
Lemma 2.10. [16,Lemma 3.1] Let G be a finite abelian group and S=b1⋅…⋅bw be a sequence over G. Suppose bi≠0 for every i∈[1,w] and |S|=w≥4=|{0}∪Σ(S)|. Then either ⟨S⟩≅C4 or ⟨S⟩≅C2⊕C2 or S=gw−11g2, where ord(g1)=2 and g1≠g2.
We prove our main results in this section.
Proof. If S is of form (1) or of form (2), it is easy to verify that |Σ(S)|=(k+2)n2−1.
Next we assume that S is a zero-sum free sequence over G such that |S|=n2+k. Since N is a cyclic subetaoup of G and S1 is zero-sum free, we infer that k+1≤|S1|≤|N|−1≤n2−1. It follows from Lemma 2.8 (1) and Lemma 2.2 that
|Σ(S)|≥q|Σ(S1)|+q−1≥(|S2|+1)|S1|+|S2|=(|S2|+1)(|S1|+1)−1=(n2+k−|S1|+1)(|S1|+1)−1≥(k+2)n2−1. |
This proves the inequality.
If |Σ(S)|=(k+2)n2−1, the above inequality forces that
(a1) |Σ(S1)|=|S1| and |S2|=q−1.
(a2) |S1|=k+1 or |S1|=n2−1.
Since S1 is a zero-sum free sequence over G, it follows from (a1) and Lemma 2.2 that S1=g|S1| for some g∈G with ord(g)≥|S1|+1. If |S1|=n2−1, then vg(S)=n2−1, the result follows from Lemma 2.5. So we may assume that
|S1|=k+1<n2−1. |
So |S2|=|S|−|S1|=n2+k−(k+1)=n2−1 and thus q=n2.
If φ(S2) is not a zero-sum free sequence over G/N, then it follows from Lemma 2.8 (2) and Lemma 2.2 that
|Σ(S)|≥q(|Σ(S1)+1)≥(|S2|+1)(|S1|+1)=(k+2)n2, |
yielding a contradiction. Therefore,
φ(S2) is a zero-sum free sequence over G/N. |
Since |{¯0}∪Σ(φ(S2))|=q=|S2|+1. Then |Σ(φ(S2))|=q−1=|S2|. It follows from Lemma 2.2 that φ(S2)=¯h|S2|, where h∈G∖N and ord(¯h)≥|S2|+1=n2. Since ord(¯h)∣n2=exp(G), we have that ord(¯h)=n2. Therefore, S2 is of the following form
S2=(h+t1g)⋅(h+t2g)⋅…⋅(h+t|S2|g), |
where ti∈[0,ord(g)−1] for i=1,2,…,|S2| and ord(¯h)=n2. Moreover, we have that ih∉⟨g⟩ for every i∈[1,n2−1].
If ord(g)=k+2, then k+2∣n2 and ⟨S⟩≅⟨g,h⟩≅Ck+2⊕Cn2. So S is of form (1), and we are done.
Next we assume that ord(g)>k+2. Then n2≥ord(g)>k+2 and |S2|=n2−1≥k+2.
We will show that t1=t2=…=tn2−1. Suppose t1≠t2. Then
ih+(i+1∑j=3tj)g+{t1g,t2g}⊂Σ(S2)∩(ih+⟨g⟩), |
for every i∈[1,n2−2]. It follows from Lemma 2.7 that
|Σ(S)∩(ih+N)|≥|(Σ(S2)∩(ih+N))+Σ(0S1)|≥|ih+(i+1∑j=3tj)g+{t1g,t2g}+{0,g,2g,…,(k+1)g}|≥k+3, |
for every 1≤i≤n2−2. Similarly,
|Σ(S)∩((n2−1)h+N)|≥|(Σ(S2)∩((n2−1)h+N))+Σ(0S1)|≥|(n2−1)h+(n2−1∑j=1tj)g+{0,g,2g,…,(k+1)g}|≥k+2. |
Note that |Σ(S)∩N|≥|{g,2g,…,(k+1)g}|=k+1 and
Σ(S)=∪n2−1i=0Σ(S)∩(ih+N). |
Therefore,
|Σ(S)|≥n2−1∑i=0|Σ(S)∩(ih+N)|≥(k+1)+(k+3)(n2−2)+(k+2)=(k+3)n2−3>(k+2)n2−1, |
yielding a contradiction. So t1=t2. Moreover we obtain that t1=t2=…=tn2−1 and thus S2=(h+t1g)n2−1.
Let g1=h+t1g and h1=g. Then S=gn2−11hk+11 is of form (2), and we are done.
Proof. Let G=Cn1⊕…⊕Cnr be a finite abelian group with 1<n1∣…∣nr. Let S be a zero-sum free sequence over G of length |S|=nr+2. By Lemma 2.9 (1) we obtain that ⟨S⟩ is not cyclic and thus r≥2.
If S is of form (1) or of form (2) in Conjecture 1.3, it is easy to check that |Σ(S)|=4nr−1.
Next we assume that |Σ(S)|=4nr−1, we will show that S is of form (1) or (2).
We first show that r=2. If r≥3, by Lemma 2.3, we infer that |Σ(S)|≥4|S|−5=4(nr+2)−5=4nr+3>4nr−1, yielding a contradiction. Hence r=2.
Suppose ⟨S⟩≅Cm1⊕Cm2 with 1<m1∣m2. Since |S|=nr+2, by Lemma 2.9 (3) we infer that m2=nr and m1≥4. Therefore, |S|=nr+2=m2+2≥m1+2≥6.
If m1=4, we obtain that S is of form (1), and we are done.
If m1=5, by Lemma 2.1 we infer that |S|=nr+2=m1+m2−3=D(Cm1⊕Cm2)−2. It follows from Lemma 2.6 that S is of form (2), and we are done.
Next we assume that m1≥6. Then nr=m2≥m1≥6. We will show that
|Σ(φH(S))∪{¯0}|≤4 |
for some cyclic subetaoup H of G, where φH:G→G/H denotes the canonical epimorphism. Assume to the contrary that |Σ(φH(S))∪{¯0}|≥5 for every cyclic subetaoup H of G. By Lemma 2.4, we infer that 4nr−1=|Σ(S)|≥5|S|−16=5(nr+2)−16=5nr−6. It follows that nr≤5, yielding a contradiction. Hence |Σ(φH(S))∪{¯0}|≤4 for some cyclic subetaoup H of G.
Suppose q=|Σ(φH(S))∪{¯0}| and Σ(φH(S))∪{¯0}={¯0,¯a1,…,¯aq−1} for some a1,a2,…,aq−1∈G. It is clear that
Σ(S)⊂H∪(a1+H)∪…∪(aq−1+H). |
Since H is a cyclic subetaoup of G, we infer that |H|≤nr. It follows from |Σ(S)|=4nr−1 and q≤4 that q=4 and |H|=nr. Moreover, since S is zero-sum free, we infer that
Σ(S)=(H∖{0})∪(a1+H)∪(a2+H)∪(a3+H). |
Now we can write S=S1S2, where S1 is the subsequence of S that consisting all elements of H, and none elements of S2 is in H. If
|S1|≥3, and 4=|{¯0}∪Σ(φ(S2))|>|S2|, |
applying Theorem 1.4 with k=2, we infer that S is of form (1) or (2), and we are done. So we may assume that
either |S1|≤2, or 4=|{¯0}∪Σ(φ(S2))|≤|S2|. |
Noting that |S|=nr+2≥6+2=8. If |S1|≤2, then |S2|≥6>4=|{¯0}∪Σ(φ(S2))|. Hence, it remains to consider the case
4=|{¯0}∪Σ(φ(S2))|≤|S2|. |
By Lemma 2.10, we infer that ⟨φ(S2)⟩≅C4, or ⟨φ(S2)⟩≅C2⊕C2, or φ(S2)=¯b1|S2|−1¯b2, for some terms b1,b2 from S with ord(¯b1)=2 and ¯b1≠¯b2.
If ⟨φ(S2)⟩≅C4, we obtain that ⟨S⟩≅C4⊕Cnr, yielding a contradiction to that ⟨S⟩≅Cm1⊕Cm2 with m1≥6. If ⟨φ(S2)⟩≅C2⊕C2, we obtain that ⟨S⟩≅C2⊕C2⊕Cnr, yielding a contradiction to that ⟨S⟩ is of rank 2. If φ(S2)=¯b1|S2|−1¯b2, for some terms b1,b2 from S with ord(¯b1)=2 and ¯b1≠¯b2, then ⟨Sb−12⟩≅C2⊕Cnr. So Sb−12 is a zero-sum free sequence of length |Sb−12|=nr+1 over C2⊕Cnr. By Lemma 2.1, we infer that D(C2⊕Cnr)=2+nr−1=nr+1=|Sb−12|, yielding a contradiction to that Sb−12 is zero-sum free.
This completes the proof.
In 2008, W. Gao et al. [6] confirmed Conjecture 1.1 when k=n−2 by using the following result.
Lemma 4.1. [8,Proposition 5.1.4] Let G be a finite abelian group and S be a zero-sum free sequence over G with |S|=D(G)−1. Then |Σ(S)|=|G|−1.
Moreover, we have the following results.
Theorem 4.2. Both Conjecture 1.2 and Conjecture 1.3 are true when G=Cn⊕Cnm with k=n−2.
Proof. It follows from Lemma 2.1 and Lemma 4.1 immediately.
We would like to thank the referees for their very carefully reading and very useful suggestions. This research was supported in part by the Fundamental Research Funds for the Central Universities (No. 3122019152).
The authors declare no conflict of interest in this paper.
[1] |
B. Bollobás, I. Leader, The number of k-sums modulo k, J. Number Theory, 78 (1999), 27-35. doi: 10.1006/jnth.1999.2405
![]() |
[2] |
R. B. Eggletőn, P. Erdos, Two combinatorial problems in group theory, Acta Arith., 21 (1972), 111-116. doi: 10.4064/aa-21-1-111-116
![]() |
[3] |
W. Gao, M. Huang, W. Hui, Y. Li, C. Liu, J. Peng, Sums of sets of abelian group elements, J. Number Theory, 208 (2020), 208-229. doi: 10.1016/j.jnt.2019.07.026
![]() |
[4] |
W. Gao, I. Leader, Sums and k-sums in an abelian groups of order k, J. Number Theory, 120 (2006), 26-32. doi: 10.1016/j.jnt.2005.11.010
![]() |
[5] |
W. Gao, Y. Li, J. Peng, F. Sun, Subsums of a Zero-sum Free Subset of an Abelian Group, Electron. J. Combin., 15 (2008), R116. doi: 10.37236/840
![]() |
[6] |
W. Gao, Y. Li, J. Peng, F. Sun, On subsequence sums of a zero-sum free sequence Ⅱ, Electron. J. Combin., 15 (2008), R117. doi: 10.37236/841
![]() |
[7] |
A. Geroldinger, D. J. Grynkiewicz, The large Davenport constant I: Groups with a cyclic, index 2 subgroup, J. Pure Appl. Algebra, 217 (2013), 863-885. doi: 10.1016/j.jpaa.2012.09.004
![]() |
[8] | A. Geroldinger, F. Halter-Koch, Non-Unique Factorizations. Algebraic, Combinatorial and Analytic Theory, Pure and Applied Mathematics, Chapman & Hall/CRC, 2006, vol. 278, p700. |
[9] | H. Guan, X. Zeng, P. Yuan, Description of invariant F(5) of a zero-sum free sequence, Acta Sci. Natur. Univ. Sunyatseni, 49 (2010), 1-4 (In Chinese). |
[10] |
J. E. Olson, Sums of sets of group elements, Acta Arith., 28 (1975), 147-156. doi: 10.4064/aa-28-2-147-156
![]() |
[11] | J. E. Olson, E. T. White, Sums from a sequence of group elements, Number Theory and Algebra (H. Zassenhaus, ed.), Academic Press, 1977,215-222. |
[12] | J. Peng, W. Hui, On the structure of zero-sum free set with minimum subset sums in abelian groups, Ars Combin., 146 (2019), 63-74. |
[13] | J. Peng, W. Hui, on subsequence sums of zero-sum free sequences in abelian groups of rank two. JP J. Algebra, Number Theory Appl., 48 (2020), 133-153. |
[14] |
J. Peng, W. Hui, Y. Li, F. Sun, On subset sums of zero-sum free sets of abelian groups. Int. J. Number Theory, 15 (2019), 645-654. doi: 10.1142/S1793042119500349
![]() |
[15] |
J. Peng, Y. Li, C. Liu, M. Huang, On the inverse problems associated with subsequence sums of zero-sum free sequences over finite abelian groups, Colloq. Math., 163 (2021), 317-332. doi: 10.4064/cm8033-12-2019
![]() |
[16] |
J. Peng, Y. Li, C. Liu, M. Huang, On subsequence sums of a zero-sum free sequence over finite abelian groups, J. Number Theory, 217 (2020), 193-217. doi: 10.1016/j.jnt.2020.04.024
![]() |
[17] |
J. Peng, Y. Qu, Y. Li, On the inverse problems associated with subsequence sums in Cp⊕Cp, Front. Math. China, 15 (2020), 985-1000. doi: 10.1007/s11464-020-0869-2
![]() |
[18] |
A. Pixton, Sequences with small subsums sets, J. Number Theory, 129 (2009), 806-817. doi: 10.1016/j.jnt.2008.12.004
![]() |
[19] |
Y. Qu, X. Xia, L. Xue, Q. Zhong, Subsequence sums of zero-sum free sequences over finite abelian groups, Colloq. Math., 140 (2015), 119-127. doi: 10.4064/cm140-1-10
![]() |
[20] |
F. Sun, On subsequence sums of a zero-sum free sequence, Electron. J. Combin., 14 (2007), R52. doi: 10.37236/970
![]() |
[21] | F. Sun, Y. Li, J. Peng, A note on the inverse problems associated with subsequence sums, J. Combin. Math. Combin. Comput. (in press). |
[22] |
P. Yuan, Subsequence sums of a zero-sumfree sequence, European J. Combin., 30 (2009), 439-446. doi: 10.1016/j.ejc.2008.04.008
![]() |
[23] |
P. Yuan, Subsequence Sums of Zero-sum-free Sequences, Electron. J. Combin., 16 (2009), R97. doi: 10.37236/186
![]() |
[24] |
P. Yuan, X. Zeng, On zero-sum free subsets of length 7, Electron. J. Combin., 17 (2010), R104. doi: 10.37236/376
![]() |
1. | W. Hui, Y. Li, J. Peng, M. Wang, Inverse problems associated with k-sums of sequences over finite abelian groups, 2023, 169, 0236-5294, 312, 10.1007/s10474-023-01303-z |