English

An asymptotically tight bound for the Davenport constant

Number Theory 2018-07-03 v3 Combinatorics Group Theory

Abstract

We prove that for every integer r1r \ge 1 the Davenport constant D(Cnr)\mathsf{D}(C^r_n) is asymptotic to rnrn when nn tends to infinity. An extension of this theorem is also provided.

Keywords

Cite

@article{arxiv.1709.08033,
  title  = {An asymptotically tight bound for the Davenport constant},
  author = {Benjamin Girard},
  journal= {arXiv preprint arXiv:1709.08033},
  year   = {2018}
}

Comments

6 pages

R2 v1 2026-06-22T21:52:37.514Z