Computational methods and experiments in analytic number theory

From MaRDI portal
Publication:5482844

DOI10.1017/CBO9780511550492.015zbMATH Open1168.11329arXivmath/0412181OpenAlexW1634565696MaRDI QIDQ5482844FDOQ5482844

Michael O. Rubinstein

Publication date: 15 August 2006

Published in: Recent Perspectives in Random Matrix Theory and Number Theory (Search for Journal in Brave)

Abstract: We cover some useful techniques in computational aspects of analytic number theory, with specific emphasis on ideas relevant to the evaluation of L-functions. These techniques overlap considerably with basic methods from analytic number theory. On the elementary side, summation by parts, Euler Maclaurin summation, and Mobius inversion play a prominent role. In the slightly less elementary sphere, we find tools from analysis, such as Poisson summation, generating function methods, Cauchy's residue theorem, asymptotic methods, and the fast Fourier transform. We then describe conjectures and experiments that connect number theory and random matrix theory.


Full work available at URL: https://arxiv.org/abs/math/0412181




Recommendations





Cited In (27)





This page was built for publication: Computational methods and experiments in analytic number theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5482844)