Zero-sum Problems

Zero-Sum Problems is a research framework in additive combinatorics and combinatorial number theory that investigates the conditions under which a finite sequence of elements in an abelian group necessarily contains a nonempty subsequence whose sum is zero, distinguished from related problems by its focus on structural properties of sequences and their zero-sum subsequences in relation to group-theoretic and combinatorial invariants.

685

Publications

31.9K

Citations

1.1K

Authors

583

Institutions

Publications per year

2017–2026

127

Authors

1.1K

  1. WG
    Weidong Gao

    Jiangnan University, China

    24 publications · 763 citations

    15

    h-index

  2. AG
    Alfred Geroldinger

    University of Graz, Austria

    10 publications · 571 citations

    11

    h-index

  3. WS
    Wolfgang Schmid

    European University Viadrina, Germany

    9 publications · 227 citations

    9

    h-index

  4. PE
    P. Erdös

    Hungarian Academy of Sciences, Hungary

    8 publications · 706 citations

    8

    h-index

  5. TB
    Tamer Başar

    University of Illinois Urbana-Champaign, United States

    7 publications · 499 citations

    7

    h-index

1–5 of 1.1K

Venues

  1. arXiv (Cornell University)

    Repository · 19 publications · 837 citations

    15

    h-index

  2. Journal of Number Theory

    17 publications · 383 citations

    14

    h-index

  3. Discrete Mathematics

    18 publications · 1K citations

    14

    h-index

  4. Acta Arithmetica

    16 publications · 444 citations

    13

    h-index

  5. 10

    h-index

1–5