Davenport constant for $C_n^3$

Description of constant

In zero-sum theory, the Davenport constant $D(G)$ of a finite abelian group $G$ is defined as the smallest integer $l\in\mathbb{N}$ such that every sequence $S$ over $G$ of length $\lvert S\rvert\ge l$ has a non-empty zero-sum subsequence. [GG2006-def-D]

For $n\ge 2$, let $C_n$ denote the cyclic group of order $n$, and write

\[C_n^3\ :=\ C_n\oplus C_n\oplus C_n.\]

[GG2006-def-Cn]

We define

\[C_{53}\ :=\ \sup_{n\ge 2}\ \frac{D(C_n^3)-1}{n-1},\]

the maximal normalized Davenport constant among the rank-$3$ groups $C_n^3$.

The following explicit uniform inequality is obtained from the inductive method and known multi-wise Davenport estimates over elementary prime groups:

\[3(n-1)+1\ \le\ D(C_n^3)\ \le\ 4n-P(n)-2 \qquad (n\ge 2),\]

where

\[P(n)=\max_{p^a\parallel n}p^a\]

is the largest primary component of $n$. Since $P(n)\ge 2$, this gives

\[D(C_n^3)\le 4n-4=4(n-1),\]

and hence

\[C_{53}\le 4.\]

The previously recorded published bounds included

\[3(n-1)+1\ \le\ D(C_n^3)\ \le\ \min\{20369,\ 3^{\omega(n)}\}(n-1)+1,\]

where $\omega(n)$ is the number of distinct prime factors of $n$. [Zak2019-omega-def] [Zak2019-cor3.11] Here, the $3^{\omega(n)}$ term is inherited from earlier published work, while the uniform numeric constant $20369$ is the explicit contribution in [Zak2019]. [Zak2019-prev-3omega] [CMMPT2012]

In particular,

\[3\ \le\ C_{53}\ \le\ 4.\]

A long-standing conjecture (in a stronger, pointwise form) predicts that for all $n\ge 2$ one has

\[D(C_n^3)\ =\ 3(n-1)+1,\]

equivalently $C_{53}=3$. [GG2006-conj3.5] [GG2006-D-equals-1-plus-d] [GG2006-def-dstar]

One unconditional family of exact evaluations is given by prime powers: if $n$ is a prime power, then $C_n^3$ is a $p$-group, and Theorem 3.1 implies $d(C_n^3)=d^*(C_n^3)=3(n-1)$ and hence $D(C_n^3)=3(n-1)+1$. [GG2006-thm3.1] [GG2006-D-equals-1-plus-d] [GG2006-def-dstar]

The general determination of $D(G)$ for rank-$3$ groups (and in particular the pointwise determination of $D(C_n^3)$ for all $n$) remains open. [Zak2019-open-rank3]

Published work before the 2019 preprint includes Gao (2000) on rank-$3$ groups and Chintamani–Moriya–Gao–Paul–Thangadurai (2012), which gives the bound $D(C_n^3)\le 3^{\omega(n)}(n-1)+1$ used in Corollary 3.11. [Zak2019-ref-Gao2000] [Zak2019-prev-3omega] [CMMPT2012] [Gao2000]

Known upper bounds

Bound Reference Comments
$4$ [Grinsztajn2026] From the pointwise estimate $D(C_n^3)\le 4n-P(n)-2$, where $P(n)=\max_{p^a\parallel n}p^a$. Since $P(n)\ge2$, this gives $C_{53}\le4$.
$20369$ [Zak2019] From Corollary 3.11: $D(C_n^3)\le 20369(n-1)+1$ for all $n\ge 2$, hence $C_{53}\le 20369$. [Zak2019-cor3.11]

Known lower bounds

Bound Reference Comments
$3$ [GG2006] Using $d(C_n^3)\ge d^*(C_n^3)=3(n-1)$ and $D(G)=1+d(G)$ gives $D(C_n^3)\ge 3(n-1)+1$, hence $C_{53}\ge 3$. [GG2006-d-ge-dstar] [GG2006-D-equals-1-plus-d] [GG2006-def-dstar]

References

Contribution notes

Prepared with assistance from GPT-5.5 Pro.