The asymptotic formula in Waring's problem for one square and seventeen fifth powers (Q533696): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The authors study the asymptotic formula for the number, \(R_{k,s}(n)\), of representations of a large positive integer \(n\) as the sum of a square and \(s\) \(k\)th powers, \(k\geq 3\). They prove several results of the form \[ R_{k,s}(n) = C_{k,s}{\mathfrak S}_{k,s}(n)n^{s/k-1/2}\left( C_{k,s} + o(1) \right), \eqno{(*)} \] where \(C_{k,s} = \Gamma(\frac 32)\Gamma(1+ \frac 1k)^s\Gamma(\frac sk)^{-1}\). First, they sketch the proof of (\(*\)) for \(k\geq 3\) and \(s\geq 2^{k-1}+2\) or \(s\geq k^2(\frac 12\log k + O(\log\log k))\). Those results use standard circle method technology, and the authors even state that ``it is therefore perhaps justified to consider [them] as part of folklore.'' After that overture, they move to establish (\(*\)) for \(k\geq 6\) and \(s\geq 7 \cdot 2^{k-4} + 3\) by an adaptation of the ideas of \textit{D. R. Heath-Brown} [J. Lond. Math. Soc. 38, No. 2, 216--230 (1988; Zbl 0619.10046)] and \textit{K. D. Boklan} [Mathematika 41, No. 2, 329--347 (1994; Zbl 0815.11050)]. The culmination of the paper is the proof of (\(*\)) in the titular case, \(k=5\) and \(s=17\). Here too the authors use Heath-Brown's ideas, but the necessary adjustments are much more significant, since the results in Heath-Brown's paper are only directly applicable to \(k\geq 6\).
Property / review text: The authors study the asymptotic formula for the number, \(R_{k,s}(n)\), of representations of a large positive integer \(n\) as the sum of a square and \(s\) \(k\)th powers, \(k\geq 3\). They prove several results of the form \[ R_{k,s}(n) = C_{k,s}{\mathfrak S}_{k,s}(n)n^{s/k-1/2}\left( C_{k,s} + o(1) \right), \eqno{(*)} \] where \(C_{k,s} = \Gamma(\frac 32)\Gamma(1+ \frac 1k)^s\Gamma(\frac sk)^{-1}\). First, they sketch the proof of (\(*\)) for \(k\geq 3\) and \(s\geq 2^{k-1}+2\) or \(s\geq k^2(\frac 12\log k + O(\log\log k))\). Those results use standard circle method technology, and the authors even state that ``it is therefore perhaps justified to consider [them] as part of folklore.'' After that overture, they move to establish (\(*\)) for \(k\geq 6\) and \(s\geq 7 \cdot 2^{k-4} + 3\) by an adaptation of the ideas of \textit{D. R. Heath-Brown} [J. Lond. Math. Soc. 38, No. 2, 216--230 (1988; Zbl 0619.10046)] and \textit{K. D. Boklan} [Mathematika 41, No. 2, 329--347 (1994; Zbl 0815.11050)]. The culmination of the paper is the proof of (\(*\)) in the titular case, \(k=5\) and \(s=17\). Here too the authors use Heath-Brown's ideas, but the necessary adjustments are much more significant, since the results in Heath-Brown's paper are only directly applicable to \(k\geq 6\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Angel V. Kumchev / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11P05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11P55 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5883638 / rank
 
Normal rank
Property / zbMATH Keywords
 
Waring's problem
Property / zbMATH Keywords: Waring's problem / rank
 
Normal rank
Property / zbMATH Keywords
 
asymptotic formula
Property / zbMATH Keywords: asymptotic formula / rank
 
Normal rank
Property / zbMATH Keywords
 
circle method
Property / zbMATH Keywords: circle method / rank
 
Normal rank
Property / zbMATH Keywords
 
sums of one square and powers
Property / zbMATH Keywords: sums of one square and powers / rank
 
Normal rank

Revision as of 09:29, 1 July 2023

scientific article
Language Label Description Also known as
English
The asymptotic formula in Waring's problem for one square and seventeen fifth powers
scientific article

    Statements

    The asymptotic formula in Waring's problem for one square and seventeen fifth powers (English)
    0 references
    0 references
    0 references
    4 May 2011
    0 references
    The authors study the asymptotic formula for the number, \(R_{k,s}(n)\), of representations of a large positive integer \(n\) as the sum of a square and \(s\) \(k\)th powers, \(k\geq 3\). They prove several results of the form \[ R_{k,s}(n) = C_{k,s}{\mathfrak S}_{k,s}(n)n^{s/k-1/2}\left( C_{k,s} + o(1) \right), \eqno{(*)} \] where \(C_{k,s} = \Gamma(\frac 32)\Gamma(1+ \frac 1k)^s\Gamma(\frac sk)^{-1}\). First, they sketch the proof of (\(*\)) for \(k\geq 3\) and \(s\geq 2^{k-1}+2\) or \(s\geq k^2(\frac 12\log k + O(\log\log k))\). Those results use standard circle method technology, and the authors even state that ``it is therefore perhaps justified to consider [them] as part of folklore.'' After that overture, they move to establish (\(*\)) for \(k\geq 6\) and \(s\geq 7 \cdot 2^{k-4} + 3\) by an adaptation of the ideas of \textit{D. R. Heath-Brown} [J. Lond. Math. Soc. 38, No. 2, 216--230 (1988; Zbl 0619.10046)] and \textit{K. D. Boklan} [Mathematika 41, No. 2, 329--347 (1994; Zbl 0815.11050)]. The culmination of the paper is the proof of (\(*\)) in the titular case, \(k=5\) and \(s=17\). Here too the authors use Heath-Brown's ideas, but the necessary adjustments are much more significant, since the results in Heath-Brown's paper are only directly applicable to \(k\geq 6\).
    0 references
    Waring's problem
    0 references
    asymptotic formula
    0 references
    circle method
    0 references
    sums of one square and powers
    0 references

    Identifiers