Related papers: A Stability Version of the Gauss-Lucas Theorem and…

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…

Using the fixed point theorem we establish the Hyers-Ulam-Rassias stability of the generalized Pexider functional equation $$\frac{1}{\mid K\mid}\sum_{k\in K}f(x+k\cdot y)=g(x)+h(y),\;\;x,y\in E$$ from a normed space $E$ into a complete…

For dispersive Hamiltonian partial differential equations of order 2N+1, N integer, there are two criteria to analyse to examine the stability of small-amplitude, periodic travelling wave solutions to high-frequency perturbations. The first…

Let $p(x)=a_0 + a_1 x + \ldots + a_n x^n$ be a polynomial with all roots real and satisfying $x \leq -\delta$ for some $0<\delta <1$. We show that for any $0 < \epsilon <1$, the value of $p(1)$ is determined within relative error $\epsilon$…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

We study the spaces of polynomials stratified into the sets of polynomial with fixed number of roots inside certain semialgebraic region $\Omega$, on its border, and at the complement to its closure. Presented approach is a generalisation,…

The theory of polar forms of polynomials is used to provide for sharp bounds on the radius of the largest possible disc (absolute stability radius), and on the length of the largest possible real interval (parabolic stability radius), to be…

We review some known inclusion results for the roots of a polynomial, and adapt them to a conjecture recently presented by S. A. Vavasis. In particular, we provide strict upper and lower bounds to the distance of the closest root of a…

In this work, a convergence lemma for function $f$ being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of $\delta$-stationary points near an isolated local minimum point $x^*$ is…

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…

Given a closed, convex cone $K\subseteq \mathbb{R}^n$, a multivariate polynomial $f\in\mathbb{C}[\mathbf{z}]$ is called $K$-stable if the imaginary parts of its roots are not contained in the relative interior of $K$. If $K$ is the…

We study critical points of holomorphic sections of $\ocal(m)$ on $\CP^n$. For quadrics, we give a complete discription of their critical points. When $n=1$, we prove a spherical Gauss-Lucas theorem. For general situation, we prove that a…

We prove the orbital stability of soliton solutions for 2D Maxwell--Lorentz system with extended charged particle. The solitons corresponds to the uniform motion and rotation of the particle. We reduce the corresponding Hamilton system by…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…

According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has at most $2^{n+O\left({n^{2/3}\log n}\right)}$…

We prove that any stable method for resolving the Gibbs phenomenon - that is, recovering high-order accuracy from the first $m$ Fourier coefficients of an analytic and nonperiodic function - can converge at best root-exponentially fast in…

Let $p_n:\mathbb{C} \rightarrow \mathbb{C}$ be a random complex polynomial whose roots are sampled i.i.d. from a radial distribution $u(r) r dr$ in the complex plane. A natural question is how the distribution of roots evolves under…

In this paper, we propose a distributed computing approach to solving large-scale robust stability problems on the simplex. Our approach is to formulate the robust stability problem as an optimization problem with polynomial variables and…

Let $k$ be a field. Then Gaussian elimination over $k$ and the Euclidean division algorithm for the univariate polynomial ring $k[x]$ allow us to write any matrix in $SL_n(k)$ or $SL_n(k[x])$, $n\geq 2$, as a product of elementary matrices.…