{"title":"Towards non-iterative calculation of the zeros of the Riemann zeta function","authors":"Yu. Matiyasevich","doi":"10.1016/j.ic.2023.105130","DOIUrl":null,"url":null,"abstract":"<div><p>We introduce a family of rational functions <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>(</mo><mi>a</mi><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mspace></mspace><mo>…</mo><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>)</mo></math></span> with the following property. Let <span><math><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mspace></mspace><mo>…</mo><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mi>N</mi></mrow></msub></math></span> be equal respectively to the value of some function <span><math><mi>f</mi><mo>(</mo><mi>s</mi><mo>)</mo></math></span> and the values of its first <em>N</em> derivatives calculated at a certain complex number <em>a</em> lying not too far from a zero <em>ρ</em> of this function. It is <em>expected</em> that the value of <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>(</mo><mi>a</mi><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mspace></mspace><mo>…</mo><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>)</mo></math></span> is very close to <em>ρ</em>.</p><p><span>We demonstrate this phenomenon on several numerical instances with the Riemann zeta function in the role of </span><span><math><mi>f</mi><mo>(</mo><mi>s</mi><mo>)</mo></math></span>. For example, for <span><math><mi>N</mi><mo>=</mo><mn>10</mn></math></span> and <span><math><mi>a</mi><mo>=</mo><mn>0.6</mn><mo>+</mo><mn>14</mn><mi>i</mi></math></span> we have <span><math><mo>|</mo><msub><mrow><mi>R</mi></mrow><mrow><mn>10</mn></mrow></msub><mo>(</mo><mi>a</mi><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mspace></mspace><mo>…</mo><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>10</mn></mrow></msub><mo>)</mo><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>|</mo><mo><</mo><msup><mrow><mn>10</mn></mrow><mrow><mo>−</mo><mn>18</mn></mrow></msup></math></span> where <span><math><msub><mrow><mi>ρ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><mn>0.5</mn><mo>+</mo><mn>14.13</mn><mo>.</mo><mo>.</mo><mo>.</mo><mi>i</mi></math></span> is the first non-trivial zeta zero.</p><p>Also we define rational functions <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>N</mi><mo>,</mo><mi>n</mi></mrow></msub><mo>(</mo><mi>a</mi><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mspace></mspace><mo>…</mo><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>)</mo></math></span> which (under the same assumptions) have values which are very close to <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><mi>ρ</mi></mrow></msup></math></span><span>, that is, to the terms from the Dirichlet series for the zeta function calculated at its zero.</span></p><p>In the case when <em>a</em> is between two consecutive zeros, say <span><math><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi></mrow></msub></math></span> and <span><math><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span>, functions <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>N</mi><mo>,</mo><mi>n</mi></mrow></msub><mo>(</mo><mi>a</mi><mo>,</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mspace></mspace><mo>…</mo><mo>,</mo><mspace></mspace><msub><mrow><mi>d</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>)</mo></math></span> approximate neither of <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi></mrow></msub></mrow></msup></math></span> no <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></msup></math></span>; nevertheless, they allow us to approximate the sum <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi></mrow></msub></mrow></msup><mo>+</mo><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></msup></math></span> and the product <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi></mrow></msub></mrow></msup><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></msup></math></span> and hence to calculate both <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi></mrow></msub></mrow></msup></math></span> and <span><math><msup><mrow><mi>n</mi></mrow><mrow><mo>−</mo><msub><mrow><mi>ρ</mi></mrow><mrow><mi>l</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></msup></math></span><span> by solving corresponding quadratic equation.</span></p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"296 ","pages":"Article 105130"},"PeriodicalIF":0.8000,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540123001335","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce a family of rational functions with the following property. Let be equal respectively to the value of some function and the values of its first N derivatives calculated at a certain complex number a lying not too far from a zero ρ of this function. It is expected that the value of is very close to ρ.
We demonstrate this phenomenon on several numerical instances with the Riemann zeta function in the role of . For example, for and we have where is the first non-trivial zeta zero.
Also we define rational functions which (under the same assumptions) have values which are very close to , that is, to the terms from the Dirichlet series for the zeta function calculated at its zero.
In the case when a is between two consecutive zeros, say and , functions approximate neither of no ; nevertheless, they allow us to approximate the sum and the product and hence to calculate both and by solving corresponding quadratic equation.
期刊介绍:
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking