Related papers: Zeros of the dilogarithm
Our main result is to answer a question of Michel Balazard by giving a Dirichlet series with only one zero in its half-plane of convergence. At the end of the paper we also give several sufficient conditions for the Generalized Riemann…
The finite Dirichlet series from the title are defined by the condition that they vanish at as many initial zeroes of the zeta function as possible. It turned out that such series can produce extremely good approximations to the values of…
We prove an upper bound on the density of zeros very close to the critical line of the family of Dirichlet $L$-functions of modulus $q$ at height $T$. To do this, we derive an asymptotic for the twisted second moment of Dirichlet…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
We consider the zeros distributions on the derivatives of difference polynomials of meromorphic functions, and present some results which can be seen as the discrete analogues of Hayman conjecture \cite{hayman1}, also partly answer the…
We study the zeros sets of functions in the Dirichlet space. Using Carleson formula for Dirichlet integral, we obtain some new families of zero sets. We also show that any closed subset of $E \subset \TT$ with logarithmic capacity zero is…
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
Univariate polynomial root-finding has been studied for four millennia and very intensively in the last decades. Our new near-optimal root-finders approximate all zeros of a polynomial p almost as fast as one accesses its coefficients with…
We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…
We study the asymptotics of zeros for entire functions of the form \sin z + \int_{-1}^1 f(t)e^{izt}dt with f belonging to a space X \hookrightarrow L_1(-1,1) possessing some minimal regularity properties.
It is known that polynomials over quaternions may have spherical zeros and isolated left and right zeros. These zeros along with appropriately defined multiplicities form the zero structure of a polynomial. In this paper, we equivalently…
If the coefficients of polynomials are selected by some random process, the zeros of the resulting polynomials are in some sense random. In this paper the author rephrases the above in more precise language, and calculates the joint…
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…
We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
The greatest lower bound of the real parts of the roots of a partial sum of the Dirichlet series of Riemann's zeta function is asymptotically equivalent to the opposite of the number of terms of this sum, multiplied by the Napierian…
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…