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
685
M. Golay · IEEE Transactions on Information Theory · 1961 · 1.5K citations
Combinatorial Properties of Matrices of Zeros and Ones
H. J. Ryser · Canadian Journal of Mathematics · 1957 · 510 citations · Full text
1–5 of 685
1.1K
15
h-index
11
h-index
9
h-index
8
h-index
7
h-index
1–5 of 1.1K
583
University of Graz
Graz, Austria
12 h-index
19 publications
881 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
17 publications
415 citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
22 publications
1.5K citations

Sorbonne Université
Paris, France
10 h-index
10 publications
206 citations

China University of Petroleum, Beijing
Beijing, China
10 h-index
12 publications
240 citations

Nankai University
Tianjin, China
10 h-index
17 publications
604 citations
Harish-Chandra Research Institute
Allahabad, India
9 h-index
11 publications
253 citations

Tel Aviv University
Tel Aviv, Israel
8 h-index
13 publications
502 citations
1–8 of 583
Repository · 19 publications · 837 citations
15
h-index
17 publications · 383 citations
14
h-index
18 publications · 1K citations
14
h-index
16 publications · 444 citations
13
h-index
10 publications · 259 citations
10
h-index
1–5