Related papers: Zeros of the dilogarithm
The paper suggests new topological lower bounds for the number of zeros of closed 1-forms within a given cohomology class. The main new technical tool is the deformation complex, which allows to pass to a singular limit and reduce the…
The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev $p$-norm ($1<p<\infty$) for the case $p=1$. Some relevant examples are indicated. The second part deals…
Let $P_s \in \mathcal{D}_s[X_0,X_1, \ldots,X_l]$ be a polynomial whose coefficients are the ring of all general Dirichlet series which converge absolutely in the half-plane $\Re (s) > 1/2$. In the present paper, we show that the function…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
We propose a numerical method for approximating and discovering zeros of the Dirichlet L-function L(s, chi) corresponding to real Dirichlet characters chi.
If $f$ is a polynomial with all of its roots on the real line, then the roots of the derivative $f'$ are more evenly spaced than the roots of $f$. The same holds for a real entire function of order~1 with all its zeros on a line. In…
In this note we initiate the probabilistic study of the critical points of polynomials of large degree with a given distribution of roots. Namely, let f be a polynomial of degree n whose zeros are chosen IID from a probability measure mu on…
This article studies the zeros of Dedekind zeta functions. In particular, we establish a smooth explicit formula for these zeros and we derive an effective version of the Deuring-Heilbronn phenomenon. In addition, we obtain an explicit…
Univariate polynomial root-finding is both classical and 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 polynomial…
In this paper, we modify the Newton-Secant method with third order of convergence for finding multiple roots of nonlinear equations. Per iteration this method requires two evaluations of the function and one evaluation of its first…
We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…
We investigate the zeros of polynomial solutions to the differential-difference equation \[ P_{n+1}(x)=A_{n}(x)P_{n}^{\prime}(x)+B_{n}(x)P_{n}(x), n=0,1,... \] where $A_{n}$ and $B_{n}$ are polynomials of degree at most 2 and 1…
First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…
The Riemann hypothesis, which states that the non-trivial zeros of the Riemann zeta function all lie on a certain line in the complex plane, is one of the most important unresolved problems in mathematics. Inspired by the P\'olya-Hilbert…
We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…
We consider nonnegative solutions to $-\Delta u=f(u)$ in half-planes and strips, under zero Dirichlet boundary condition. Exploiting a rotating$\&$sliding line technique, we prove symmetry and monotonicity properties of the solutions, under…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…