AbstractA prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for any positive integer n, any sequence a1,a2,…,a2n-1 of 2n-1 integers has a subsequence of n elements whose sum is 0 modulo n. Appropriate generalizations of the question, especially that for (Z/pZ)d, generated a lot of research and still have challenging open questions. Here we propose a new generalization of the Erdős–Ginzburg–Ziv theorem and prove it in some basic cases
AbstractA sequence in the additive group Zn of integers modulo n is called n-zero-free if it does no...
AbstractLet G be a finite (additive written) abelian group of order n. Let w1,…,wn be integers copri...
AbstractLet a1 < a2 < … be a sequence of positive integers such that no ak is a sum of distinct othe...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
Abstract. A prototype of zero–sum theorems, the well–known theorem of Erdős, Ginzburg and Ziv says ...
AbstractErdös, Ginzburg and Ziv proved that any sequence of 2n−1 (not necessary distinct) members of...
AbstractLet Z denote the ring of integers and for a prime p and positive integers r and d, let fr(P,...
AbstractLet n be a natural number. Erdös, Ginzburg and Ziv proved that every sequence of elements of...
AbstractLet Zn be the cyclic group of order n. For a sequence S of elements in Zn, we use fn(S) to d...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
AbstractLet n be a natural number. Erdös, Ginzburg and Ziv proved that every sequence of elements of...
AbstractTextLet S be a sequence of n nonnegative integers not exceeding n−1 such that S takes at lea...
AbstractRecently the following theorem in combinatorial group theory has been proved: LetGbe a finit...
AbstractA sequence in the additive group Zn of integers modulo n is called n-zero-free if it does no...
AbstractLet G be a finite (additive written) abelian group of order n. Let w1,…,wn be integers copri...
AbstractLet a1 < a2 < … be a sequence of positive integers such that no ak is a sum of distinct othe...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
A prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says that for an...
Abstract. A prototype of zero–sum theorems, the well–known theorem of Erdős, Ginzburg and Ziv says ...
AbstractErdös, Ginzburg and Ziv proved that any sequence of 2n−1 (not necessary distinct) members of...
AbstractLet Z denote the ring of integers and for a prime p and positive integers r and d, let fr(P,...
AbstractLet n be a natural number. Erdös, Ginzburg and Ziv proved that every sequence of elements of...
AbstractLet Zn be the cyclic group of order n. For a sequence S of elements in Zn, we use fn(S) to d...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
AbstractLet n be a natural number. Erdös, Ginzburg and Ziv proved that every sequence of elements of...
AbstractTextLet S be a sequence of n nonnegative integers not exceeding n−1 such that S takes at lea...
AbstractRecently the following theorem in combinatorial group theory has been proved: LetGbe a finit...
AbstractA sequence in the additive group Zn of integers modulo n is called n-zero-free if it does no...
AbstractLet G be a finite (additive written) abelian group of order n. Let w1,…,wn be integers copri...
AbstractLet a1 < a2 < … be a sequence of positive integers such that no ak is a sum of distinct othe...