Sum Combinations
Sum Combinations is a mathematical construct in the field of arithmetic that denotes the set of all possible pairwise additions of elements from a given finite set of numbers, distinguished by its focus on exhaustively generating resultant sums through systematic combination rather than on individual operational instances.
13
Publications
1.3K
Citations
22
Authors
14
Institutions
Publications per year
2017–2026
0
Parents
13
O. J. Bedrij · IRE Transactions on Electronic Computers · 1962 · 391 citations
Riordan arrays and combinatorial sums
Renzo Sprugnoli · Discrete Mathematics · 1994 · 329 citations
Effect of combinations : mathematical basis of problem
S. Loewe · Medical Entomology and Zoology · 1926 · 237 citations
1–5 of 13
22
University of Illinois Urbana-Champaign, United States
2 publications · 145 citations
2
h-index
1
h-index
1 publications · 32 citations
1
h-index
1
h-index
1
h-index
1–5 of 22
14
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
4 publications
351 citations
Poughkeepsie Public Library District
Poughkeepsie, United States
1 h-index
1 publications
391 citations
Utah Valley University
Orem, United States
1 h-index
1 publications
11 citations
Luleå University of Technology
Luleå, Sweden
1 h-index
2 publications
30 citations

Monash University
Melbourne, Australia
1 h-index
1 publications
23 citations
Geneva College
Beaver Falls, United States
1 h-index
2 publications
72 citations

University of Genoa
Genoa, Italy
1 h-index
2 publications
72 citations
University at Buffalo, State University of New York
Buffalo, United States
1 h-index
2 publications
28 citations
1–8 of 14
1 publications · 103 citations
1
h-index
JMB · 1 publications · 11 citations
1
h-index
Repository · 1 publications · 42 citations
1
h-index
JABA · 1 publications · 48 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5