Computational Aspects of Hamburger’s Theorem

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Riemann’s zeta function (defined by a certain Dirichlet series) satisfies an identity known as the functional equation. H. Hamburger established that the function is identified by the equation inside a wide class of functions defined by Dirichlet series. Riemann’s zeta function is a member of a large family of functions with similar properties, in particular, satisfying certain functional equations. Hamburger’s theorem can be extended to some (but not to all) of these equations. The paper addresses the following question: how could we discover the Dirichlet series satisfying given functional equation? Two “rules of thumb” for performing such discoveries via numerical computations are demonstrated for functional equations satisfied by Dirichlet eta function, Ramanujan tau L-function, and Davenport–Heilbronn function. A conjectured discrete version of Hamburger’s theorem is stated.

Cite

CITATION STYLE

APA

Matiyasevich, Y. (2019). Computational Aspects of Hamburger’s Theorem. In Fields Institute Communications (Vol. 82, pp. 195–223). Springer New York LLC. https://doi.org/10.1007/978-1-4939-9051-1_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free