The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Erdős–Ginzberg–Ziv theorem with units
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Observation 3. A sequence S is a U ( n ) -weighted zero-sum sequence in Z n if and only if for every prime divisor p of n we have that the sequence S ( p ) is a U ( p v p ( n ) ) -weighted zero-sum sequence in Z p vp ( n ) .”
From On a different weighted zero-sum constant (2023) · cites this paper as [6]
In the citing paper
“Lemma 6. Let p be an odd prime. If a sequence S over Z p r has at least two terms coprime to p , then S is a U ( p r ) -weighted zero-sum sequence.”
From On a different weighted zero-sum constant (2023) · cites this paper as [6]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
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
Research works printed but not linked: 12
- Adhikari, 2006, Contributions to zero-sum problems, Discrete Math., 306, 1, 10.1016/j.disc.2005.11.002 · DOI · Paper page
- Adhikari, 2006, Davenport constant with weights and some related questions, Integers, 6, A30
- N. Alon, M. Dubiner, Zero-sum sets of prescribed size, in: Combinatorics, Paul Erdős Is Eight, János Bolyai Math. Soc., 1993, pp. 33–50
- Enomoto, 1987, Codes with given distances, Graphs Combin., 3, 25, 10.1007/BF01788526 · doi:10.1007/bf01788526
- Erdős, 1961, Theorem in the additive number theory, Bull. Res. Council Israel (F), 10, 41
- Gao, 1996, A combinatorial problem on finite Abelian groups, J. Number Theory, 58, 100, 10.1006/jnth.1996.0067 · DOI · Paper page
- Gao, 2003, On zero-sum subsequences of restricted size II, Discrete Math., 271, 51, 10.1016/S0012-365X(03)00038-4 · DOI · Paper page
- Geroldinger, 1992, On Davenport’s constant, J. Combin. Theory Ser. A, 61, 147, 10.1016/0097-3165(92)90061-X · DOI · Paper page
- Luca, 2007, A generalization of a classical zero-sum problem, Discrete Math., 307, 1672, 10.1016/j.disc.2006.09.002 · DOI
- Olson, 1969, A combinatorial problem on finite Abelian groups, I, J. Number Theory, 1, 8, 10.1016/0022-314X(69)90021-3 · DOI
- Olson, 1969, A combinatorial problem on finite Abelian groups, II, J. Number Theory, 1, 195, 10.1016/0022-314X(69)90037-7 · DOI
- Thangadurai, 2007, A variant of Davenport’s constant, Proc. Indian Acad. Sci. Math. Sci., 117, 147, 10.1007/s12044-007-0010-4 · DOI
Cited by
Davenport constant with weights
Yuan, P., & Zeng, X. (2010) · European Journal of Combinatorics · doi:10.1016/j.ejc.2009.09.005 · Cited by 24
On a different weighted zero-sum constant
Mondal, S., Paul, K., & Paul, S. (2023) · Discrete Mathematics · doi:10.1016/j.disc.2023.113350 · Cited by 4
Metadata
- Authors
- Griffiths, S.
- Venue
- Discrete Mathematics
- Publisher
- Elsevier BV
- Published
- 2008-12
- Volume
- 308
- Issue
- 23
- Pages
- 5473-5484
- ISSN
- 0012-365X
- Cited by
- 20
- References
- 1
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 1689 d)
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.
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: The Erdős–Ginzberg–Ziv theorem with units. https://app.cochat.ai/papers/10.1016/j.disc.2007.09.060
- The paper
- Griffiths, S. (2008). The Erdős–Ginzberg–Ziv theorem with units. Discrete Mathematics. https://doi.org/10.1016/j.disc.2007.09.060
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.
