Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Zeros of the dilogarithm
HTML articles powered by AMS MathViewer

by Cormac O’Sullivan PDF
Math. Comp. 85 (2016), 2967-2993 Request permission

Abstract:

We show that the dilogarithm has at most one zero on each branch, that each zero is close to a root of unity, and that they may be found to any precision with Newton’s method. This work is motivated by applications to the asymptotics of coefficients in partial fraction decompositions considered by Rademacher. We also survey what is known about zeros of polylogarithms in general.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 33B30, 30C15, 11P82
  • Retrieve articles in all journals with MSC (2010): 33B30, 30C15, 11P82
Additional Information
  • Cormac O’Sullivan
  • Affiliation: Department of Mathematics, The CUNY Graduate Center, New York, New York 10016-4309
  • MR Author ID: 658848
  • Email: cosullivan@gc.cuny.edu
  • Received by editor(s): February 19, 2015
  • Published electronically: March 2, 2016
  • Additional Notes: Support for this project was provided by a PSC-CUNY Award, jointly funded by The Professional Staff Congress and The City University of New York.
  • © Copyright 2016 American Mathematical Society
  • Journal: Math. Comp. 85 (2016), 2967-2993
  • MSC (2010): Primary 33B30, 30C15; Secondary 11P82
  • DOI: https://doi.org/10.1090/mcom/3065
  • MathSciNet review: 3522977