Waring's Problem
Waring's Problem is a foundational question in additive number theory that seeks to determine, for each positive integer $ k $, the smallest integer $ g(k) $ such that every natural number can be expressed as a sum of at most $ g(k) $ $ k $-th powers of non-negative integers.
111
Publications
3.4K
Citations
104
Authors
67
Institutions
Publications per year
2017–2026
6
111
Vinogradov's mean value theorem via efficient congruencing
Trevor D. Wooley · Annals of Mathematics · 2012 · 112 citations · Full text
Word maps and Waring type problems
Michael Larsen, Aner Shalev · Journal of the American Mathematical Society · 2008 · 91 citations · Full text
1–5 of 111
104
13
h-index
9
h-index
8
h-index
4
h-index
3
h-index
1–5 of 104
67
University of Michigan
Ann Arbor, United States
9 h-index
10 publications
347 citations

Imperial College London
London, United Kingdom
5 h-index
5 publications
173 citations

University of Bristol
Bristol, United Kingdom
4 h-index
4 publications
167 citations
University of Stuttgart
Stuttgart, Germany
4 h-index
4 publications
79 citations

Iwate University
Morioka, Japan
4 h-index
4 publications
130 citations
Indiana University Bloomington
Bloomington, United States
3 h-index
3 publications
196 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
3 publications
196 citations
Shandong University
Jinan, China
3 h-index
4 publications
68 citations
1–8 of 67
13 publications · 223 citations
11
h-index
8 publications · 287 citations
8
h-index
7 publications · 160 citations
7
h-index
6 publications · 126 citations
6
h-index
5 publications · 90 citations
5
h-index
1–5