Year: 2015
Type: preprint
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.
Source: arXiv (Cornell University)
Author: O'Sullivan, Cormac
Institutions: The Graduate Center, CUNY, City University of New York
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: City University of New York
OpenAlex ID: W2106744936