Results 1  10
of
242
On the distribution of spacings between zeros of the zeta function
 MATH. COMP
, 1987
"... A numerical study of the distribution of spacings between zeros of the Riemann zeta function is presented. It is based on values for the first 10 5 zeros and for zeros number 10 12 + 1 to 10 12 + 10 5 that are accurate to within ± 10 − 8, and which were calculated on the Cray1 and Cray XMP compute ..."
Abstract

Cited by 104 (9 self)
 Add to MetaCart
(Show Context)
A numerical study of the distribution of spacings between zeros of the Riemann zeta function is presented. It is based on values for the first 10 5 zeros and for zeros number 10 12 + 1 to 10 12 + 10 5 that are accurate to within ± 10 − 8, and which were calculated on the Cray1 and Cray XMP computers. This study tests the Montgomery pair correlation conjecture as well as some further conjectures that predict that the zeros of the zeta function behave similarly to eigenvalues of random hermitian matrices. Matrices of this type are used in modeling energy levels in physics, and many statistical properties of their eigenvalues are known. The agreement between actual statistics for zeros of the zeta function and conjectured results is generally good, and improves at larger heights. Several initially unexpected phenomena were found in the data and some were explained by
Mellin transforms and asymptotics: Finite differences and Rice's integrals
, 1995
"... High order differences of simple number sequences may be analysed asymptotically by means of integral representations, residue calculus, and contour integration. This technique, akin to Mellin transform asymptotics, is put in perspective and illustrated by means of several examples related to combin ..."
Abstract

Cited by 82 (8 self)
 Add to MetaCart
High order differences of simple number sequences may be analysed asymptotically by means of integral representations, residue calculus, and contour integration. This technique, akin to Mellin transform asymptotics, is put in perspective and illustrated by means of several examples related to combinatorics and the analysis of algorithms like digital tries, digital search trees, quadtrees, and distributed leader election.
Computational strategies for the Riemann zeta function
, 2000
"... We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of th ..."
Abstract

Cited by 60 (11 self)
 Add to MetaCart
(Show Context)
We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of the argument, the desired speed of computation, and the incidence of what we call “value recycling”.
Dynamical Sources in Information Theory: A General Analysis of Trie Structures
 ALGORITHMICA
, 1999
"... Digital trees, also known as tries, are a general purpose flexible data structure that implements dictionaries built on sets of words. An analysis is given of three major representations of tries in the form of arraytries, list tries, and bsttries ("ternary search tries"). The size an ..."
Abstract

Cited by 55 (7 self)
 Add to MetaCart
Digital trees, also known as tries, are a general purpose flexible data structure that implements dictionaries built on sets of words. An analysis is given of three major representations of tries in the form of arraytries, list tries, and bsttries ("ternary search tries"). The size and the search costs of the corresponding representations are analysed precisely in the average case, while a complete distributional analysis of height of tries is given. The unifying data model used is that of dynamical sources and it encompasses classical models like those of memoryless sources with independent symbols, of finite Markovchains, and of nonuniform densities. The probabilistic behaviour of the main parameters, namely size, path length, or height, appears to be determined by two intrinsic characteristics of the source: the entropy and the probability of letter coincidence. These characteristics are themselves related in a natural way to spectral properties of specific transfer operators of the Ruelle type.
Zerofree regions for Dirichlet Lfunctions and the least prime in an arithmetic progression
 Proc. Lond. Math. Soc
, 1992
"... The classical theorem of Dirichlet states that any arithmetic progression a(mod q) in which a and q are relatively prime contains infinitely many prime numbers. A natural question to ask is then, how big is the first such prime, P (a, q) say? In one direction we have trivially ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
The classical theorem of Dirichlet states that any arithmetic progression a(mod q) in which a and q are relatively prime contains infinitely many prime numbers. A natural question to ask is then, how big is the first such prime, P (a, q) say? In one direction we have trivially
The Riemann Zeros and Eigenvalue Asymptotics
 SIAM Rev
, 1999
"... Comparison between formulae for the counting functions of the heights t n of the Riemann zeros and of semiclassical quantum eigenvalues En suggests that the t n are eigenvalues of an (unknown) hermitean operator H, obtained by quantizing a classical dynamical system with hamiltonian H cl . Many feat ..."
Abstract

Cited by 52 (10 self)
 Add to MetaCart
(Show Context)
Comparison between formulae for the counting functions of the heights t n of the Riemann zeros and of semiclassical quantum eigenvalues En suggests that the t n are eigenvalues of an (unknown) hermitean operator H, obtained by quantizing a classical dynamical system with hamiltonian H cl . Many features of H cl are provided by the analogy; for example, the "Riemann dynamics" should be chaotic and have periodic orbits whose periods are multiples of logarithms of prime numbers. Statistics of the t n have a similar structure to those of the semiclassical En ; in particular, they display randommatrix universality at short range, and nonuniversal behaviour over longer ranges. Very refined features of the statistics of the t n can be computed accurately from formulae with quantum analogues. The RiemannSiegel formula for the zeta function is described in detail. Its interpretation as a relation between long and short periodic orbits gives further insights into the quantum spectral fluctuations. We speculate that the Riemann dynamics is related to the trajectories generated by the classical hamiltonian H cl = XP. Key words. spectral asymptotics, number theory AMS subject classifications. 11M26, 11M06, 35P20, 35Q40, 41A60, 81Q10, 81Q50 PII. S0036144598347497 1.
Fast algorithms for multiple evaluations of the Riemann zeta function
 TRANS. AMER. MATH. SOC
, 1988
"... The best previously known algorithm for evaluating the Riemann zeta function, c,(a + it), with a bounded and t large to moderate accuracy (within ±t~c for some c> 0, say) was based on the RiemannSiegel formula and required on the order of fc1/2 operations for each value that was computed. New a ..."
Abstract

Cited by 52 (7 self)
 Add to MetaCart
(Show Context)
The best previously known algorithm for evaluating the Riemann zeta function, c,(a + it), with a bounded and t large to moderate accuracy (within ±t~c for some c> 0, say) was based on the RiemannSiegel formula and required on the order of fc1/2 operations for each value that was computed. New algorithms are presented in this paper which enable one to compute any single value of c(cr + it) with a fixed and T < t < T + Tlf2 to within ±t~c in 0(te) operations on numbers of O(logi) bits for any e> 0, for example, provided a precomputation involving 0(T1f2+e) operations and 0(T1f2+e) bits of storage is carried out beforehand. These algorithms lead to methods for numerically verifying the Riemann hypothesis for the first n zeros in what is expected to be 0(n1+s) operations (as opposed to about n3/2 operations for the previous method), as well as improved algorithms for the computation of various arithmetic functions, such as 7r(i). The new zeta function algorithms use the fast Fourier transform and a new method for the evaluation of certain rational functions. They can also be applied to the evaluation of Lfunctions, Epstein zeta functions, and other Dirichlet series.
On the characteristic polynomial of a random unitary matrix
 Comm. Math. Phys
, 2001
"... Abstract: We present a range of fluctuation and large deviations results for the logarithm of the characteristic√polynomial Z of a random N × N unitary matrix, as N →∞. First 12 we show that ln Z / ln N, evaluated at a finite set of distinct points, is asymptotically a collection of i.i.d. complex n ..."
Abstract

Cited by 49 (13 self)
 Add to MetaCart
Abstract: We present a range of fluctuation and large deviations results for the logarithm of the characteristic√polynomial Z of a random N × N unitary matrix, as N →∞. First 12 we show that ln Z / ln N, evaluated at a finite set of distinct points, is asymptotically a collection of i.i.d. complex normal random variables. This leads to a refinement of a recent central limit theorem due to Keating and Snaith, and also explains the covariance structure of the eigenvalue counting function. Next we obtain a central limit theorem for ln Z in a Sobolev space of generalised functions on the unit circle. In this limiting regime, lowerorder terms which reflect the global covariance structure are no longer negligible and feature in the covariance structure of the limiting Gaussian measure. Large deviations results for ln Z/A, evaluated at a finite set of distinct points, can be obtained for √ ln N ≪ A ≪ ln N. For higherorder scalings we obtain large deviations results for ln Z/A evaluated at a single point. There is a phase transition at A = ln N (which only applies to negative deviations of the real part) reflecting a switch from global to local conspiracy.
Evidence for a Spectral Interpretation of the Zeros of LFunctions
, 1998
"... By looking at the average behavior (nlevel density) of the low lying zeros of certain families of Lfunctions, we find evidence, as predicted by function field analogs, in favor of a spectral interpretation of the nontrivial zeros in terms of the classical compact groups. This is further supported ..."
Abstract

Cited by 45 (10 self)
 Add to MetaCart
(Show Context)
By looking at the average behavior (nlevel density) of the low lying zeros of certain families of Lfunctions, we find evidence, as predicted by function field analogs, in favor of a spectral interpretation of the nontrivial zeros in terms of the classical compact groups. This is further supported by numerical experiments for which an efficient algorithm to compute Lfunctions was developed and implemented. iii Acknowledgements When Mike Rubinstein woke up one morning he was shocked to discover that he was writing the acknowledgements to his thesis. After two screenplays, a 40000 word manifesto, and many fruitless attempts at making sushi, something resembling a detailed academic work has emerged for which he has people to thank. Peter Sarnak from Chebyshev's Bias to USp(1). For being a terrific advisor and teacher. For choosing problems suited to my talents and involving me in this great project to understand the zeros of Lfunctions. Zeev Rudnick and Andrew Oldyzko for many disc...