2008
DOI: 10.1142/s1793042108001195
|View full text |Cite
|
Sign up to set email alerts
|

On Davenport's Constant

Abstract: In this paper, using the idea of Alford, Granville and Pomerance in [1] (or van Emde Boas and Kruyswijk [6]), we obtain an upper bound for the Davenport Constant of an Abelian group G in terms of the number of repetitions of the group elements in any given sequence. In particular, our result implies, [Formula: see text] where n is the exponent of G and k ≥ 0 denotes the number of distinct elements of G that are repeated at least twice in the given sequence.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…Let d(G) denote the maximal length of a zero-sum free sequence over G. Then d(G) + 1 is the Davenport constant of G, a classical constant from Combinatorial Number Theory (for surveys and historical comments, the reader is referred to [3], [8,Chapter 5], [7]). In general, the precise value of d(G) (in terms of the group invariants of G) and the structure of the extremal sequences is unknown, see [12,1,13,10,11,4,14,15,9] for recent progress.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…Let d(G) denote the maximal length of a zero-sum free sequence over G. Then d(G) + 1 is the Davenport constant of G, a classical constant from Combinatorial Number Theory (for surveys and historical comments, the reader is referred to [3], [8,Chapter 5], [7]). In general, the precise value of d(G) (in terms of the group invariants of G) and the structure of the extremal sequences is unknown, see [12,1,13,10,11,4,14,15,9] for recent progress.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…The best known upper bound is due to Emde Boas and Kruswjik [6,Theorem 7.1,p. 19], Meshulam [15], Alford et al [1] and Rath et al [19] which is as follows…”
Section: Introductionmentioning
confidence: 99%