Long n-zero-free sequences in finite cyclic groups

From MaRDI portal
Publication:2463463



Abstract: A sequence in the additive group mathbbZn 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 mathbbZn 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 mathbbZn, 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 ErdH{o}s, Ginzburg and Ziv.





Cited in
(26)








This page was built for publication: Long \(n\)-zero-free sequences in finite cyclic groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463463)