Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 24Advanced Combinatorial MathematicsAnalytic Number Theory ResearchLimits and Structures in Graph Theory

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 access
Yuan, Pingzhi, Zeng, Xiangneng·2010·European Journal of Combinatorics

Overview

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

Crossref · 10.1016/j.ejc.2009.09.005

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

0 Valid · 1 Not valid · 6 Not checked · 1 Own results and interpretations

1 more claim

Create a free account to see all 8 claims and to verify the 8 references still open.

See all claims — free account
  • It may state two separate claims as one. 2
  • Probably not a substantial claim. 1

Create a free account to see these claims.

Citations

Cites

Show all 12 references

Cited by

See all 24

Metadata

Authors
Yuan, P., & Zeng, X.
Affiliations
  • South China Normal University (CN)
  • Sun Yat-sen University (CN)
Corresponding author
  • Yuan, Pingzhi
  • Zeng, Xiangneng
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
Licence
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.