CoChat

Generalization of some weighted zero-sum theorems

Sarkar, Subha · 2021 · Proceedings - Mathematical Sciences
Cited by 1

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

Abstract

Let G be a finite abelian group of exponent n and let A be a non-empty subset of [1,n-1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[1,n-1]$$\end{document}. The Davenport constant of G with weight A, denoted by DA(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_A(G)$$\end{document}, is defined to be the least positive integer ℓ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document} such that any sequence over G of length ℓ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document} has a non-empty A-weighted zero-sum subsequence. Similarly, the combinatorial invariant EA(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_{A}(G)$$\end{document} is defined to be the least positive integer ℓ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document} such that any sequence over G of length ℓ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document} has an A-weighted zero-sum subsequence of length |G|. In this article, we consider the problem of determining an upper bound of the constants EA(Z/nZ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E_A({\mathbb {Z}}/n{\mathbb {Z}})$$\end{document} and DA(Z/nZ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_A({\mathbb {Z}}/n{\mathbb {Z}})$$\end{document}, where A is the set of all cubes in (Z/nZ)∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$({\mathbb {Z}}/n{\mathbb {Z}})^*$$\end{document}.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1007/s12044-021-00631-w

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Research works printed but not linked: 12

  1. Adhikari S D, Balasubramanian R, Pappalardi F and Rath P, Some zero-sum constants with weights, Proc. Indian Acad. Sci. (Math. Sci.) 118(2) (2008) 183–188 · DOI · Paper page
  2. Adhikari S D, Chen Y G, Friedlander J B, Konyagin S V and Pappalardi F, Contributions to zero-sum problems, Discrete Math. 306(1) (2006) 1–10 · DOI · Paper page
  3. Adhikari S D, David C and Urroz J J, Generalizations of some zero-sum theorems, Integers 8, (2008) A52
  4. Adhikari S D and Rath P, Davenport constant with weights and some related questions, Integers 6 (2006) A30
  5. Chintamani M N and Moriya B K, Generalizations of some zero sum theorems, Proc. Indian Acad. Sci. (Math. Sci.) 122(1) (2012) 15–21 · DOI · Paper page
  6. Erdős P, Ginzburg A and Ziv A, Theorem in additive number theory, Bull. Res. Council Israel Sect. F 10F(1) (1961) 41–43
  7. Gao W D, A combinatorial problem on finite abelian groups, J. Number Theory 58(1) (1996) 100–103 · DOI · Paper page
  8. Griffiths S, The Erdős–Ginzburg–Ziv theorem with units, Discrete Math. 308(23) (2008) 5473–5484 · DOI · Paper page
  9. Grynkiewicz D J, Marchan L E and Ordaz O, A weighted generalization of two theorems of Gao, Ramanujan J. 28(3) (2012) 323–340 · DOI · Paper page
  10. Luca F, A generalization of a classical zero-sum problem, Discrete Math. 307(13) (2007) 1672–1678 · DOI
  11. Nathanson M B, Additive Number Theory: Inverse Problems and the Geometry of Sumsets (1996) (Berlin: Springer) · doi:10.1007/978-1-4757-3845-2
  12. Thangadurai R, A variant of Davenport’s constant, Proc. Indian Acad. Sci. (Math. Sci.) 117(2) (2007) 147–158 · DOI

Cited by

See all 1

Metadata

Authors
Sarkar, S.
Venue
Proceedings - Mathematical Sciences
Published
2021-10
Volume
131
Issue
2
ISSN
  • 0253-4142
  • 0973-7685
Cited by
0
References
3
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

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.