/dbn_upper_bound

Computational effort to upper bound the de Bruijn-Newman constant as part of a Polymath project

Primary LanguagePythonOtherNOASSERTION

dbn_upper_bound

Computational effort to upper bound the de Bruijn-Newman constant as part of a Polymath project

As you may know, Prof. Terence Tao will be launching and moderating a Polymath project to upper bound the de Bruijn-Newman constant (dBN constant for brevity). This will involve both 1) an Analytic or theory part (hard math) to derive/refine several formulas and estimates, and 2) a computational part to check whether the de Bruijn family of functions H_t are zero free in the regions marked for numerical verification.

This repo is meant to facilitate the computational aspect.

For general direction, theory, blogposts, discussions on latest results, etc. please head to Prof. Tao's blog https://terrytao.wordpress.com/

For the Polymath proposal, please check this link, https://terrytao.wordpress.com/2018/01/24/polymath-proposal-upper-bounding-the-de-bruijn-newman-constant/

For the wiki, comprehensive list of papers, permanent record of results, please head to the Polymath webpage http://michaelnielsen.org/polymath1/index.php?title=De_Bruijn-Newman_constant

Computational Requirements

For Python, numpy and scipy will likely be beneficial, apart from any specific libraries

For other languages, please update accordingly

The algorithms can likely run on any machine, but better configs will certainly help

Results

Please express your results here. A sample format can be your name or handle, t checked, T and epsilon verified, etc. Once there are multiple results, we can arrange it as a table. Also, once you are sure about your results, please update them or ask them to be updated on the Polymath page as well.

Do double check your results, and triple check especially if you find a non real zero for any t>0, since the implications are huge!

Other Sections - Please add as needed