On equitable zero sums

Details On equitable zero sums On equitable zero sums

2007-09-07

arxiv.org/abs/0709.1176v1

Mathematics

Combinatorics

This is a preliminary draft. Future drafts will have more references, and possibly a stronger main theorem

Scientific paper

It is well-known that any sequence of at least N integers contains a subsequence whose sum is 0 (mod N). However, there can be very few subsequences with this property (e.g. if the initial sequence is just N 1's, then there is only one subsequence). When the length L of the sequence is much longer, we might expect that there are 2^L/N subsequences with this property (imagine the subsequences have sum-of-terms uniformly distributed modulo N -- the 0 class gets about 2^L/N subsequences); however, it is easy to see that this is actually false. Nonetheless, we are able to prove that if the initial sequence has length at least 4N, and N is odd, then there is a subsequence of length L > N, having at least 2^L/N subsequences that sum to 0 mod N.

Affiliated with

Also associated with

No associations

Rating

On equitable zero sums does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On equitable zero sums, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On equitable zero sums will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-44230