Related papers: Stability Of Matrix Polynomials In One And Several…
The file contains PhD Dissertation by Oskar Jakub Szyma\'nski. This work ends his study at Doctoral School of Exact and Natural Sciences at Jagiellonian University where the Author has attended in years 2019-2024. The subject of the Thesis…
We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
It is known that a matrix polynomial with unitary matrix coefficients has its eigenvalues in the annular region $\frac{1}{2} < |\lambda| < 2$. We prove in this short note that under certain assumptions, matrix polynomials with either doubly…
The aim of this paper is to make a systematical study on the stability of polynomials in combinatorics. Applying the characterizations of Borcea and Br\"and\'en concerning linear operators preserving stability, we present criteria for real…
We introduce and study the notion of conic stability of multivariate complex polynomials in $\mathbb{C}[z_1,\ldots, z_n]$, which naturally generalizes the stability of multivariate polynomials. In particular, we generalize Borcea's and…
This paper elaborates on a relationship between matrix-valued Herglotz-Nevanlinna functions and Hurwitz stable matrix polynomials, which generalizes the corresponding classical stability criterion. The main motivation comes from the…
In this paper, we study the stability of the concentration inequality for one-dimensional complex polynomials. We provide the stability of the local concentration inequality and a global version using a Wehrl-type entropy.
We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…
A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…
A right quaternion matrix polynomial is an expression of the form $P(\lambda)= \displaystyle \sum_{i=0}^{m}A_i \lambda^i$, where $A_i$'s are $n \times n$ quaternion matrices with $A_m \neq 0$. The aim of this manuscript is to determine the…
We study continuity of the roots of nonmonic polynomials as a function of their coefficients using only the most elementary results from an introductory course in real analysis and the theory of single variable polynomials. Our approach…
Univariate polynomials with only real roots -- while special -- do occur often enough that their properties can lead to interesting conclusions in diverse areas. Due mainly to the recent work of two young mathematicians, Julius Borcea and…
We present a novel method for checking the Hurwitz stability of a polytope of matrices. First we prove that the polytope matrix is stable if and only if two homogenous polynomials are positive on a simplex, then through a newly proposed…
In this paper we study the stability properties of strongly continuous semigroups generated by block operator matrices. We consider triangular and full operator matrices whose diagonal operator blocks generate polynomially stable…
Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…
Polynomial stability of exact solution and modified truncated Euler-Maruyama method for stochastic differential equations with time-dependent delay are investigated in this paper. By using the well known discrete semimartingale convergence…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
In this paper, we study the stability of matrix polynomials under structured perturbations of their coefficients. More precisely, we consider a family of matrix polynomials \[…
A multivariate polynomial is {\em stable} if it is nonvanishing whenever all variables have positive imaginary parts. We classify all linear partial differential operators in the Weyl algebra $\A_n$ that preserve stability. An important…