2000 character limit reached
On the maximal multiplicity of long zero-sum free sequences over
Published 22 Nov 2012 in math.NT and math.CO | (1211.5226v1)
Abstract: In this paper, we point out that the method used in [Acta Arith. 128(2007) 245-279] can be modified slightly to obtain the following result. Let and $c>0$, and let be a sufficiently large prime depending on and . Then every zero-sumfree sequence over of length contains some element at least times.
Paper Prompts
Sign up for free to create and run prompts on this paper.