You are currently browsing the tag archive for the ‘Polymath15’ tag.

This is the tenth “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this post. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

Most of the progress since the last thread has been on the numerical side, in which the various techniques to numerically establish zero-free regions to the equation have been streamlined, made faster, and extended to larger heights than were previously possible. The best bound for now depends on the height to which one is willing to assume the Riemann hypothesis. Using the conservative verification up to height (slightly larger than) , which has been confirmed by independent work of Platt et al. and Gourdon-Demichel, the best bound remains at . Using the verification up to height claimed by Gourdon-Demichel, this improves slightly to , and if one assumes the Riemann hypothesis up to height the bound improves to , contingent on a numerical computation that is still underway. (See the table below the fold for more data of this form.) This is broadly consistent with the expectation that the bound on should be inversely proportional to the logarithm of the height at which the Riemann hypothesis is verified.

As progress seems to have stabilised, it may be time to transition to the writing phase of the Polymath15 project. (There are still some interesting research questions to pursue, such as numerically investigating the zeroes of for negative values of , but the writeup does not necessarily have to contain every single direction pursued in the project. If enough additional interesting findings are unearthed then one could always consider writing a second paper, for instance.

Below the fold is the detailed progress report on the numerics by Rudolph Dwars and Kalpesh Muchhal.

This is the ninth “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this post. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

We have now tentatively improved the upper bound of the de Bruijn-Newman constant to . Among the technical improvements in our approach, we now are able to use Taylor expansions to efficiently compute the approximation to for many values of in a given region, thus speeding up the computations in the barrier considerably. Also, by using the heuristic that behaves somewhat like the partial Euler product , we were able to find a good location to place the barrier in which is larger than average, hence easier to keep away from zero.

The main remaining bottleneck is that of computing the Euler mollifier bounds that keep bounded away from zero for larger values of beyond the barrier. In going below we are beginning to need quite complicated mollifiers with somewhat poor tail behavior; we may be reaching the point where none of our bounds will succeed in keeping bounded away from zero, so we may be close to the natural limits of our methods.

Participants are also welcome to add any further summaries of the situation in the comments below.

This is the eighth “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this post. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

Significant progress has been made since the last update; by implementing the “barrier” method to establish zero free regions for by leveraging the extensive existing numerical verification of the Riemann hypothesis (which establishes zero free regions for ), we have been able to improve our upper bound on from 0.48 to 0.28. Furthermore, there appears to be a bit of further room to improve the bounds further by tweaking the parameters used in the argument (we are currently using ); the most recent idea is to try to use exponential sum estimates to improve the bounds on the derivative of the approximation to that is used in the barrier method, which currently is the most computationally intensive step of the argument.

This is the seventh “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this post. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

The most recent news is that we appear to have completed the verification that is free of zeroes when and , which implies that . For very large (for instance when the quantity is at least ) this can be done analytically; for medium values of (say when is between and ) this can be done by numerically evaluating a fast approximation to and using the argument principle in a rectangle; and most recently it appears that we can also handle small values of , in part due to some new, and significantly faster, numerical ways to evaluate in this range.

One obvious thing to do now is to experiment with lowering the parameters and and see what happens. However there are two other potential ways to bound which may also be numerically feasible. One approach is based on trying to exclude zeroes of in a region of the form , and for some moderately large (this acts as a “barrier” to prevent zeroes from flowing into the region at time , assuming that they were not already there at time ). This require significantly less numerical verification in the aspect, but more numerical verification in the aspect, so it is not yet clear whether this is a net win.

Another, rather different approach, is to study the evolution of statistics such as over time. One has fairly good control on such quantities at time zero, and their time derivative looks somewhat manageable, so one may be able to still have good control on this quantity at later times . However for this approach to work, one needs an effective version of the Riemann-von Mangoldt formula for , which at present is only available asymptotically (or at time ). This approach may be able to avoid almost all numerical computation, except for numerical verification of the Riemann hypothesis, for which we can appeal to existing literature.

Participants are also welcome to add any further summaries of the situation in the comments below.

This is the sixth “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this post. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

The last two threads have been focused primarily on the test problem of showing that whenever . We have been able to prove this for most regimes of , or equivalently for most regimes of the natural number parameter . In many of these regimes, a certain explicit approximation to was used, together with a non-zero normalising factor ; see the wiki for definitions. The explicit upper bound

has been proven for certain explicit expressions (see here) depending on . In particular, if satisfies the inequality

then is non-vanishing thanks to the triangle inequality. (In principle we have an even more accurate approximation available, but it is looking like we will not need it for this test problem at least.)

We have explicit upper bounds on , , ; see this wiki page for details. They are tabulated in the range here. For , the upper bound for is monotone decreasing, and is in particular bounded by , while and are known to be bounded by and respectively (see here).

Meanwhile, the quantity can be lower bounded by

for certain explicit coefficients and an explicit complex number . Using the triangle inequality to lower bound this by

we can obtain a lower bound of for , which settles the test problem in this regime. One can get more efficient lower bounds by multiplying both Dirichlet series by a suitable Euler product mollifier; we have found for to be good choices to get a variety of further lower bounds depending only on , see this table and this wiki page. Comparing this against our tabulated upper bounds for the error terms we can handle the range .

In the range , we have been able to obtain a suitable lower bound (where exceeds the upper bound for ) by numerically evaluating at a mesh of points for each choice of , with the mesh spacing being adaptive and determined by and an upper bound for the derivative of ; the data is available here.

This leaves the final range (roughly corresponding to ). Here we can numerically evaluate to high accuracy at a fine mesh (see the data here), but to fill in the mesh we need good upper bounds on . It seems that we can get reasonable estimates using some contour shifting from the original definition of (see here). We are close to finishing off this remaining region and thus solving the toy problem.

Beyond this, we need to figure out how to show that for as well. General theory lets one do this for , leaving the region . The analytic theory that handles and should also handle this region; for presumably the argument principle will become relevant.

The full argument also needs to be streamlined and organised; right now it sprawls over many wiki pages and github code files. (A very preliminary writeup attempt has begun here). We should also see if there is much hope of extending the methods to push much beyond the bound of that we would get from the above calculations. This would also be a good time to start discussing whether to move to the writing phase of the project, or whether there are still fruitful research directions for the project to explore.

Participants are also welcome to add any further summaries of the situation in the comments below.

This is the fifth “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this post. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

We have almost finished off the test problem of showing that whenever . We have two useful approximations for , which we have denoted and , and a normalising quantity that is asymptotically equal to the above expressions; see the wiki page for definitions. In practice, the approximation seems to be accurate within about one or two significant figures, whilst the approximation is accurate to about three or four. We have an effective upper bound

where the expressions are quite small in practice ( is typically about two orders of magnitude smaller than the main term once is moderately large, and the error terms are even smaller). See this page for details. In principle we could also obtain an effective upper bound for (the term would be replaced by something smaller).

The ratio takes the form of a difference of two Dirichlet series, where is a phase whose value is explicit but perhaps not terribly important, and the coefficients are explicit and relatively simple ( is , and is approximately ). To bound this away from zero, we have found it advantageous to mollify this difference by multiplying by an Euler product to cancel much of the initial oscillation; also one can take advantage of the fact that the are real and the are (approximately) real. See this page for details. The upshot is that we seem to be getting good lower bounds for the size of this difference of Dirichlet series starting from about or so. The error terms are already quite small by this stage, so we should soon be able to rigorously keep from vanishing at this point. We also have a scheme for lower bounding the difference of Dirichlet series below this range, though it is not clear at present how far we can continue this before the error terms become unmanageable. For very small we may have to explore some faster ways to compute the expression , which is still difficult to compute directly with high accuracy. One will also need to bound the somewhat unwieldy expressions by something more manageable. For instance, right now these quantities depend on the continuous variable ; it would be preferable to have a quantity that depends only on the parameter , as this could be computed numerically for all in the remaining range of interest quite quickly.

As before, any other mathematical discussion related to the project is also welcome here, for instance any summaries of previous discussion that was not covered in this post.

This is the fourth “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing https://terrytao.wordpress.com/2018/01/24/polymath-proposal-upper-bounding-the-de-bruijn-newman-constant/. Progress will be summarised at this Polymath wiki page.

We are getting closer to finishing off the following test problem: can one show that whenever , ? This would morally show that . A wiki page for this problem has now been created here. We have obtained a number of approximations to (see wiki page), though numeric evidence indicates that the approximations are all very close to each other. (Many of these approximations come with a correction term , but thus far it seems that we may be able to avoid having to use this refinement to the approximations.) The effective approximation also comes with an effective error bound

for some explicit (but somewhat messy) error terms : see this wiki page for details. The original approximations can be considered deprecated at this point in favour of the (slightly more complicated) approximation ; the approximation is a simplified version of which is not quite as accurate but might be useful for testing purposes.

It is convenient to normalise everything by an explicit non-zero factor . Asymptotically, converges to 1; numerically, it appears that its magnitude (and also its real part) stays roughly between 0.4 and 3 in the range , and we seem to be able to keep it (or at least the toy counterpart ) away from zero starting from about (here it seems that there is a useful trick of multiplying by Euler-type factors like to cancel off some of the oscillation). Also, the bounds on the error seem to be of size about 0.1 or better in these ranges also. So we seem to be on track to be able to rigorously eliminate zeroes starting from about or so. We have not discussed too much what to do with the small values of ; at some point our effective error bounds will become unusable, and we may have to find some more faster ways to compute .

In addition to this main direction of inquiry, there have been additional discussions on the dynamics of zeroes, and some numerical investigations of the behaviour Lehmer pairs under heat flow. Contributors are welcome to summarise any findings from these discussions from previous threads (or on any other related topic, e.g. improvements in the code) in the comments below.

This is the third “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this previous thread. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

We are making progress on the following test problem: can one show that whenever , , and ? This would imply that

which would be the first quantitative improvement over the de Bruijn bound of (or the Ki-Kim-Lee refinement of ). Of course we can try to lower the two parameters of later on in the project, but this seems as good a place to start as any. One could also potentially try to use finer analysis of dynamics of zeroes to improve the bound further, but this seems to be a less urgent task.

Probably the hardest case is , as there is a good chance that one can then recover the case by a suitable use of the argument principle. Here we appear to have a workable Riemann-Siegel type formula that gives a tractable approximation for . To describe this formula, first note that in the case we have

and the Riemann-Siegel formula gives

for any natural numbers , where is a contour from to that winds once anticlockwise around the zeroes of but does not wind around any other zeroes. A good choice of to use here is

In this case, a classical steepest descent computation (see wiki) yields the approximation

where

Thus we have

where

with and given by (1).

Heuristically, we have derived (see wiki) the more general approximation

for (and in particular for ), where

In practice it seems that the term is negligible once the real part of is moderately large, so one also has the approximation

For large , and for fixed , e.g. , the sums converge fairly quickly (in fact the situation seems to be significantly better here than the much more intensively studied case), and we expect the first term

of the series to dominate. Indeed, analytically we know that (or ) as (holding fixed), and it should also be provable that as well. Numerically with , it seems in fact that (or ) stay within a distance of about of once is moderately large (e.g. ). This raises the hope that one can solve the toy problem of showing for by numerically controlling for small (e.g. ), numerically controlling and analytically bounding the error for medium (e.g. ), and analytically bounding both and for large (e.g. ). (These numbers and are arbitrarily chosen here and may end up being optimised to something else as the computations become clearer.)

Thus, we now have four largely independent tasks (for suitable ranges of “small”, “medium”, and “large” ):

- Numerically computing for small (with enough accuracy to verify that there are no zeroes)
- Numerically computing for medium (with enough accuracy to keep it away from zero)
- Analytically bounding for large (with enough accuracy to keep it away from zero); and
- Analytically bounding for medium and large (with a bound that is better than the bound away from zero in the previous two tasks).

Note that tasks 2 and 3 do not directly require any further understanding of the function .

Below we will give a progress report on the numeric and analytic sides of these tasks.

** — 1. Numerics report (contributed by Sujit Nair) — **

There is some progress on the code side but not at the pace I was hoping. Here are a few things which happened (rather, mistakes which were taken care of).

- We got rid of code which wasn’t being used. For example, @dhjpolymath computed based on an old version but only realized it after the fact.
- We implemented tests to catch human/numerical bugs before a computation starts. Again, we lost some numerical cycles but moving forward these can be avoided.
- David got set up on GitHub and he is able to compare his output (in C) with the Python code. That is helping a lot.

Two areas which were worked on were

- Computing and zeroes for around
- Computing quantities like , , , etc. with the goal of understanding the zero free regions.

Some observations for , , include:

- does seem to avoid the negative real axis
- (based on the oscillations and trends in the plots)
- seems to be settling around range.

See the figure below. The top plot is on the complex plane and the bottom plot is the absolute value. The code to play with this is here.

** — 2. Analysis report — **

The Riemann-Siegel formula and some manipulations (see wiki) give , where

where is a contour that goes from to staying a bounded distance away from the upper imaginary and right real axes, and is the complex conjugate of . (In each of these sums, it is the first term that should dominate, with the second one being about as large.) One can then evolve by the heat flow to obtain , where

Steepest descent heuristics then predict that , , and . For the purposes of this project, we will need effective error estimates here, with explicit error terms.

A start has been made towards this goal at this wiki page. Firstly there is a “effective Laplace method” lemma that gives effective bounds on integrals of the form if the real part of is either monotone with large derivative, or has a critical point and is decreasing on both sides of that critical point. In principle, all one has to do is manipulate expressions such as , , by change of variables, contour shifting and integration by parts until it is of the form to which the above lemma can be profitably applied. As one may imagine though the computations are messy, particularly for the term. As a warm up, I have begun by trying to estimate integrals of the form

for smallish complex numbers , as these sorts of integrals appear in the form of . As of this time of writing, there are effective bounds for the case, and I am currently working on extending them to the case, which should give enough control to approximate and . The most complicated task will be that of upper bounding , but it also looks eventually doable.

This is the second “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant , continuing this previous thread. Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

We now have the following proposition (see this page for a proof sketch) that looks like it can give a numerically feasible approach to bound :

Proposition 1Suppose that one has parameters obeying the following properties:

- All the zeroes of with are real.
- There are no zeroes with in the region .
- There are no zeroes with and .
Then one has .

The first hypothesis is already known for up to about (we should find out exactly what we can reach here). Preliminary calculations suggest that we can obtain the third item provided that . The second hypothesis requires good numerical calculation for , to which we now turn.

The initial definition of is given by the formula

where

This formula has proven numerically computable to acceptable error up until about the first hundred zeroes of , but degrades after that, and so other exact or approximate formulae for are needed. One possible exact formula that could be useful is

where

and

and can be chosen arbitrarily. We are still trying to see if this can be implemented numerically to give better accuracy than the previous formula.

It seems particularly promising to develop a generalisation of the Riemann-Siegel approximate functional equation for . Preliminary computations suggest in particular that we have the approximation

where

Some very preliminary numerics suggest that this formula is reasonably accurate even for moderate values of , though further numerical verification is needed. As a proof of concept, one could take this approximation as exact for the purposes of seeing what ranges of one can feasibly compute with (and for extremely large values of , we will presumably have to introduce some version of the Odlyzko-Schönhage algorithm. Of course, to obtain a rigorous result, we will eventually need a rigorous version of this formula with explicit error bounds. It may also be necessary to add more terms to the approximation to reduce the size of the error.

Sujit Nair has kindly summarised for me the current state of affairs with the numerics as follows:

—

- We need a real milestone and work backward to set up intermediate goals. This will definitely help bring in focus!
- So far, we have some utilities to compute zeroes of with a nonlinear solver which uses roots of as an initial condition. The solver is a wrapper around MINPACK’s implementation of Powell’s method. There is some room for optimization. For example, we aren’t providing the solver with the analytical Jacobian which speeds up the computation and increases accuracy.
- We have some results in the output folder which contains the first 1000 roots of for some small values of , etc. They need some more organization and visualization.

We have a decent initial start but we have some ways to go. Moving forward, here is my proposition for some areas of focus. We should expand and prioritize after some open discussion.

- Short term Optimize the existing framework and target to have the first million zeros of (for a reasonable range of ) and the corresponding plots. With better engineering practice and discipline, I am confident we can get to a few tens of millions range. Some things which will help include parallelization, iterative approaches (using zeroes of to compute zeroes of ), etc.
- Medium term We need to explore better ways to represent the zeros and compute them. An analogy is the computation of Riemann zeroes up to height . It is computed by computing the sign changes of (page 119 of Edwards) and by exploiting the speed up with the Riemann-Siegel formulation (over Euler-Maclaurin). For larger values of , I am not sure the root solver based approach is going to work to understand the gaps between zeroes.
- Long term We also need a better understanding of the errors involved in the computation — truncation, hardware/software, etc.

This is the first official “research” thread of the Polymath15 project to upper bound the de Bruijn-Newman constant . Discussion of the project of a non-research nature can continue for now in the existing proposal thread. Progress will be summarised at this Polymath wiki page.

The proposal naturally splits into at least three separate (but loosely related) topics:

- Numerical computation of the entire functions , with the ultimate aim of establishing zero-free regions of the form for various .
- Improved understanding of the dynamics of the zeroes of .
- Establishing the zero-free nature of when and is sufficiently large depending on and .

Below the fold, I will present each of these topics in turn, to initiate further discussion in each of them. (I thought about splitting this post into three to have three separate discussions, but given the current volume of comments, I think we should be able to manage for now having all the comments in a single post. If this changes then of course we can split up some of the discussion later.)

To begin with, let me present some formulae for computing (inspired by similar computations in the Ki-Kim-Lee paper) which may be useful. The initial definition of is

where

is a variant of the Jacobi theta function. We observe that in fact extends analytically to the strip

as has positive real part on this strip. One can use the Poisson summation formula to verify that is even, (see this previous post for details). This lets us obtain a number of other formulae for . Most obviously, one can unfold the integral to obtain

In my previous paper with Brad, we used this representation, combined with Fubini’s theorem to swap the sum and integral, to obtain a useful series representation for in the case. Unfortunately this is not possible in the case because expressions such as diverge as approaches . Nevertheless we can still perform the following contour integration manipulation. Let be fixed. The function decays super-exponentially fast (much faster than , in particular) as with ; as is even, we also have this decay as with (this is despite each of the summands in having much slower decay in this direction – there is considerable cancellation!). Hence by the Cauchy integral formula we have

Splitting the horizontal line from to at and using the even nature of , we thus have

Using the functional equation , we thus have the representation

where is the oscillatory integral

The formula (2) is valid for any . Naively one would think that it would be simplest to take ; however, when and is large (with bounded), it seems asymptotically better to take closer to , in particular something like seems to be a reasonably good choice. This is because the integrand in (3) becomes significantly less oscillatory and also much lower in amplitude; the term in (3) now generates a factor roughly comparable to (which, as we will see below, is the main term in the decay asymptotics for ), while the term still exhibits a reasonable amount of decay as . We will use the representation (2) in the asymptotic analysis of below, but it may also be a useful representation to use for numerical purposes.

## Recent Comments