Long $n$-zero-free sequences in finite cyclic groups
| dc.creator | Savchev, Svetoslav | |
| dc.creator | Chen, Fang | |
| dc.date | 2006-04-16 | |
| dc.date.accessioned | 2026-07-07T07:10:58Z | |
| dc.date.available | 2026-07-07T07:10:58Z | |
| dc.description | 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ős, Ginzburg and Ziv. | |
| dc.description | 11 pages | |
| dc.identifier | https://arxiv.org/abs/math/0604356 | |
| dc.identifier | http://arxiv.org/abs/math/0604356 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/111588 | |
| dc.subject | Combinatorics | |
| dc.subject | Number Theory | |
| dc.subject | 11B50; 11P21 | |
| dc.title | Long $n$-zero-free sequences in finite cyclic groups | |
| dc.type | text |