On the maximal multiplicity of long zero-sum free sequences over Cp Cp

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 ∈ (0, 14) and c>0, and let p be a sufficiently large prime depending on and c. Then every zero-sumfree sequence S over Cp Cp of length |S|≥ 2p-cp contains some element at least p14- times.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…