论文信息 - The Number of k-Sums Modulo k

The Number of k-Sums Modulo k

Abstract Let a1, …, ar be a sequence of elements of Z k, the integers modulo k. Calling the sum of k terms of the sequence a k-sum, how small can the set of k-sums be? Our aim in this paper is to show that if 0 is not a k-sum then there are at least r−k+1 k-sums. This result, which is best possible, extends the Erdos–Ginzburg–Ziv theorem, which states that if r=2k−1 then 0 is a k-sum. We also show that the same result holds in any abelian group of order k, and make some related conjectures.

Béla Bollobás | Imre Leader

[1] van P. Emde Boas,et al. A combinatorial problem on finite abelian groups, 3 , 1967 .

[2] Alfred Geroldinger,et al. On Davenport's Constant , 1992, J. Comb. Theory, Ser. A.

[3] Kazuya Kato,et al. Number Theory 1 , 1999 .

[4] R. Graham,et al. Handbook of Combinatorics , 1995 .

[5] A. Ziv,et al. Theorem in the Additive Number Theory , 2022 .

[6] R. Bruce Richter,et al. Sum zero (mod n ), size n subsets of integers , 1989 .

[7] Weidong Gao,et al. A Combinatorial Problem on Finite Abelian Groups , 1996 .

[8] Noga Alon,et al. Zero-sum sets of prescribed size , 1993 .

[9] Weidong Gao. Addition Theorems for Finite Abelian Groups , 1995 .

[10] Oscar Ordaz,et al. On a Combinatorial Theorem of Erdös, Ginzburg and Ziv , 1998, Comb. Probab. Comput..

[11] N. Alon. Tools from higher algebra , 1996 .

[12] Béla Bollobás,et al. Sums in the grid , 1996, Discret. Math..

[13] John E. Olson. An addition theorem for finite Abelian groups , 1977 .