By elementary (no ``circle method allowed), albeit clever, methods the author gives an upper bound \(B(k)\) for the minimal number \(g(k)\) of \(k\)-th powers necessary to write any positive integer as as sum of \(g(k)\) \(k\)-th powers of positive integers. Indeed \[ B(k) := k^{(15+o(1))(2k)^{5}}, \] improving on previous results of this kind. Some historical background on the problem is recalled.
Recommendations
Cites work
- A simplified proof of Waring's conjecture
- An Easier Waring's Problem
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Errata: Theorie additive des nombres: probleme de Waring et theoreme de Hilbert
- scientific article; zbMATH DE number 3124878 (Why is no real title available?)
- scientific article; zbMATH DE number 3758416 (Why is no real title available?)
- scientific article; zbMATH DE number 3596941 (Why is no real title available?)
- scientific article; zbMATH DE number 3373842 (Why is no real title available?)
- scientific article; zbMATH DE number 3085851 (Why is no real title available?)
- scientific article; zbMATH DE number 3105558 (Why is no real title available?)
- On Waring's problem (elementary methods)
- The Hardy-Littlewood method.
- Zur Hilbertschen Lösung des Waringschen Problems: Abschätzung von \(g(n)\)
Cited in
(8)- On a Hilbert identity
- On the conical hull of moment vectors
- scientific article; zbMATH DE number 1320667 (Why is no real title available?)
- Moments tensors, Hilbert's identity, and \(k\)-wise uncorrelated random variables
- A purely combinatorial approach to simultaneous polynomial recurrence modulo 1
- Finding the four squares in Lagrange's theorem
- On Waring's problem (elementary methods)
- Computers as a novel mathematical reality. II: Waring's problem
This page was built for publication: On Hilbert's solution of Waring's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539203)
