Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the maximal multiplicity of long zero-sum free sequences over Cp⊕CpC_p\oplus C_p

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 ε∈(0,14)\varepsilon \in (0,\frac 14) and $c&gt;0$, and let pp be a sufficiently large prime depending on ε\varepsilon and cc. Then every zero-sumfree sequence SS over Cp⊕CpC_p\oplus C_p of length ∣S∣≥2p−cp|S|\geq 2p-c\sqrt{p} contains some element at least ⌊p<sup>14−ε⌋\lfloor p<sup>{\frac14-\varepsilon}\rfloor times.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.