Sums of two squares in arithmetic progressionsSums of two squares in (certain) integral domainsIs there another simple formula for the sum-of-squares function?Exact formula for the number of integers in an interval which are the sum of two squares.Arithmetic Progressions of SquaresSpecial arithmetic progressions involving perfect squaresSums of two same powers modulo $p$Sums of two squares: What is known about the distribution of r(n)?Primes in arithmetic progressions in number fieldsJacobi's theorem on sums of two squares (reference request)Sums of two integer squares in arithmetic progressions

Sums of two squares in arithmetic progressions


Sums of two squares in (certain) integral domainsIs there another simple formula for the sum-of-squares function?Exact formula for the number of integers in an interval which are the sum of two squares.Arithmetic Progressions of SquaresSpecial arithmetic progressions involving perfect squaresSums of two same powers modulo $p$Sums of two squares: What is known about the distribution of r(n)?Primes in arithmetic progressions in number fieldsJacobi's theorem on sums of two squares (reference request)Sums of two integer squares in arithmetic progressions













6












$begingroup$


Let $r(n)$ denote the number of representations of $n$ as the sum of two squares. Are there any known results on $$sum _nleq xatop nequiv a(q)r(n)$$ and in particular is there an asymptotic formula?










share|cite|improve this question











$endgroup$











  • $begingroup$
    If we fix $a, q$ and increase $x$, isn't this essentially the Gauss circle problem with some shift in the lattice?
    $endgroup$
    – Dongryul Kim
    5 hours ago















6












$begingroup$


Let $r(n)$ denote the number of representations of $n$ as the sum of two squares. Are there any known results on $$sum _nleq xatop nequiv a(q)r(n)$$ and in particular is there an asymptotic formula?










share|cite|improve this question











$endgroup$











  • $begingroup$
    If we fix $a, q$ and increase $x$, isn't this essentially the Gauss circle problem with some shift in the lattice?
    $endgroup$
    – Dongryul Kim
    5 hours ago













6












6








6


1



$begingroup$


Let $r(n)$ denote the number of representations of $n$ as the sum of two squares. Are there any known results on $$sum _nleq xatop nequiv a(q)r(n)$$ and in particular is there an asymptotic formula?










share|cite|improve this question











$endgroup$




Let $r(n)$ denote the number of representations of $n$ as the sum of two squares. Are there any known results on $$sum _nleq xatop nequiv a(q)r(n)$$ and in particular is there an asymptotic formula?







nt.number-theory reference-request arithmetic-progression sums-of-squares






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 4 hours ago









Martin Sleziak

3,09032231




3,09032231










asked 6 hours ago









cawscaws

562




562











  • $begingroup$
    If we fix $a, q$ and increase $x$, isn't this essentially the Gauss circle problem with some shift in the lattice?
    $endgroup$
    – Dongryul Kim
    5 hours ago
















  • $begingroup$
    If we fix $a, q$ and increase $x$, isn't this essentially the Gauss circle problem with some shift in the lattice?
    $endgroup$
    – Dongryul Kim
    5 hours ago















$begingroup$
If we fix $a, q$ and increase $x$, isn't this essentially the Gauss circle problem with some shift in the lattice?
$endgroup$
– Dongryul Kim
5 hours ago




$begingroup$
If we fix $a, q$ and increase $x$, isn't this essentially the Gauss circle problem with some shift in the lattice?
$endgroup$
– Dongryul Kim
5 hours ago










1 Answer
1






active

oldest

votes


















11












$begingroup$

The first result in this direction seems to be due to R. A. Smith, ``The Circle Problem in an Arithmetic Progression,'' Can. Math. Bull. 11 (2), 175–184 (1968). He showed that if we write
$$sum _nleq xatop nequiv a(q)r(n) =pi x cdot fraceta_a(q)q^2+ R_q,a(x)$$
where $eta_a(q) := (x_1,x_2) in (mathbbZ/qmathbbZ)^2 : x_1^2 +x_2^2 equiv a bmod q$, then
$$R_q,a(x) = Oleft( x^frac23 + xi q^-frac12(1+3xi)gcd(a,q)^1/2tau(q) right)$$
for any $xi in (0,1/3)$. This is non-trivial for $q le x^frac23-varepsilon$. In particular, as $x$ tends to infinity, your expression is asymptotic to $pi x$ times the probability that $x_1^2+x_2^2 equiv a bmod q$ (for uniformly drawn $x_1,x_2$ mod $q$). If you consider $a$ and $q$ as fixed, this answers your question.



The state-of-the-art result is due to D. I. Tolev, ``On the remainder term in the circle problem in an arithmetic progression,'' Tr. Mat. Inst. Steklova 276 (2012), Teoriya Chisel, Algebra i Analiz, 266--279; translation in Proc. Steklov Inst. Math. 276 (2012), no. 1, 261–274. He showed that
$$R_q,a(x) = Oleft( (q^frac12+x^frac13) gcd(a,q)^1/2tau^4(q)log^4 x right).$$
Interestingly, for $a=1$, there is a result which is superior in certain ranges of $x$ and $q$, see P. D. Varbanets, “Lattice Points in a Circle Whose Distances from the Center Are in an Arithmetic Progression,” Mat. Zametki 8 (6), 787–798 (1970) [Math. Notes 8, 917–923 (1970)].



All three results are explained in Tolev's paper.




In the 2002 PhD thesis of Michael J. Dancs under R. Vaughn, titled "On a Variance arising in the Gauss Circle Problem", he proves (independently of the above) that
$$f(q,a):=lim_x to infty fracsum _nleq xatop nequiv a(q)r(n) pi x$$
exists and can be written as
$$f(q,a)=q^-3 sum_k=1^q expleft( 2pi i frac-akq right) S(q,k)^2,$$
where $S(q,a)$ is a quadratic Gauss sum mod $q$. This gives a different expression for $eta_a(q)/q^2$, which was better suited for the applications given by Dancs. This is done in Theorem 2.1. He then proceeds to prove, in Theorem 2.2, the estimate
$$R_q,a(x) = Oleft( (sqrtx+q) log qright).$$
For small $q$ this is better than Smith's work. Still, it is superseded by Tolev's estimates.






share|cite|improve this answer











$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function ()
    return StackExchange.using("mathjaxEditing", function ()
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    );
    );
    , "mathjax-editing");

    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "504"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326964%2fsums-of-two-squares-in-arithmetic-progressions%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    11












    $begingroup$

    The first result in this direction seems to be due to R. A. Smith, ``The Circle Problem in an Arithmetic Progression,'' Can. Math. Bull. 11 (2), 175–184 (1968). He showed that if we write
    $$sum _nleq xatop nequiv a(q)r(n) =pi x cdot fraceta_a(q)q^2+ R_q,a(x)$$
    where $eta_a(q) := (x_1,x_2) in (mathbbZ/qmathbbZ)^2 : x_1^2 +x_2^2 equiv a bmod q$, then
    $$R_q,a(x) = Oleft( x^frac23 + xi q^-frac12(1+3xi)gcd(a,q)^1/2tau(q) right)$$
    for any $xi in (0,1/3)$. This is non-trivial for $q le x^frac23-varepsilon$. In particular, as $x$ tends to infinity, your expression is asymptotic to $pi x$ times the probability that $x_1^2+x_2^2 equiv a bmod q$ (for uniformly drawn $x_1,x_2$ mod $q$). If you consider $a$ and $q$ as fixed, this answers your question.



    The state-of-the-art result is due to D. I. Tolev, ``On the remainder term in the circle problem in an arithmetic progression,'' Tr. Mat. Inst. Steklova 276 (2012), Teoriya Chisel, Algebra i Analiz, 266--279; translation in Proc. Steklov Inst. Math. 276 (2012), no. 1, 261–274. He showed that
    $$R_q,a(x) = Oleft( (q^frac12+x^frac13) gcd(a,q)^1/2tau^4(q)log^4 x right).$$
    Interestingly, for $a=1$, there is a result which is superior in certain ranges of $x$ and $q$, see P. D. Varbanets, “Lattice Points in a Circle Whose Distances from the Center Are in an Arithmetic Progression,” Mat. Zametki 8 (6), 787–798 (1970) [Math. Notes 8, 917–923 (1970)].



    All three results are explained in Tolev's paper.




    In the 2002 PhD thesis of Michael J. Dancs under R. Vaughn, titled "On a Variance arising in the Gauss Circle Problem", he proves (independently of the above) that
    $$f(q,a):=lim_x to infty fracsum _nleq xatop nequiv a(q)r(n) pi x$$
    exists and can be written as
    $$f(q,a)=q^-3 sum_k=1^q expleft( 2pi i frac-akq right) S(q,k)^2,$$
    where $S(q,a)$ is a quadratic Gauss sum mod $q$. This gives a different expression for $eta_a(q)/q^2$, which was better suited for the applications given by Dancs. This is done in Theorem 2.1. He then proceeds to prove, in Theorem 2.2, the estimate
    $$R_q,a(x) = Oleft( (sqrtx+q) log qright).$$
    For small $q$ this is better than Smith's work. Still, it is superseded by Tolev's estimates.






    share|cite|improve this answer











    $endgroup$

















      11












      $begingroup$

      The first result in this direction seems to be due to R. A. Smith, ``The Circle Problem in an Arithmetic Progression,'' Can. Math. Bull. 11 (2), 175–184 (1968). He showed that if we write
      $$sum _nleq xatop nequiv a(q)r(n) =pi x cdot fraceta_a(q)q^2+ R_q,a(x)$$
      where $eta_a(q) := (x_1,x_2) in (mathbbZ/qmathbbZ)^2 : x_1^2 +x_2^2 equiv a bmod q$, then
      $$R_q,a(x) = Oleft( x^frac23 + xi q^-frac12(1+3xi)gcd(a,q)^1/2tau(q) right)$$
      for any $xi in (0,1/3)$. This is non-trivial for $q le x^frac23-varepsilon$. In particular, as $x$ tends to infinity, your expression is asymptotic to $pi x$ times the probability that $x_1^2+x_2^2 equiv a bmod q$ (for uniformly drawn $x_1,x_2$ mod $q$). If you consider $a$ and $q$ as fixed, this answers your question.



      The state-of-the-art result is due to D. I. Tolev, ``On the remainder term in the circle problem in an arithmetic progression,'' Tr. Mat. Inst. Steklova 276 (2012), Teoriya Chisel, Algebra i Analiz, 266--279; translation in Proc. Steklov Inst. Math. 276 (2012), no. 1, 261–274. He showed that
      $$R_q,a(x) = Oleft( (q^frac12+x^frac13) gcd(a,q)^1/2tau^4(q)log^4 x right).$$
      Interestingly, for $a=1$, there is a result which is superior in certain ranges of $x$ and $q$, see P. D. Varbanets, “Lattice Points in a Circle Whose Distances from the Center Are in an Arithmetic Progression,” Mat. Zametki 8 (6), 787–798 (1970) [Math. Notes 8, 917–923 (1970)].



      All three results are explained in Tolev's paper.




      In the 2002 PhD thesis of Michael J. Dancs under R. Vaughn, titled "On a Variance arising in the Gauss Circle Problem", he proves (independently of the above) that
      $$f(q,a):=lim_x to infty fracsum _nleq xatop nequiv a(q)r(n) pi x$$
      exists and can be written as
      $$f(q,a)=q^-3 sum_k=1^q expleft( 2pi i frac-akq right) S(q,k)^2,$$
      where $S(q,a)$ is a quadratic Gauss sum mod $q$. This gives a different expression for $eta_a(q)/q^2$, which was better suited for the applications given by Dancs. This is done in Theorem 2.1. He then proceeds to prove, in Theorem 2.2, the estimate
      $$R_q,a(x) = Oleft( (sqrtx+q) log qright).$$
      For small $q$ this is better than Smith's work. Still, it is superseded by Tolev's estimates.






      share|cite|improve this answer











      $endgroup$















        11












        11








        11





        $begingroup$

        The first result in this direction seems to be due to R. A. Smith, ``The Circle Problem in an Arithmetic Progression,'' Can. Math. Bull. 11 (2), 175–184 (1968). He showed that if we write
        $$sum _nleq xatop nequiv a(q)r(n) =pi x cdot fraceta_a(q)q^2+ R_q,a(x)$$
        where $eta_a(q) := (x_1,x_2) in (mathbbZ/qmathbbZ)^2 : x_1^2 +x_2^2 equiv a bmod q$, then
        $$R_q,a(x) = Oleft( x^frac23 + xi q^-frac12(1+3xi)gcd(a,q)^1/2tau(q) right)$$
        for any $xi in (0,1/3)$. This is non-trivial for $q le x^frac23-varepsilon$. In particular, as $x$ tends to infinity, your expression is asymptotic to $pi x$ times the probability that $x_1^2+x_2^2 equiv a bmod q$ (for uniformly drawn $x_1,x_2$ mod $q$). If you consider $a$ and $q$ as fixed, this answers your question.



        The state-of-the-art result is due to D. I. Tolev, ``On the remainder term in the circle problem in an arithmetic progression,'' Tr. Mat. Inst. Steklova 276 (2012), Teoriya Chisel, Algebra i Analiz, 266--279; translation in Proc. Steklov Inst. Math. 276 (2012), no. 1, 261–274. He showed that
        $$R_q,a(x) = Oleft( (q^frac12+x^frac13) gcd(a,q)^1/2tau^4(q)log^4 x right).$$
        Interestingly, for $a=1$, there is a result which is superior in certain ranges of $x$ and $q$, see P. D. Varbanets, “Lattice Points in a Circle Whose Distances from the Center Are in an Arithmetic Progression,” Mat. Zametki 8 (6), 787–798 (1970) [Math. Notes 8, 917–923 (1970)].



        All three results are explained in Tolev's paper.




        In the 2002 PhD thesis of Michael J. Dancs under R. Vaughn, titled "On a Variance arising in the Gauss Circle Problem", he proves (independently of the above) that
        $$f(q,a):=lim_x to infty fracsum _nleq xatop nequiv a(q)r(n) pi x$$
        exists and can be written as
        $$f(q,a)=q^-3 sum_k=1^q expleft( 2pi i frac-akq right) S(q,k)^2,$$
        where $S(q,a)$ is a quadratic Gauss sum mod $q$. This gives a different expression for $eta_a(q)/q^2$, which was better suited for the applications given by Dancs. This is done in Theorem 2.1. He then proceeds to prove, in Theorem 2.2, the estimate
        $$R_q,a(x) = Oleft( (sqrtx+q) log qright).$$
        For small $q$ this is better than Smith's work. Still, it is superseded by Tolev's estimates.






        share|cite|improve this answer











        $endgroup$



        The first result in this direction seems to be due to R. A. Smith, ``The Circle Problem in an Arithmetic Progression,'' Can. Math. Bull. 11 (2), 175–184 (1968). He showed that if we write
        $$sum _nleq xatop nequiv a(q)r(n) =pi x cdot fraceta_a(q)q^2+ R_q,a(x)$$
        where $eta_a(q) := (x_1,x_2) in (mathbbZ/qmathbbZ)^2 : x_1^2 +x_2^2 equiv a bmod q$, then
        $$R_q,a(x) = Oleft( x^frac23 + xi q^-frac12(1+3xi)gcd(a,q)^1/2tau(q) right)$$
        for any $xi in (0,1/3)$. This is non-trivial for $q le x^frac23-varepsilon$. In particular, as $x$ tends to infinity, your expression is asymptotic to $pi x$ times the probability that $x_1^2+x_2^2 equiv a bmod q$ (for uniformly drawn $x_1,x_2$ mod $q$). If you consider $a$ and $q$ as fixed, this answers your question.



        The state-of-the-art result is due to D. I. Tolev, ``On the remainder term in the circle problem in an arithmetic progression,'' Tr. Mat. Inst. Steklova 276 (2012), Teoriya Chisel, Algebra i Analiz, 266--279; translation in Proc. Steklov Inst. Math. 276 (2012), no. 1, 261–274. He showed that
        $$R_q,a(x) = Oleft( (q^frac12+x^frac13) gcd(a,q)^1/2tau^4(q)log^4 x right).$$
        Interestingly, for $a=1$, there is a result which is superior in certain ranges of $x$ and $q$, see P. D. Varbanets, “Lattice Points in a Circle Whose Distances from the Center Are in an Arithmetic Progression,” Mat. Zametki 8 (6), 787–798 (1970) [Math. Notes 8, 917–923 (1970)].



        All three results are explained in Tolev's paper.




        In the 2002 PhD thesis of Michael J. Dancs under R. Vaughn, titled "On a Variance arising in the Gauss Circle Problem", he proves (independently of the above) that
        $$f(q,a):=lim_x to infty fracsum _nleq xatop nequiv a(q)r(n) pi x$$
        exists and can be written as
        $$f(q,a)=q^-3 sum_k=1^q expleft( 2pi i frac-akq right) S(q,k)^2,$$
        where $S(q,a)$ is a quadratic Gauss sum mod $q$. This gives a different expression for $eta_a(q)/q^2$, which was better suited for the applications given by Dancs. This is done in Theorem 2.1. He then proceeds to prove, in Theorem 2.2, the estimate
        $$R_q,a(x) = Oleft( (sqrtx+q) log qright).$$
        For small $q$ this is better than Smith's work. Still, it is superseded by Tolev's estimates.







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited 4 hours ago

























        answered 5 hours ago









        Ofir GorodetskyOfir Gorodetsky

        5,83812539




        5,83812539



























            draft saved

            draft discarded
















































            Thanks for contributing an answer to MathOverflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326964%2fsums-of-two-squares-in-arithmetic-progressions%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            What is the best defense strategy for Survival in Grand Theft Auto Online?What is JP used for in Grand Theft Auto Online?How do I setup a Crew HQ in Grand Theft Auto Online?How does stealth work in Grand Theft Auto Online?Is it possible to own more than 10 cars in Grand Theft Auto online?Where to find truck/trailers in Grand Theft Auto OnlineWhat are some of the best missions to do on Grand Theft Auto 5 onlineFastest Car in Grand Theft Auto V PCHow to setup a Crew vs Crew online session in Grand Theft Auto Online?Grand theft auto 5 crossplayingRestart Grand Theft Auto V Online?

            Благоевград Съдържание География | История | Население | Политика | Икономика и инфрастуктура | Здравеопазване | Образование и наука | Култура и забавления | Забележителности | Личности | Литература | Външни препратки | Бележки | Навигация42°01′18.99″ с. ш. 23°05′51″ и. д. / 42.021944° с. ш. 23.0975° и. д.*БлагоевградразширитередактиранеОфициален уебсайт на община БлагоевградНовинарски портал на Благоевград – blagoevgrad.euСайтове за БлагоевградНационален статистически институтdariknews.bgГригоровичъ, Викторъ. „Очеркъ путешествія по Европейской Турціи“. Москва, 1877.Стрезов, Георги. Два санджака от Източна Македония. Периодично списание на Българското книжовно дружество в Средец, кн. XXXVII и XXXVIII, 1891, стр. 18 – 19.Македония. Етнография и статистикаГаджанов, Димитър Г. Мюсюлманското население в Новоосвободените земи, в: Научна експедиция в Македония и Поморавието 1916, Военноиздателски комплекс „Св. Георги Победоносец“, Университетско издателство „Св. Климент Охридски“, София, 1993, стр. 244.паметник на незнайния четник&cd=18&hl=en&ct=clnk&client=firefox-a „История на днешен Благоевград“, взето от www.museumblg.com на 16 март 2010 г.„Справка за населението на град Благоевград, община Благоевград, област Благоевград, НСИ“„The population of all towns and villages in Blagoevgrad Province with 50 inhabitants or more according to census results and latest official estimates“„Ethnic composition, all places: 2011 census“История на Неврокопска епархия.Национален статистически институтМюсюлманско изповедание. Главно мюфтийствоНационален публичен регистър на храмовете в БългарияМюсюлманско изповедание. Главно мюфтийствоwww.dnes.bg Джамията в Благоевград не била паленаwww.sesc-bg.orgСписък на побратимени градовеТехническо побратимяванеГУМ грейва в цветовете на нощен Лас Вегас под името „Largo“, „МОЛ Благоевград“..., в. „Струма“grabo.bgwww.cinemaxbg.comррр4238731-067cad53a-0546-417b-a3d3-51e49b1d2232147736077147736077

            Is it possible to log your Steam account into two computers at once? The Next CEO of Stack OverflowHow do I continue downloading a game in Steam while playing?Can I safely uninstall games purchased from Steam?Steam repeatedly pauses downloadsSteam game from Mac to PCCan I choose which library to install a game to using the remote-download feature?How to download Windows games from Steam onto a Linux computer?Steam Chat completely dropping messagesThe Steam App Won't Connect to WifiWhy is my Steam Client acting so slow?What else do I need to copy over/edit to make my game appear in the Steam Library?Downloading Steam games on different family laptops