Skip to content
Preprint

The fourth generalized Davenport constant of $C_5^3$

Sep 2026 · 0 citations · 18 references
Computer Science Mathematics

Abstract

For a finite abelian group $G$ and $k \geq 1$, the generalized Davenport constant $D_k(G)$ is the least $\ell$ such that every sequence over $G$ of length at least $\ell$ has $k$ pairwise disjoint nonempty zero-sum subsequences. A theorem of Freeze and Schmid gives $D_k(C_5^3) \geq 5k+10$ for every $k \geq 2$. We prove the matching upper bound: $D_4(C_5^3)=30$, and hence $D_k(C_5^3)=5k+10$ for every $k \geq 2$, so the Freeze--Schmid bound is attained by $C_5^3$ from $k=2$ onward, as it is by $C_2^3$ and unlike $C_3^3$. The proof is finite and computer-assisted. The remaining case reduces to showing that every zero-sum sequence of length $31$ over $C_5^3$ contains a nonempty zero-sum subsequence of length at most five. A saturation argument confines the multiplicities of a hypothetical counterexample to $\{1,2,4\}$, its support pattern to one of $60$ solutions of two linear equations, and its geometry to one of $78$ rank/plane branches normalized to a standard basis; an exhaustive search exhausts every branch with no survivor. The search was carried out by three independently written implementations, and the branch cover was regenerated by separate programs from the lemmas alone; two further machine-verified values, $D_3(C_5^3)=25$ and $s_{\leq 6}(C_5^3)=24$, enter the second statement, and their records accompany the paper.

View source

Similar papers

Preprint Sep 2026

The small Davenport constant of $H_{27}\times C_3^r$

Let $H_{27}=\mathrm{UT}_3(\mathbb{F}_3)$ be the nonabelian group of order $27$ and exponent $3$. We prove that $\mathsf{d}(H_{27}\times C_3^r)=2r+6$ for every integer $r\geq0$. The proof combines an affine coefficient identity in the group algebra of an elementary abelian group with a decomposition of the nonorthogonal...

André Volkmann · 0 citations
Preprint Sep 2026

$S_h$-sets in abelian groups

For a positive integer $h$, a subset $A = \{a_1, \dots, a_k\}$ of an additive abelian group $G$ is called an $S_h$-set of size $k$ if all sums of $h$ distinct elements in $S$ are distinct. For fixed positive integers $h$ and $k$, let $v_h(k)$ denote the order of the smallest abelian group containing an $S_h$-set of siz...

V. Goswami, R. Mistri · 0 citations
Preprint Aug 2026

A Uniform Proof for the Small Davenport Constant of the Exponent-$p$ Heisenberg Group

Let $p$ be an odd prime and let $H_{p^3}=\operatorname{UT}_3(\mathbb{F}_p)$ be the Heisenberg group of order $p^3$ and exponent $p$. We prove $\mathsf{d}(H_{p^3})=3p-3$. The main ingredient of the proof is an order-value growth theorem. If $B$ is a noncollinear zero-sum sequence of $n$ nonzero vectors in $\mathbb{F}_p^...

André Volkmann · 3 citations
Preprint Oct 2026

Square products of factorials and a conjecture of Erd\H{o}s and Graham

For $n\ge2$ let $F(n)$ be the least $k\ge2$ such that $n!$ is the largest factor in a product of $k$ distinct factorials that is a perfect square, and let $D_k(X)$ be the number of $n\le X$ with $F(n)=k$. Erdos and Graham asked for the order of growth of $D_k(X)$ for $3\le k\le6$, and conjectured that $D_6(X)\gg X$. We...

Fedir Yudin · 0 citations
Preprint Sep 2026

Equal subset sums and close divisors

For $k\geq2$, let $\alpha_k$ be the supremum of the exponents $a$ for which almost every integer $n$ has $k$ distinct divisors in a multiplicative interval of relative length $(\log n)^{-a}$. Select each positive integer $i$ independently with probability $1/i$, forming a random set $\mathbf A$, and let $\beta_k$ be th...

Jian-Feng Hou, Hong-Bin Zhao · 0 citations
Preprint Aug 2026

Weakened Gallai-Ramsey Numbers for Books

For $1\le s<t$ and any graph $G$, the weakened Gallai-Ramsey number $gr^t_s(G)$ is defined to be the least $p\in \mathbb{N}$ such that every Gallai $t$-coloring of the edges of $K_p$ (i.e., a $t$-coloring that lacks rainbow triangles) contains a subgraph isomorphic to $G$ whose edges use at most $s$ of the colors. In t...

M. Budden, A. Gregory · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.