Yuri Matiyasevich
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Yuri Matiyasevich has a total of 192 co-authors. Here are the top co-authors by number of shared publications:
- Lev Dmitrievich Beklemishev
Steklov Mathematical Institute
5 shared publications - Gleb Beliakov
School of Information Technology, Deakin University, Burwood, Australia
4 shared publications - Patrick Cégielski
LACL, Université Paris-Est
4 shared publications A O Slisenko
3 shared publications- Aleksei Lvovich Semenov
Lomonosov Moscow State University, Moscow, Russia
3 shared publications Alexander Khanievich Shen'
3 shared publications
Latest Publications
- 31 May 2026
- Published by Steklov Mathematical Institute
- Vol. 81 (3(489)) , 167-178
Алексей Львович Семенов (к семидесятипятилетию со дня рождения)
- 31 May 2026
- Published by Steklov Mathematical Institute
- Vol. 81 (3(489)) , 167-178
Алексей Львович Семенов (к семидесятипятилетию со дня рождения)
- Open Access
An approach to the Lindelöf Hypothesis for Dirichlet $L$-functions
The suggested approach is based on a known representation of Dirichlet $L$-functions via the incomplete gamma functions. Some properties of the Taylor coefficients of the lower incomplete gamma function at infinity seem to be new. Specifically, these coefficients can be expressed in terms of Touchard polynomials. Furthermore, these same coefficients can be used to reformulate the functional equation for Dirichlet $L$-functions. This relationship "explains"' why $\vert L_χ(1/2+i t)\vert $ should be small. To present the new ideas in a nutshell, we start by giving (in Section 1) a "formula proof" of the Lindelöf hypothesis. This is not a genuine proof, as we are not concerned with the convergence of our series nor do we justify changing the order of summation. In Section 2, we suggest some hypothetical ways of transforming the "proof" from Section 1 into a rigorous mathematical proof. Sections 3-5 contain some technical details and bibliographical references.Open AccessAn approach to the Lindelöf Hypothesis for Dirichlet $L$-functions
The suggested approach is based on a known representation of Dirichlet $L$-functions via the incomplete gamma functions. Some properties of the Taylor coefficients of the lower incomplete gamma function at infinity seem to be new. Specifically, these coefficients can be expressed in terms of Touchard polynomials. Furthermore, these same coefficients can be used to reformulate the functional equation for Dirichlet $L$-functions. This relationship "explains"' why $\vert L_χ(1/2+i t)\vert $ should be small. To present the new ideas in a nutshell, we start by giving (in Section 1) a "formula proof" of the Lindelöf hypothesis. This is not a genuine proof, as we are not concerned with the convergence of our series nor do we justify changing the order of summation. In Section 2, we suggest some hypothetical ways of transforming the "proof" from Section 1 into a rigorous mathematical proof. Sections 3-5 contain some technical details and bibliographical references. - 27 January 2026
- Published by Springer Nature
- p. 3-13
Gregory Tseytin Obituary
- Open AccessUndecidability on Diophantine equations over $\mathbb Z[i]$ with $20$ unknownsIt is known that Hilbert's Tenth Problem over the Gaussian ring $\mathbb Z[i]=\{a+bi:\ a,b\in\mathbb Z\}$ is undecidable. In this paper we obtain the following further result: There is no algorithm to decide whether an arbitrarily given polynomial equation $P(z_1,\ldots,z_{20})=0$ (with integer coefficients) is solvable over $\mathbb Z[i]$. This improves the previous record involving $52$ variables.Open AccessUndecidability on Diophantine equations over $\mathbb Z[i]$ with $20$ unknownsIt is known that Hilbert's Tenth Problem over the Gaussian ring $\mathbb Z[i]=\{a+bi:\ a,b\in\mathbb Z\}$ is undecidable. In this paper we obtain the following further result: There is no algorithm to decide whether an arbitrarily given polynomial equation $P(z_1,\ldots,z_{20})=0$ (with integer coefficients) is solvable over $\mathbb Z[i]$. This improves the previous record involving $52$ variables.
- Open Access
- 1 October 2025
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 33 (3) , 425-450
Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
In his autobiographical essay written in 1999, ‘From logic to computer science and back’, Martin David Davis (1928 3 8–2023 1 1) indicated that he viewed himself as a logician and a computer scientist. He expanded the essay in 2016 and expressed a new perspective through a changed title, ‘My life as a logician’. He points out that logic was the unifying theme underlying his scientific career. Our paper attempts to provide a consistent vision that illuminates Davis’s successive contributions leading to his landmark writings on computability, unsolvable problems, automated reasoning, as well as the history and philosophy of computing.
- 1 October 2025
- Published by Oxford University Press (OUP) in Philosophia Mathematica
- Vol. 33 (3) , 425-450
Open AccessMartin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
In his autobiographical essay written in 1999, ‘From logic to computer science and back’, Martin David Davis (1928 3 8–2023 1 1) indicated that he viewed himself as a logician and a computer scientist. He expanded the essay in 2016 and expressed a new perspective through a changed title, ‘My life as a logician’. He points out that logic was the unifying theme underlying his scientific career. Our paper attempts to provide a consistent vision that illuminates Davis’s successive contributions leading to his landmark writings on computability, unsolvable problems, automated reasoning, as well as the history and philosophy of computing.
- Open Access
- 30 August 2025
- Published by Association for Mathematical Research in Journal of Experimental Mathematics
- Vol. 1 (2) , 239-256
In Search of Approximate Polynomial Dependencies Among the Derivatives of the Alternating Zeta Function
It is well-known that the Riemann zeta function does not satisfy any exact polynomial differential equation. Here we present numerical evidence suggesting the existence of approximate polynomial dependencies between the values of the alternating zeta function and its initial derivatives. A number of conjectures is stated.
- 30 August 2025
- Published by Association for Mathematical Research in Journal of Experimental Mathematics
- Vol. 1 (2) , 239-256
Open AccessIn Search of Approximate Polynomial Dependencies Among the Derivatives of the Alternating Zeta Function
It is well-known that the Riemann zeta function does not satisfy any exact polynomial differential equation. Here we present numerical evidence suggesting the existence of approximate polynomial dependencies between the values of the alternating zeta function and its initial derivatives. A number of conjectures is stated.
- 26 August 2025
- Published by Steklov Mathematical Institute
- Vol. 37 (3) , 3-5
Зубков Андрей Михайлович (30.12.1946-06.08.2025)
- 26 August 2025
- Published by Steklov Mathematical Institute
- Vol. 37 (3) , 3-5
Зубков Андрей Михайлович (30.12.1946-06.08.2025)
- 14 December 2023
- Published by Elsevier in Information and Computation
- Vol. 296
Towards non-iterative calculation of the zeros of the Riemann zeta function
- 14 December 2023
- Published by Elsevier in Information and Computation
- Vol. 296
Towards non-iterative calculation of the zeros of the Riemann zeta function
- 28 September 2023
- Published by Springer Nature in Journal of Mathematical Sciences
- p. 1-13
Calculation of the Values of the Riemann Zeta Function Via Values of its Derivatives at a Single Point
- 28 September 2023
- Published by Springer Nature in Journal of Mathematical Sciences
- p. 1-13
Calculation of the Values of the Riemann Zeta Function Via Values of its Derivatives at a Single Point
- 31 May 2023
- Published by Steklov Mathematical Institute
- Vol. 78 (3(471)) , 170-176
Григорий Самуилович Цейтин (некролог)
- 31 May 2023
- Published by Steklov Mathematical Institute
- Vol. 78 (3(471)) , 170-176
Григорий Самуилович Цейтин (некролог)