English
Related papers

Related papers: Zeros of the dilogarithm

200 papers

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$ and study the distribution of zeros of Dirichlet polynomials $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ corresponding to these functions. We prove that the…

Number Theory · Mathematics 2019-12-10 Arindam Roy , Akshaa Vatwani

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

Number Theory · Mathematics 2009-06-11 Lenny Fukshansky

Several root-ratio multipoint methods for finding multiple zeros of univariate functions were recently presented. The characteristic of these methods is that they deal with $m$-th root of ratio of two functions (hence the name root-ratio…

Numerical Analysis · Mathematics 2018-09-26 Miodrag S. Petkovic , Ljiljana D. Petkovic

The DLG root-squaring iterations, due to Dandelin 1826 and rediscovered by Lobachevsky 1834 and Graeffe 1837, have been the main approach to root-finding for a univariate polynomial p(x) in the 19th century and beyond, but not so nowadays…

Numerical Analysis · Mathematics 2022-07-01 Victor Y. Pan

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

Combinatorics · Mathematics 2012-04-24 Ebrahim Ghorbani

Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…

Numerical Analysis · Mathematics 2017-03-14 Zhiwei Hao , Wenrong Jiang , Nan Li , Lihong Zhi

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Number Theory · Mathematics 2020-11-24 Yuri Bilu , Florian Luca

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…

Combinatorics · Mathematics 2018-05-08 David G. L. Wang , Jiarui Zhang

We introduce a new iterative root-finding method for complex polynomials, dubbed {\it Newton-Ellipsoid} method. It is inspired by the Ellipsoid method, a classical method in optimization, and a property of Newton's Method derived in…

Numerical Analysis · Computer Science 2014-10-09 Bahman Kalantari , Eric Lee

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas

The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.

General Physics · Physics 2007-05-23 Gordon Chalmers

In this paper we deduce a universal result about the asymptotic distribution of roots of random polynomials, which can be seen as a complement to an old and famous result of Erdos and Turan. More precisely, given a sequence of random…

Complex Variables · Mathematics 2014-01-14 C. P. Hughes , A. Nikeghbali

A simple algorithm to compute all the zeros of a generic polynomial is proposed.

Classical Analysis and ODEs · Mathematics 2016-09-21 Francesco Calogero

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

Number Theory · Mathematics 2022-11-14 Maxwell Forst , Lenny Fukshansky

We give a separation bound for an isolated multiple root $x$ of a square multivariate analytic system $f$ satisfying that an operator deduced by adding $Df(x)$ and a projection of $D^2f(x)$ in a direction of the kernel of $Df(x)$ is…

Numerical Analysis · Mathematics 2023-05-19 Kisun Lee , Nan Li , Lihong Zhi

We propose a two-step Newton's method for refining an approximation of a singular zero whose deflation process terminates after one step, also known as a deflation-one singularity. Given an isolated singular zero of a square analytic…

Numerical Analysis · Mathematics 2024-01-26 Kisun Lee , Nan Li , Lihong Zhi

In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…

Combinatorics · Mathematics 2026-02-02 Ferenc Bencs , Chiara Piombi , Guus Regts

The derivative of a polynomial with all zeros on the unit circle has the zeros of its derivative on or inside the unit circle. It has been observed that in many cases the zeros of the derivative have a bimodal distribution: there are two…

Complex Variables · Mathematics 2025-02-20 David W. Farmer

Several results are obtained concerning multiplicities of zeros of the Riemann zeta-function $\zeta(s)$. They include upper bounds for multiplicities, showing that zeros with large multiplicities have to lie to the left of the line $\sigma…

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić