Related papers: Bounds on polynomial roots using intercyclic compa…

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We look at Bohemians, specifically those with population $\{-1, 0, {+1}\}$ and sometimes $\{0,1,i,-1,-i\}$. More, we specialize the matrices to be upper Hessenberg Bohemian. From there, focusing on only those matrices whose characteristic…

For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

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 give a version of Krivine-Stengle's Positivstellensatz, Schweighofer's Positivstellensatz, Scheiderer's local-global principle, Scheiderer's Hessian criterion and Marshall's boundary Hessian conditions for polynomial…

We study the fundamental challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over $\mathbb{F}_{2}$. Our main contributions include: 1. In STOC 2020, CHHLZ introduced a new technique to prove…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

We study the time-harmonic Maxwell equations on bounded Lipschitz domains with an impedance boundary condition. The impedance coefficient can be matrix valued such that, in particular, a polarization dependent impedance is modeled. We…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke,…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

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…

If a real polynomial $f(x)=p(x^2)+xq(x^2)$ is Hurwitz stable (every root if $f$ lies in the open left half-plane), then the Hermite-Biehler Theorem says that the polynomials $p(-x^2)$ and $q(-x^2)$ have interlacing real roots. We extend…