Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 31

The DOI matches its Crossref record.

On zero-sum subsequences of restricted size II

Gao, W.D·2003·Discrete Mathematics
DOI 10.1016/s0012-365x(03)00038-4
Open this paper in CoChat — free account

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/s0012-365x(03)00038-4

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

No references could be resolved yet.

Research works printed but not linked: 24

  1. Alford, 1994, There are infinitely many Carmichael numbers, Ann. Math., 140, 703, 10.2307/2118576 · DOI · Paper page
  2. N. Alon, M. Dubiner, Zero-sum sets of prescribed size, in: Combinatorics, Paul Erdős is Eighty, Vol. 1, J. Bolyai Math. Soc. (1993) 33–50.
  3. Alon, 1995, A lattice point problem and additive number theory, Combinatorica, 15, 301, 10.1007/BF01299737 · DOI
  4. Alon, 1984, Regular subgraphs of almost regular graphs, J. Combin. Theory, 37B, 79, 10.1016/0095-8956(84)90047-9 · DOI
  5. Bialostocki, 1992, On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings, Discrete Math., 110, 1, 10.1016/0012-365X(92)90695-C · DOI
  6. Caro, 1995, Zero-sum subsequences in abelian non-cyclic groups, Israel J. Math., 92, 221, 10.1007/BF02762078 · DOI
  7. Caro, 1996, Zero-sum problems a survey, Discrete Math., 152, 93, 10.1016/0012-365X(94)00308-6 · DOI
  8. Erdős, 1961, A theorem in additive number theory, Bull Res. Council Israel, 10F, 41
  9. W.D. Gao, Some problems in additive number theory and additive group theory, Ph. D. Thesis, Sichuan University, 1994.
  10. Gao, 1996, On zero-sum subsequences with restricted size, J. Number Theory, 61, 97, 10.1006/jnth.1996.0140 · DOI
  11. Gao, 1996, Two addition theorems on groups of prime order, J. Number Theory, 56, 211, 10.1006/jnth.1996.0013 · DOI
  12. Gao, 1996, A combinatorial problem on finite abelian groups, J. Number Theory, 58, 100, 10.1006/jnth.1996.0067 · DOI · Paper page
  13. Gao, 1997, On a combinatorial problem connected with factorizations, Colloq. Math., 72, 251, 10.4064/cm-72-2-251-268 · doi:10.4064/cm-72-2-251-268
  14. Gao, 1997, Addition theorems and group rings, J. Combin. Theory, 77A, 98, 10.1006/jcta.1996.2731 · DOI
  15. Gao, 2000, On Davenport's constant of finite abelian group with rank three, Discrete Math., 222, 111, 10.1016/S0012-365X(00)00010-8 · DOI
  16. Gao, 2001, On zero-sum subsequence of restricted size III, Ars Combin., 61, 65
  17. Gao, 1999, On long minimal zero sequences in finite abelian groups, Period. Math. Hungar., 33, 179, 10.1023/A:1004854508165 · DOI
  18. Gao, 1997, Note on a combinatorial constant, J. Math. Res. Exposition, 17, 139
  19. Geroldinger, 1992, On Davenport's constant, J. Combin. Theory, 61A, 147, 10.1016/0097-3165(92)90061-X · DOI · Paper page
  20. Harborth, 1973, Ein Extremalproblem für Gitterpunkte, J. Reine Angew. Math., 262/263, 356
  21. Kemnitz, 1983, On a lattice point problem, Ars Combin., 16b, 151
  22. Olson, 1969, A combinatorial problem on finite abelian groups I, J. Number Theory, 1, 8, 10.1016/0022-314X(69)90021-3 · DOI
  23. Olson, 1969, A combinatorial problem on finite abelian groups II, J. Number Theory, 1, 195, 10.1016/0022-314X(69)90037-7 · DOI
  24. Sury, 1999, The Chevalley–Warning theorem and a combinatorial question on finite groups, Proc. Amer. Math. Soc., 127, 951, 10.1090/S0002-9939-99-04704-8 · DOI

Cited by

See all 31

Metadata

Authors
Gao, W. D.
Venue
Discrete Mathematics
Publisher
Elsevier BV
Published
2003-09
Volume
271
Issue
1-3
Pages
51-59
ISSN
0012-365X
DOI
10.1016/s0012-365x(03)00038-4
Cited by
31
References
0
Language
en
Licence

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: On zero-sum subsequences of restricted size II. https://app.cochat.ai/papers/10.1016/s0012-365x(03)00038-4
The paper
Gao, W. D. (2003). On zero-sum subsequences of restricted size II. Discrete Mathematics. https://doi.org/10.1016/s0012-365x(03)00038-4

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.