English
Related papers

Related papers: Polynomials that preserve nonnegative matrices

200 papers

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

Functional Analysis · Mathematics 2023-02-23 Chi-Kwong Li , Ming-Cheng Tsai , Ya-Shu Wang , Ngai-Ching Wong

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

Mathematical Physics · Physics 2007-07-06 Christopher J. Hillar , Charles R. Johnson

Quadratic eigenvalue problems (QEP) and more generally polynomial eigenvalue problems (PEP) are among the most common types of nonlinear eigenvalue problems. Both problems, especially the QEP, have extensive applications. A typical approach…

Numerical Analysis · Mathematics 2017-11-07 Yiling You , Jose Israel Rodriguez , Lek-Heng Lim

We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…

Algebraic Geometry · Mathematics 2026-05-29 Abhishek Deshpande , Stefan Müller

We show that there exist absolute constants $\Delta > \delta > 0$ such that, for all $n \geqslant 2$, there exists a polynomial $P$ of degree $n$, with $\pm 1$ coefficients, such that $$\delta\sqrt{n} \leqslant |P(z)| \leqslant…

Classical Analysis and ODEs · Mathematics 2019-07-23 Paul Balister , Béla Bollobás , Robert Morris , Julian Sahasrabudhe , Marius Tiba

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We prove that any lower unitriangular and totally nonnegative matrix gives rise to a family of polynomials with only real zeros. This has consequences for problems in several areas of mathematics. We use it to develop a general theory for…

Combinatorics · Mathematics 2026-05-22 Petter Brändén , Leonardo Saud Maia Leite

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…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

We give a new demonstration of Loewner's characterization of polynomials, solving in the positive a conjecture proposed by Laird and McCann in 1984.

Classical Analysis and ODEs · Mathematics 2016-05-04 J. M. Almira

The seminal work by Mackey et al. in 2006 (reference [21] of the article) introduced vector spaces of matrix pencils, with the property that almost all the pencils in the spaces are strong linearizations of a given square regular matrix…

Numerical Analysis · Mathematics 2018-08-03 Biswajit Das , Shreemayee Bora

We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…

Rings and Algebras · Mathematics 2016-08-16 Tim Netzer , Andreas Thom

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

q-alg · Mathematics 2008-02-03 Dror Bar-Natan

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

Rings and Algebras · Mathematics 2025-01-07 Alina G. Goutor

Univariate polynomial root-finding is a classical subject, still 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…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

Classical Analysis and ODEs · Mathematics 2026-03-19 Stefan Kahler , Josef Obermaier

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for…

Complex Variables · Mathematics 2013-08-02 Albrecht Boettcher

Starting from degree N solutions of a time dependent Schroedinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has…

Classical Analysis and ODEs · Mathematics 2015-06-23 Ryu Sasaki

Several new transformations for q-binomial coefficients are found, which have the special feature that the kernel is a polynomial with nonnegative coefficients. By studying the group-like properties of these positivity preserving…

Combinatorics · Mathematics 2009-12-09 Alexander Berkovich , S. Ole Warnaar

Using a variety of matrix techniques, the problem of locating the left eigenvalues of the quaternion companion matrices are investigated in this paper. In a recent paper, Dar et al. [6], proved that the zeros of a quaternionic polynomial…

Complex Variables · Mathematics 2024-03-14 N. A. Rather , Naseer Ahmad Wani , Ishfaq Dar

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

Formal Languages and Automata Theory · Computer Science 2022-05-20 S Akshay , Supratik Chakraborty , Debtanu Pal
‹ Prev 1 4 5 6 7 8 10 Next ›