Calculating the infinite product from the Hardy-Littlewood Conjecture F - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-19T07:52:23Z http://mathoverflow.net/feeds/question/31150 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/31150/calculating-the-infinite-product-from-the-hardy-littlewood-conjecture-f Calculating the infinite product from the Hardy-Littlewood Conjecture F Charles 2010-07-09T03:15:00Z 2010-07-09T08:09:08Z <p>The Hardy-Littlewood Conjecture F [1] involves the infinite product $$\prod\left(1-\frac{1}{\varpi-1}\left(\frac D\varpi\right)\right)$$ where $\varpi$ ranges over the odd primes and $\left(\frac D\varpi\right)$ is the Legendre symbol.</p> <p>Is there a good way to calculate this? The product converges very slowly, and none of the standard methods (Cohen-Villegas-Zagier, Wynn, etc.) seem to work because of the unpredictable sign changes.</p> <p>Given that <em>D</em> is fixed, it suffices to calculate the partial products in various congruence classes; I don't know if this is a viable approach.</p> <p>Another possibility: I've seen almost magical series acceleration with the zeta function, it may work here.</p> <p>[1] G. H. Hardy, J. E. Littlewood. "Some of the problems of partitio numerorum III: On the expression of a large number as a sum of primes". <em>Acta Mathematica</em> <strong>44</strong> (1923), pp. 1-70.</p> http://mathoverflow.net/questions/31150/calculating-the-infinite-product-from-the-hardy-littlewood-conjecture-f/31151#31151 Answer by KConrad for Calculating the infinite product from the Hardy-Littlewood Conjecture F KConrad 2010-07-09T03:45:09Z 2010-07-09T03:55:15Z <p>I don't know what "the standard methods" means. Have you considered comparing this with a more conventional Euler product? First, I will write $p$ instead of $\varpi$ since I don't like $\varpi$ (looks too much like $\overline{\omega}$ for my tastes). </p> <p>Expanding the $p$-th factor as a geometric series, $$1-\frac{1}{p-1}\left(\frac Dp\right) = 1-\frac{1/p}{1-1/p}\left(\frac Dp\right) = 1-\frac{1}{p}\left(\frac Dp\right) - \frac{1}{p^2}\left(\frac Dp\right) - \cdots,$$ and the first two terms have a product that is known: $\prod_{p} (1 - (D|p)/p) = 1/L(1,\chi_D)$, where $\chi_D(p) = (\frac{D}{p})$ for odd $p$. (I'm being a bit sloppy about the Euler factor at 2.) Therefore if we divide the $p$-th factor in the Hardy--Littlewood constant by $1 - (D|p)/p$ then we'll have the $p$-th term be $1 + O(1/p^2)$, which has better convergence (not ultra-fast, but better than what you had before.) We write $$\prod_{p} \left(1 - \frac{(D|p)}{p-1}\right) = \prod_{p} \frac{1 - (D|p)/(p-1)}{1 - (D|p)/p} \cdot \left(1 - \frac{(D|p)}{p}\right)= \prod_{p} \frac{1 - (D|p)/(p-1)}{1 - (D|p)/p} \cdot \prod_{p} \left(1 - \frac{(D|p)}{p}\right).$$ This last expression is $$\frac{1}{L(1,\chi_D)}\prod_{p} \frac{1 - (D|p)/(p-1)}{1 - (D|p)/p} = \frac{1}{L(1,\chi_D)}\prod_{p} \left(1 + O\left(\frac{1}{p^2}\right)\right).$$</p> <p>There are ways of accelerating these quasi-Euler products further. See Pieter Moree, Approximation of singular series and automata, Manuscripta Math. 101 (2000), 385--399. </p> <p>Last comment: yes, when $\chi$ is nontrivial the Euler product of $L(s,\chi)$ at $s = 1$ does equal the $L$-function at $s = 1$. That requires an argument, since $s=1$ is not in the range of absolute convergence of the Euler product.</p> http://mathoverflow.net/questions/31150/calculating-the-infinite-product-from-the-hardy-littlewood-conjecture-f/31161#31161 Answer by Dror Speiser for Calculating the infinite product from the Hardy-Littlewood Conjecture F Dror Speiser 2010-07-09T08:09:08Z 2010-07-09T08:09:08Z <p>This problem was studied by a few, and the ideas involve too much latex to write here. Mainly there are ideas of transforming to crazy weighted sums and then use ERH to bound errors from crazier integrals. It suffices to say that the culmination of this research is the freely available paper:</p> <blockquote> <p><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.3281" rel="nofollow">New Quadratic Polynomials With High Densities Of Prime Values</a>, Jacobson and Williams 1999</p> </blockquote> <p>In that year, they used their ideas to compute the constant for discriminants of up to 72 digits! (assuming ERH) The bottleneck of the process seems to be the calculation of the algebraic invariants class number and regulator. Over a decade has passed, the technology today should be able use the same methods to get up to 100 digits, within reasonable time, and up to 110 digits with a bit more time (apparently, two weeks on a cluster):</p> <blockquote> <p><a href="http://arxiv.org/abs/1005.0205" rel="nofollow">Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields</a>, Biasse and Michael 2010</p> <p><a href="http://hal.inria.fr/docs/00/39/74/08/PDF/biasse.pdf" rel="nofollow">Improvements in the Computation of Ideal Class Groups of Imaginary Quadratic Number Fields</a>, Biasse 2009</p> </blockquote>