Sums and k-sums in abelian groups of order k

@inproceedings{Gao2006SumsAK,
  title={Sums and k-sums in abelian groups of order k},
  author={Weidong Gao and Imre Leader},
  year={2006}
}
Let G be an abelian group of order k. How is the problem of minimizing the number of sums from a sequence of given length in G related to the problem of minimizing the number of k-sums? In this paper we show that the minimum number of k-sums for a sequence a1, . . . , ar that does not have 0 as a k-sum is attained at the sequence b1, . . . , br−k+1,0, . . . ,0, where b1, . . . , br−k+1 is chosen to minimise the number of sums without 0 being a sum. Equivalently, to minimise the number of k-sums… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-6 of 6 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

The number of k-sums modulo k

B. Bollobás, I. Leader
J. Number Theory 78 • 1999
View 7 Excerpts
Highly Influenced

A combinatorial problem on finite abelian groups

W. D. Gao
J. Number Theory 58 • 1996
View 9 Excerpts
Highly Influenced

Theorem in the Additive Number Theory

View 4 Excerpts
Highly Influenced

Addition theorems for finite abelian groups

W. D. Gao
J. Number Theory 53 • 1995
View 7 Excerpts
Highly Influenced

On zero-sum subsequences of restricted size II

Discrete Mathematics • 2001
View 1 Excerpt

On Davenport's Constant

J. Comb. Theory, Ser. A • 1992
View 1 Excerpt

Similar Papers

Loading similar papers…