A Multiplicative Property for Zero-Sums II

Abstract

Let G=Cn Cmn with n≥ 2 and m≥ 1, and let k∈ [0,n-1]. It is known that any sequence of mn+n-1+k terms from G must contain a nontrivial zero-sum of length at most mn+n-1-k. The associated inverse question is to characterize those sequences with maximal length mn+n-2+k that fail to contain a nontrivial zero-sum subsequence of length at most mn+n-1-k. For k≤ 1, this is the inverse question for the Davenport Constant. For k=n-1, this is the inverse question for the η(G) invariant concerning short zero-sum subsequences. The structure in both these cases is known, and the structure for k∈ [2,n-2] when m=1 was studied previously with it conjectured that they must have the form S=e1[n-1]· e2[n-1]· (e1+e2)[k] for some basis (e1,e2), with the conjecture established in many cases. We focus on m≥ 2. Assuming the conjectured structure holds for k∈ [2,n-2] in Cn Cn, we characterize the structure of all sequences of maximal length mn+n-2+k in Cn Cmn that fail to contain a nontrivial zero-sum of length at most mn+n-1-k, showing they must have either have the form S=e1[n-1]· e2[sn-1]· (e1+e2)[(m-s)n+k] for some s∈ [1,m] and basis (e1,e2) with ord(e2)=mn, or else have the form S=g1[n-1]· g2[n-1]· (g1+g2)[(m-1)n+k] for some generating set \g1,g2\ with ord(g1+g2)=mn. Additionally, we give a new proof of the precise structure in the case k=n-1 for m=1. Combined with known results, our results unconditionally establish the structure of extremal sequences in G=Cn Cmn in many cases.

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…