The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index; none of the 11 sources its claims cite is checked for support yet.
Davenport constant with weights
Open accessOverview
CoChat Summary
TL;DR
The paper proves that for the cyclic group \(\mathbb{Z}/n\mathbb{Z}\) and any non-empty weight set \(A\subseteq \mathbb{Z}\), the weighted EGZ constant satisfies \(E_A(n)=D_A(n)+n-1\). This resolves a conjecture raised by Adhikari–Rath, Adhikari–Chen, Thangadurai, and Griffiths.
Key findings
- The main theorem is \(E_A(n)=D_A(n)+n-1\) for any non-empty set \(A\subseteq \mathbb{Z}\) (Theorem 1.2), proving Conjecture 1.1.
- The result settles the problem raised by Adhikari and Rath, Adhikari and Chen, Thangadurai, and Griffiths.
- The proof uses the main theorem of Devos, Goddyn, and Mohar (Theorem DGM) and a recently proved theorem of the authors (Theorem YZ) on Davenport’s constant.
- The paper notes that equality was previously proved in special cases: \(A=\{1\}\), \(\{-1,1\}\), \(\mathbb{Z}_n^\star\), \(A=(a_1,\dots,a_r)\) with \(\gcd(a_2-a_1,\dots,a_r-a_1,n)=1\), or \(n=p\) prime.
Methods
- Theoretical proof in additive combinatorics/zero-sum theory for the cyclic group \(G=\mathbb{Z}/n\mathbb{Z}\); it defines \(D_A(n)\) and \(E_A(n)\) for sequences in \(G\) with weights from \(A\).
- The proof shows \(E_A(n)\ge D_A(n)+n-1\) is easy, then proves the reverse inequality by contradiction using a minimal counterexample \((A,G,S)\), where \(t=D_A(n)+n-1\) and \(S=x_1\cdots x_t\), aiming to show \(0\in\sum_n(A)\).
- The argument uses stabilization \(H=\operatorname{stab}(\sum_n(A))\), Theorem DGM, Theorem YZ, a claim \(D_A(G)\ge D_A(H_1)\ge D(H)=|H|\), and a case split on \(s\ge n\) versus \(s<n\).
Limitations
- The paper states no limitations.
- Evident from the text: the theorem is proved for cyclic groups \(G=\mathbb{Z}/n\mathbb{Z}\); the abstract and proof are framed for cyclic \(G\), not general finite abelian groups.
- Evident from the text: the proof depends on Theorem YZ, cited as “submitted” ([13]), and on Theorem DGM (Devos–Goddyn–Mohar, “to appear” in the references).
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 1 Not valid · 6 Not checked · 1 Own results and interpretations
None of the sources cited for this claim have been checked yet.
In the paper
“In the present paper, we show that E A ( n ) = D A ( n )+ n -1.”
- Also stated in: § Theorem 1.2 For any non-empty set A ∈ Z , E A ( n ) = D A ( n ) + n -1 . · p. 2 · plain
“Theorem 1.2 For any non-empty set A ∈ Z , E A ( n ) = D A ( n ) + n -1 .”
What the sources say
- Not checked yetcites [5] Erdös, 1961, Theorem in the additive number theory, Bull. Res. Council Israel
- Not matchedcites [13]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Also stated in: § Theorem 1.2 For any non-empty set A ∈ Z , E A ( n ) = D A ( n ) + n -1 . · p. 2 · plain
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This contradiction implies that H = stab ( ∑ n ( A )) = { 0 } .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“By the Claim, (1), (2) and Theorem YZ, S 1 has a subsequence S 2 of length | S 2 | = s ≥ r +1 -| H | such that 0 ∈ ∑ l ( S 2 ) for every 1 ≤ l ≤ s .”
What the sources say
- Not matchedcites [13]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
None of the sources cited for this claim have been checked yet.
In the paper
“This solve the problem raised by Adhikari and Rath [3], Adhikari and Chen [2], Thangadurai [12] and Griffiths [10].”
What the sources say
- Not checked yetcites [3] Adhikari, 2006, Davenport constant with weights and some related questions, Integers, Paper A6 source
- Not checked yetcites [2] Adhikari, 2008, Davenport constant with weights and some related questions, II, J. Combin. Theory Theory Ser. A source
- Not checked yetcites [12] Yuan, 2009, A new result on Davenport constant, J. Number Theory source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“Theorem YZ Let G be a finite abelian group of order n and Davenport constant D ( G ) . Let S = 0 h ( S ) ∏ g ∈ G g v g ( S ) ∈ F ( G ) be a sequence with a maximal multiplicity h ( S ) attained by 0 and | S | = t ≥ n + D ( G ) -1 . Then there exists a subsequence S 1 of S with length | S 1 | ≥ t +1 -D ( G ) and 0 ∈ ∑ k ( S 1 ) for every 1 ≤ k ≤ | S 1 | .”
What the sources say
- Not matchedcites [13]
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Not matched
1 more claim
Create a free account to see all 8 claims and to verify the 8 references still open.
- It may state two separate claims as one. 2
- Probably not a substantial claim. 1
Citations
Cites
Non-Unique Factorizations: Algebraic, Combinatorial and Analytic Theory
Geroldinger, A., & Halter-Koch, F. (2006) · doi:10.1201/9781420003208 · Cited by 366
Zero-sum problems in finite abelian groups: A survey
Gao, W., & Geroldinger, A. (2006) · Expositiones Mathematicae · doi:10.1016/j.exmath.2006.07.002 · Cited by 262
A theorem in additive number theory
Crocker, R. (1969) · Colloquium Mathematicum · doi:10.4064/cm-20-1-53-56 · Cited by 169
A Combinatorial Problem on Finite Abelian Groups
Gao, W. D. (1996) · Journal of Number Theory · doi:10.1006/jnth.1996.0067 · Cited by 74
Contributions to zero-sum problems
Adhikari, S. D., Chen, Y. G., Friedlander, J. B., Konyagin, S. V., & Pappalardi, F. (2006) · Discrete Mathematics · doi:10.1016/j.disc.2005.11.002 · Cited by 47
A generalization of Kneser's Addition Theorem
DeVos, M., Goddyn, L., & Mohar, B. (2008) · Advances in Mathematics · doi:10.1016/j.aim.2008.11.003 · Cited by 40
Davenport constant with weights and some related questions, II
Adhikari, S. D., & Chen, Y.-G. (2008) · Journal of Combinatorial Theory, Series A · doi:10.1016/j.jcta.2007.03.004 · Cited by 35
A generalization of a classical zero-sum problem
Luca, F. (2006) · Discrete Mathematics · doi:10.1016/j.disc.2006.09.002 · Cited by 29
A variant of Davenport’s constant
Thangadurai, R. (2007) · Proceedings - Mathematical Sciences · doi:10.1007/s12044-007-0010-4 · Cited by 27
The Erdős–Ginzberg–Ziv theorem with units
Griffiths, S. (2008) · Discrete Mathematics · doi:10.1016/j.disc.2007.09.060 · Cited by 20
Cited by
On weighted zero-sum sequences
Adhikari, S. D., Grynkiewicz, D. J., & Sun, Z. (2011) · Advances in Applied Mathematics · doi:10.1016/j.aam.2011.11.007 · Cited by 27
A weighted generalization of two theorems of Gao
Grynkiewicz, D. J., Marchan, L. E., & Ordaz, Ó. (2012) · The Ramanujan Journal · doi:10.1007/s11139-011-9350-x · Cited by 25
Arithmetical interpretation of weighted Davenport constants
Halter‐Koch, F. (2014) · Archiv der Mathematik · doi:10.1007/s00013-014-0677-6 · Cited by 19
Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
Marchan, L. E., Ordaz, Ó., Santos, I., & Schmid, W. A. (2015) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2015.05.004 · Cited by 13
Generalizations of some zero sum theorems
CHINTAMANI, M. N., & MORIYA, B. K. (2012) · Proceedings - Mathematical Sciences · doi:10.1007/s12044-012-0058-7 · Cited by 6
Metadata
- Authors
- Yuan, P., & Zeng, X.
- Affiliations
- South China Normal University (CN)
- Sun Yat-sen University (CN)
- Corresponding author
- Yuan, Pingzhi
- Zeng, Xiangneng
- ORCID
- Yuan, Pingzhi
- Venue
- European Journal of Combinatorics
- Publisher
- Elsevier BV
- Published
- 2010-04
- Volume
- 31
- Issue
- 3
- Pages
- 677-680
- ISSN
- 0195-6698 (ISSN-L)
- OpenAlex
- W2088686986
- Cited by
- 24
- References
- 12
- Citations by year
- 2026: 1 · 2024: 1 · 2022: 1 · 2021: 5 · 2019: 1 · 2017: 1 · 2015: 1 · 2014: 2 · 2013: 2 · 2012: 3
- FWCI
- 3.78
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 1461 d)
- Locations
- European Journal of Combinatorics (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- National Natural Science Foundation of China (8151027501000114, 10971072, 10571180)
- Natural Science Foundation of Guangdong Province (10571180, 8151027501000114)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Keywords
- Davenport constant, zero-sum problems, m-sequences, additive number theory, combinatorial number theory
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-11-14, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-11-14 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Davenport constant with weights. https://app.cochat.ai/papers/10.1016/j.ejc.2009.09.005
- The paper
- Yuan, P., & Zeng, X. (2010). Davenport constant with weights. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2009.09.005
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.