{
  "id": "math/0412181",
  "version": "v1",
  "published": "2004-12-08T21:20:45.000Z",
  "updated": "2004-12-08T21:20:45.000Z",
  "title": "Computational methods and experiments in analytic number theory",
  "authors": [
    "Michael O. Rubinstein"
  ],
  "comment": "74 pages, 13 figures",
  "categories": [
    "math.NT",
    "math-ph",
    "math.MP"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2004-12-08T21:20:45.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "analytic number theory",
      "computational methods",
      "experiments",
      "random matrix theory",
      "connect number theory"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 74,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2004math.....12181R"
    }
  }
}