betaFeedback

WorksMathematics

The zero-sum constant sp∗\mathsf{s}_p^* and inverse problem

Abstract

Let pp be an odd prime. We denote by sp∗\mathsf{s}_{p}^{*} the smallest integer ll such that, out of any given ll integers coprime with pp, one can select pp integers satisfying that the sum of the pp integers is a multiple of pp, but not a multiple of p2p^{2}. It was conjectured that sp∗=2p+1\mathsf{s}_p^*=2p+1. In this paper we prove this conjecture and solve the corresponding inverse problem. More precisely, we characterize all sequences of 2p2p integers coprime to pp in which every pp-term subsequence with sum a multiple of pp also has sum a multiple of p2p^2.

Introduction

Two classical constants distinguish between finding a nonempty zero-sum subsequence and finding one of prescribed length. For a finite abelian group HH, the Davenport constant D(H)D(H) is the least integer ll such that every sequence of length ll over HH has a nonempty zero-sum subsequence. The Erdős–Ginzburg–Ziv constant s(H)s(H) is defined in the same way, with the additional requirement that the subsequence have length exp⁡(H)\exp(H), the exponent of HH. Let CnC_n denote the cyclic group of order nn. For a prime pp, we have D(Cp)=pD(C_p)=p, and the Erdős–Ginzburg–Ziv theorem gives s(Cp)=2p−1s(C_p)=2p-1. Thus among any 2p−12p-1 integers one can find pp terms whose sum is divisible by pp.

In their study of zero-sum subsequences of cross number 1, Gao, Hui, Jiang, Li and Wang asked for a pp-term sum divisible by pp but not by p2p^2 when the terms are coprime to pp [3 Conjecture 3.2]. Gao, Jiang, Lei, Lin and Yang formulated this question in terms of the following constant.

Definition. For a prime pp, let sp∗s_p^* be the smallest integer ll such that every sequence of ll integers coprime to pp has a subsequence of length pp whose sum is divisible by pp but not by p2p^2 [4 Definition 1.1].

For odd pp, the sequence 1p−1(1−p)(−1)p−1(p−1)1^{p-1}(1-p)(-1)^{p-1}(p-1) in [3] gives sp∗≥2p+1s_p^* \ge2p+1, and the conjecture asserts that equality holds. The upper bound sp∗≤4p−3s_p^* \le4p-3 follows from Reiher’s theorem s(Cp⊕Cp)=4p−3s(C_p \oplus C_p)=4p-3 [9]. Represent each term modulo p2p^2 as u+pvu+pv with 1≤u≤p−11\le u\le p-1 and 0≤v≤p−10\le v\le p-1, and apply the theorem to the pairs (u,v)(u,v) modulo pp (see [4]). In the selected pp terms, the sum of the uu-coordinates is a positive multiple of pp smaller than p2p^2, and the sum of the vv-coordinates is a multiple of pp. Gao, Jiang, Lei, Lin and Yang improved the upper bound to 3p−23p-2 [4 Theorem 1.3] and reported that equality with 2p+12p+1 had been verified for p=3,5,7p=3,5,7.

Related problems differ in the permitted lengths or in the modulus. In a preprint, Gao, Jiang and Mu showed that for a prime power nn, every sequence of 2n−12n-1 integers coprime to nn has a nonempty subsequence of length at most nn with sum uu satisfying gcd⁡(u,n2)=n\gcd(u,n^2)=n. They also determined the corresponding extremal sequences [5]. For n=pn=p the condition on the sum is the same as in the definition of sp∗s_p^*, with the length allowed to be smaller than pp. Sun considers versions with exactly nn terms and general integer modulus nn in the preprint [11].

The defining condition for sp∗s_p^* depends only on the residues modulo p2p^2. Let G=Z/p2ZG=\mathbb{Z}/p^2\mathbb{Z}, whose additive group is Cp2C_{p^2}. The ideal pG={pg:g∈G}pG=\{pg:g\in G\} is an additive subgroup of order pp, and G×=G∖pGG^\times=G\setminus pG is the set of units of GG. We identify CpC_p with the additive group of Z/pZ\mathbb{Z}/p\mathbb{Z}. The canonical homomorphism π:G→Cp\pi:G\to C_p is reduction modulo pp and has kernel pGpG. For a sequence TT over GG, let T‾\overline{T} be the sequence obtained by applying π\pi to each term of TT. For a sequence TT, let ∣T∣|T| be its length and σ(T)\sigma(T) its sum. A sequence SS of length 2p2p over G×G^{\times} is called exceptional if it has no subsequence TT of length pp with σ(T)∈pG∖{0}\sigma(T) \in pG \setminus\{0\}.

The following theorem classifies the exceptional sequences. Its corollary proves sp∗=2p+1s_p^{*}=2p+1 for all odd primes, so the classification gives all sequences of length sp∗−1s_p^{*}-1 that fail the defining condition.

Theorem 1.1. Let pp be an odd prime and let SS be a sequence of length 2p2p over G×G^{\times}. Then SS is exceptional if and only if it has one of the following forms.

(i) S=ABS=AB, where r,tr,t are distinct nonzero elements of CpC_p and ∣A∣=∣B∣=p|A|=|B|=p, A‾=rp\overline{A}=r^p, B‾=tp\overline{B}=t^p, σ(A)=σ(B)=0\sigma(A)=\sigma(B)=0.

(ii) S=ap−1bp−1xyS=a^{p-1}b^{p-1}xy, where a,b,x,y∈G×a,b,x,y\in G^{\times}, a−b∈G×a-b\in G^{\times}, and there exists an integer ii with 1≤i≤p−21\le i\le p-2 such that x=−ia−(p−1−i)bx=-ia-(p-1-i)b, y=−(p−1−i)a−iby=-(p-1-i)a-ib.

The terms xx and yy may coincide.

Corollary 1.2. For every odd prime pp, one has sp∗=2p+1s_p^{*}=2p+1.

The proof begins with the case of two distinct terms with the same image in CpC_p. A common completion to a pp-term subsequence gives a contradiction unless the sequence is concentrated in two nonzero residue classes, each containing pp terms. When π\pi is injective on the support, we first treat sequences with large multiplicities. In the remaining cases, we distribute the copies of each value among layers and use polynomial interpolation modulo pp and p2p^2 to bound the corresponding sumsets. These bounds allow us to lift selected sumsets to integer intervals and then complete their sums to pp terms.

Notation and preliminaries

Sequences and their images

We denote by N\mathbb{N} the set of positive integers and by N0=N∪{0}\mathbb{N}_0=\mathbb{N}\cup\{0\} the set of nonnegative integers. For real numbers a,ba,b, we set [a,b]={n∈Z:a≤n≤b}[a,b]=\{n\in\mathbb{Z}:a\le n\le b\}.

Let HH be a finite additive abelian group. We denote by F(H)\mathcal{F}(H) the free abelian monoid with basis HH. Its elements are called sequences over HH. We identify g∈Hg\in H with the one-term sequence gg. We denote concatenation by juxtaposition, and gjg^j denotes the sequence of jj copies of gg. Unless otherwise stated, ∏\prod denotes concatenation of an indexed family of sequences. For n∈Zn\in\mathbb{Z} and g∈Hg\in H, ngng denotes the integer multiple of gg in HH. For S∈F(H)S\in\mathcal{F}(H) and x∈Hx\in H, let vx(S)∈N0v_x(S)\in\mathbb{N}_0 be the multiplicity of xx in SS. We write T∣ST\mid S if vx(T)≤vx(S)v_x(T)\le v_x(S) for all x∈Hx\in H. Then TT is a subsequence of SS, and ST−1ST^{-1} denotes the sequence obtained by deleting TT from SS. The identity of F(H)\mathcal{F}(H) is the empty sequence.

For a sequence

S=g1⋯gl=∏x∈Hxvx(S)∈F(H),S=g_1\cdots g_l=\prod_{x\in H}x^{v_x(S)}\in\mathcal{F}(H),

we use the following notation.

  • ∣S∣=l=∑x∈Hvx(S)|S|=l=\sum_{x\in H}v_x(S) is the length of $S.

  • σ(S)=∑i=1lgi=∑x∈Hvx(S)x\sigma(S)=\sum_{i=1}^{l}g_i=\sum_{x\in H}v_x(S)x is the sum of SS.

  • supp⁡(S)={x∈H:vx(S)>0}\operatorname{supp}(S)=\{x\in H:v_x(S)>0\} is the support of SS.

  • h(S)=max⁡{vx(S):x∈H}h(S)=\max\{v_x(S):x\in H\} is the maximum multiplicity in SS.

  • SS is a zero-sum sequence if σ(S)=0\sigma(S)=0. A nonempty zero-sum sequence is minimal if it has no nonempty proper zero-sum subsequence. A sequence is zero-sum free if it has no nonempty zero-sum subsequence.

  • Σj(S)={σ(T):T∣S, ∣T∣=j}\Sigma_j(S)=\{\sigma(T):T\mid S,\ |T|=j\} for j∈[0,∣S∣]j\in[0,|S|]. We denote by Σ(S)\Sigma(S) the set of all nonempty subsequence sums.

References

  1. [3]W. Gao, W. Hui, X. Jiang, Y. Li and X. Wang, On zero-sum subsequences of cross number 1, Acta Arith. 219 (2025), 347–363.DOI
  2. [4]W. Gao, X. Jiang, W. Lei, C. Lin and W. Yang, A new problem from zero-sum theory, Acta Arith. 224 (2026), 77–79.DOI
  3. [5]W. Gao, X. Jiang and Y. Mu, Two local zero-sum problems, preprint, arXiv:2607.11313 (2026).arxiv.org/abs/2607.11313
  4. [6]D. J. Grynkiewicz, Note on a conjecture of Graham, European J. Combin. 32 (2011), 1336–1344.pubmed.ncbi.nlm.nih.gov/27087723
  5. [7]V. F. Lev and P. Y. Smeliansky, On addition of two distinct sets of integers, Acta Arith. 70 (1995), 85–91.DOI
  6. [8]I. Z. Ruzsa, Sum of sets in several dimensions, Combinatorica 14 (1994), 485–490.DOI
  7. [9]C. Reiher, On Kemnitz’ conjecture concerning lattice-points in the plane, Ramanujan J. 13 (2007), 333–337.DOI
  8. [10]S. Savchev and F. Chen, Long zero-free sequences in finite cyclic groups, Discrete Math. 307 (2007), 2671–2679.DOI
  9. [11]Z.-W. Sun, On zero-sum problems of two new types, preprint, arXiv:2606.18234v1 (2026).arxiv.org/abs/2606.18234
  10. [12]A. G. Vosper, The critical pairs of subsets of a group of prime order, J. London Math. Soc. 31 (1956), 200–205.DOI

Paper details

vlnc:W_7yep59j3
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

a large language model

View statement
Looking for related papers…
Contents