Related papers: Borcea's variance conjectures on the critical poin…

We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…

We confirm a conjecture of Monical, Tokcan and Yong on a characterization of the lattice points in the Newton polytopes of key polynomials.

These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…

In many applied problems one seeks to identify and count the critical points of a particular eigenvalue of a smooth parametric family of self-adjoint matrices, with the parameter space often being known and simple, such as a torus. Among…

The Sendov conjecture asserts that if all the zeros of a polynomial p lie in the closed unit disk then there must be a zero of p ' within unit distance of each zero. In this paper we give a partial result when p has simple zeros.

We consider polynomial approximations of z-bar to better understand the torsional rigidity of polygons. Our main focus is on low degree approximations and associated extremal problems that are analogous to Polya's conjecture for torsional…

A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.

We prove that for any circulant matrix $C$ of size $n\times n$ with the monic characteristic polynomial $p(z)$, the spectrum of its $(n-1)\times(n-1)$ submatrix $C_{n-1}$ constructed with first $n-1$ rows and columns of $C$ consists of all…

We present an elementary proof of a conjecture proposed by I. Rasa in 2017 which is an inequality involving Bernstein basis polynomials and convex functions. It was affirmed in positive by A. Komisarski and T. Rajba very recently by the use…

Let $p_n$ be a random, degree $n$ polynomial whose roots are chosen independently according to the probability measure $\mu$ on the complex plane. For a deterministic point $\xi$ lying outside the support of $\mu$, we show that almost…

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

Recent developments of affine algebraic geometry, especially the theory of open algebraic surfaces, provide means to systematically explore geometric and topological properties of polynomials in two variables. Nevertheless, there is one…

We have discussed earlier the correlation functions of the random variables $\det(\la-X)$ in which $X$ is a random matrix. In particular the moments of the distribution of these random variables are universal functions, when measured in the…

Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

In this article, we study critical points (zeros of derivative) of random polynomials. Take two deterministic sequences $\{a_n\}_{n\geq1}$ and $\{b_n\}_{n\geq1}$ of complex numbers whose limiting empirical measures are same. By choosing…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…