Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 265Advanced Combinatorial MathematicsLimits and Structures in Graph TheoryFinite Group Theory Research

The DOI matches its Crossref record; 149 of the 152 references it cites were found in a registry or an index.

Zero-sum problems in finite abelian groups: A survey

Open access
Gao, Weidong, Geroldinger, Alfred·2006·Expositiones Mathematicae
DOI 10.1016/j.exmath.2006.07.002
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1016/j.exmath.2006.07.002

Cites

149 of 149 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Research works printed but not linked: 20

  1. Bialostocki, 2000, Zero-sum ascending waves, J. Combin. Math. Combin. Comput., 32, 103
  2. Bialostocki, 1990, Zero sum Ramsey theorems, Congr. Numer., 70, 119
  3. A. Bialostocki, M. Lotspeich, Some developments of the Erdős–Ginzburg–Ziv theorem, in: Sets, Graphs and Numbers, vol. 60, Colloquia Mathematica Societatis Janos Bolyai, North-Holland, Amsterdam, New York, 1992, pp. 97–117.
  4. Chapman, 2002, On Davenport's constant of finite abelian groups, Far East J. Math. Sci., 2, 47
  5. Chiaselotti, 1993, Sums of distinct elements in finite abelian groups, Boll. Unione Mat. Ital., 7, 243
  6. Dimitrov, 2004, On the strong Davenport constant of nonabelian finite p-groups, Math. Balkica, 18, 131
  7. Erdős, 1961, Theorem in the additive number theory, Bull. Res. Council Israel, 10, 41
  8. M. Freeze, Lengths of factorizations in Dedekind domains, Ph.D. Thesis, University of North Carolina at Chapel Hill, 1999.
  9. Freeze, 2001, Sumsets of zerofree sequences, Arab J. Sci. Eng. Section C: Theme Issues, 26, 97
  10. Z. Füredi, D.J. Kleitman, The minimal number of zero sums. in: Combinatorics, Paul Erdős is Eighty, J. Bolyai Mathematical Society, 1993, pp. 159–172.
  11. Gallardo, 2000, On Brakemeier's variant of the Erdős–Ginzburg–Ziv problem, Tatra Mt. Math. Publ., 20, 91
  12. W. Gao, Some problems in additive group theory and number theory, Ph.D. Thesis, Sichuan University, Sichuan, PR China, 1994.
  13. Gao, 1996, An improvement of Erdős–Ginzburg–Ziv theorem, Acta Math. Sin., 39, 514
  14. Gao, 2000, Zero sums in finite cyclic groups, Integers, 0, 9
  15. Kemnitz, 1983, On a lattice point problem, Ars. Combin., 16-B, 151
  16. Krause, 1991, Arithmetic in Krull monoids and the cross number of divisor class groups, Mitt. Math. Ges. Hamb., 12, 681
  17. E. Lipkin, Subset sums of sets of residues. in: Structure Theory of Set Addition, vol. 258, Astérisque, 1999, pp. 187–192.
  18. Ordaz, 2006, On zero-free sets, Divulg. Mat., 14, 1
  19. Schmid, 2005, Half-factorial sets in finite abelian groups: a survey, Grazer Math. Ber., 348, 41
  20. Skałba, 1992, The relative Davenport's constant of the group Zn×Zn, Grazer Math. Ber., 318, 167

Cited by

See all 265

Related

See all

Metadata

Authors
Gao, W., & Geroldinger, A.
Affiliations
  • Nankai University (CN)
  • University of Graz (AT)
Corresponding author
Geroldinger, Alfred
ORCID
Venue
Expositiones Mathematicae
Publisher
Elsevier BV
Published
2006-11
Volume
24
Issue
4
Pages
337-369
ISSN
0723-0869 (ISSN-L)
DOI
10.1016/j.exmath.2006.07.002
OpenAlex
W2121001629
Cited by
262
References
152
Citations by year
2026: 19 · 2025: 13 · 2024: 13 · 2023: 11 · 2022: 15 · 2021: 15 · 2020: 18 · 2019: 14 · 2018: 11 · 2017: 10 · 2016: 3 · 2015: 13 · 2014: 13 · 2013: 13 · 2012: 11
FWCI
17.93
Type
journal article
Language
en
Open access
Licence
Locations
Expositiones Mathematicae (publishedVersion)
Funders
  • National Natural Science Foundation of China
  • Austrian Science Fund
Topics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Finite Group Theory Research
Keywords
zero-sum problems, finite abelian groups, combinatorial number theory, Davenport constant, algebraic invariants

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

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.