Related papers: Zeros of analytic functions, with or without multi…

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

We give an upper bound for the zero order of the difference between a Mahler function and an algebraic function. This complements estimates of Nesterenko, Nishioka, and T\"opfer, among others, who considered polynomials evaluated at Mahler…

This paper investigates the location of the zeros of a sequence of polynomials generated by a rational function with a binomial-type denominator. We show that every member of a two-parameter family consisting of such generating functions…

We present methods that provide all zeroes and extrema of a function that do not require differentiation. Using point process theory, we are able to describe the locations of zeroes or maxima, their number, as well as their distribution…

We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is…

James Maynard has taken the analytic number theory world by storm in the last decade, proving several important and surprising theorems, resolving questions that had seemed far out of reach. He is perhaps best known for his work on small…

We study the monotonic behaviour of the zeros of the multiple Jacobi-Angelesco orthogonal polynomials, in the diagonal case, with respect to the parameters $\alpha,\beta$ and $\gamma$. We prove that the zeros are monotonic functions of…

Consider an analytical function $f:V\subset\mathbb R^2\rightarrow\mathbb R$ having $0$ as its regular value, a switching manifold $\Sigma=f^{-1}(0)$ and a piecewise analytical vector field $X=(X^+,X^-)$, i.e. $X^\pm$ are analytical vector…

The classical Enestrom-Kakeya theorem establishes upper and lower bounds on the zeros of a polynomial with positive coefficients that are explicit functions of those coefficients. We establish a unifying framework that incorporates this…

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…

In this work, we study fixed point algorithms for finding a zero in the sum of $n\geq 2$ maximally monotone operators by using their resolvents. More precisely, we consider the class of such algorithms where each resolvent is evaluated only…

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

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…

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…

Below the normalized weighted reciprocal of the Christoffel function with respect to exceptional Jacobi polynomials is investigated. It is proved that it tends to the equilibrium measure of the interval of orthogonality in weak-star sense.…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…