Long $n$-zero-free sequences in finite cyclic groups

Details Long $n$-zero-free sequences in finite cyclic groups Long $n$-zero-free sequences in finite cyclic groups

2006-04-16

arxiv.org/abs/math/0604356v1

Mathematics

Combinatorics

11 pages

Scientific paper

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of length greater than $3n/2-1$. The structure of these sequences is completely determined, which generalizes a number of previously known facts. The characterization cannot be extended in the same form to shorter sequence lengths. Consequences of the main result are best possible lower bounds for the maximum multiplicity of a term in an $n$-zero-free sequence of any given length greater than $3n/2-1$ in ${\mathbb Z}_n$, and also for the combined multiplicity of the two most repeated terms. Yet another application is finding the values in a certain range of a function related to the classic theorem of Erd\H{o}s, Ginzburg and Ziv.

Affiliated with

Also associated with

No associations

Rating

Long $n$-zero-free sequences in finite cyclic groups 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 Long $n$-zero-free sequences in finite cyclic groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Long $n$-zero-free sequences in finite cyclic groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241919