Caps and progression-free sets in Zmn

Abstract

We study progression-free sets in the abelian groups G=(Zmn,+). Let rk(Zmn) denote the maximal size of a set S ⊂ Zmn that does not contain a proper arithmetic progression of length k. We give lower bound constructions, which e.g. include that r3(Zmn) ≥ Cm ((m+2)/2)nn, when m is even. When m=4 this is of order at least 3n/n G 0.7924. Moreover, if the progression-free set S⊂ Z4n satisfies a technical condition, which dominates the problem at least in low dimension, then |S|≤ 3n holds. We present a number of new methods which cover lower bounds for several infinite families of parameters m,k,n, which includes for example: r6(Z125n) ≥ (85-o(1))n. For r3(Z4n) we determine the exact values, when n ≤ 5, e.g. r3(Z45)=124, and for r4(Z4n) we determine the exact values, when n ≤ 4, e.g. r4(Z44)=128.

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…