Related papers: Upper bounds for the moduli of polynomial-like map…

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

In 1985, Levy used a theorem of Berstein to prove that all hyperbolic topological polynomials are equivalent to complex polynomials. We prove a partial converse to the Berstein-Levy Theorem: given post-critical dynamics that are in a sense…

We derive upper bounds for the smallest zero and lower bounds for the largest zero of Laguerre, Jacobi and Gegenbauer polynomials. Our approach uses mixed three term recurrence relations satisfied by polynomials corresponding to different…

We study mappings that satisfy the inverse modulus inequality of Poletsky type in a fixed domain. It is shown that, under some additional restrictions, the image of a ball under such mappings contains a fixed ball uniformly over the class.…

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

We prove that if $f$ is a polynomial over a number field $K$ with a finite superattracting periodic point and a non-archimedean place of bad reduction, then there is an $\epsilon>0$ such that only finitely many $P\in K^{\text{ab}}$ have…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Some new bounds for the extreme zeroes of Jacobi polynomials are obtained with an elementary approach. A feature of these bounds is their simple forms, which make them easy to work with. Despite their simplicity, our lower bounds for the…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

We prove an analogue of the Yomdin-Gromov Lemma for $p$-adic definable sets and more broadly in a non-archimedean, definable context. This analogue keeps track of piecewise approximation by Taylor polynomials, a nontrivial aspect in the…

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Let $\cMx$ be the moduli space of stable vector bundles of rank $n\geq 3$ and determinant $\xi$ over a connected Riemann surface $X$, with $n$ and $d(\xi)$ coprime. Let $D$ be a Calabi-Yau hypersurface of $\cMx$. Denote by $U_D$ the…

For the study of the 2-dimensional space of cubic polynomials, J. Milnor considers the complex 1-dimensional slice S_n of the cubic polynomials which have a super-attracting orbit of period n. He gives in [M4] a detailed conjectural picture…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…