A variant of Davenport's constant

Abstract

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of ]n[:= \1,2,..., n\ such that elements of A are incongruent modulo p and non-zero modulo p. Let k ≥ D(G)/|A| be any integer where D(G) denotes the well-known Davenport's constant. In this article, we prove that for any sequence g1, g2, ..., gk (not necessarily distinct) in G, one can always extract a subsequence gi1, gi2, ..., gi with 1≤ ≤ k such that equation* Σj=1 ajgij = 0 in G, equation* where aj ∈ A for all j. We provide examples where this bound cannot be improved. Furthermore, for the cyclic groups, we prove some sharp results in this direction. In the last section, we explore the relation between this problem and a similar problem with prescribed length. The proof of Theorem~1 uses group-algebra techniques, while for the other theorems, we use elementary number theory techniques.

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…