The Waring Problem is a foundational question in additive number theory that seeks to determine the smallest number of \( k \)-th powers of integers required to represent every natural number as their sum.
121
Publications
3.8K
Citations
108
Authors
69
Institutions
Publications per year
2017–2026
6
Parents
Publications
121
Computational excursions in analysis and number theory
Choice Reviews Online · 2003 · 158 citations
Vinogradov's mean value theorem via efficient congruencing
Trevor D. Wooley · Annals of Mathematics · 2012 · 112 citations · Full text
1–5 of 121
Authors
108
- TD
13
h-index
- RC
9
h-index
- JB
7
h-index
- AS
4
h-index
- HD
4
h-index
1–5 of 108
Institutions
69
University of Michigan
Ann Arbor, United States
11 h-index
12 publications
429 citations
Imperial College London
London, United Kingdom
5 h-index
5 publications
173 citations
University of Stuttgart
Stuttgart, Germany
4 h-index
4 publications
79 citations
University of Bristol
Bristol, United Kingdom
4 h-index
4 publications
167 citations
Iwate University
Morioka, Japan
4 h-index
4 publications
130 citations
University of Ferrara
Ferrara, Italy
3 h-index
4 publications
138 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
3 publications
196 citations
Pennsylvania State University
State College, United States
3 h-index
3 publications
68 citations
1–8 of 69
Venues
- Acta Arithmetica
14 publications · 236 citations
11
h-index
- Proceedings of the London Mathematical Society
9 publications · 302 citations
9
h-index
- Mathematical Proceedings of the Cambridge Philosophical Society
8 publications · 185 citations
8
h-index
- The Quarterly Journal of Mathematics
6 publications · 100 citations
6
h-index
- Journal of the London Mathematical Society
6 publications · 165 citations
6
h-index
1–5