Related papers: Total nonnegativity and stable polynomials

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

In 2004, Choe, Oxley, Sokal and Wagner established a tight connection between matroids and multiaffine real stable polynomials. Recently, Branden used this theory and a polynomial coming from the Vamos matroid to disprove the generalized…

We consider real univariate polynomials with all roots real. Such a polynomial with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients has $c$ positive and $p$ negative roots counted with multiplicity. Suppose…

$\sigma$-Stable matrices are introduced and it is shown that the real roots of the polynomials comprising the coefficients of the characteristic polynomial indicate the coefficient sign changes. A proof of Obrechkoff is then used to show…

The main goal of this work is to determine which entire functions preserve nonnegativity of matrices of a fixed order $n$ -- i.e., to characterize entire functions $f$ with the property that $f(A)$ is entrywise nonnegative for every…

A long-standing open problem in representation stability is whether every finitely generated commutative algebra in the category of strict polynomial functors satisfies the noetherian property. In this paper, we resolve this problem…

Motivated by questions in robust control and switched linear dynamical systems, we consider the problem checking whether all convex combinations of k matrices in R^{n x n} are stable. In particular, we are interested whether there exist…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

We give a combinatorial proof that the product of a Schubert polynomial by a Schur polynomial is a nonnegative sum of Schubert polynomials. Our proof uses Assaf's theory of dual equivalence to show that a quasisymmetric function of Bergeron…

The first part of this note concerns stable averages of multivariate matching polynomials. In proving the existence of infinite families of bipartite Ramanujan $d$-coverings, Hall, Puder and Sawin introduced the $d$-matching polynomial of a…

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

In this paper we establish some applications of the Scherer-Hol's theorem for polynomial matrices. Firstly, we give a representation for polynomial matrices positive definite on subsets of compact polyhedra. Then we establish a…

In this paper it is established that all two-dimensional polynomial automorphisms over a regular ring R are stably tame. In the case R is a Dedekind Q-algebra, some stronger results are obtained. A key element in the proof is a theorem…

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

In this paper, we consider a dissipative system of one-dimensional piezoelectric beam with magnetic effect and a tip load at the free end of the beam, which is modeled as a special form of double boundary dissipation. Our main aim is to…

We identify the dimension of the centralizer of the symmetric group $\mathfrak{S}_d$ in the partition algebra $\mathcal{A}_d(\delta)$ and in the Brauer algebra $\mathcal{B}_d(\delta)$ with the number of multidigraphs with $d$ arrows and the…

A set $S\subset \mathbb{R}^n$ is a nonnegativity witness for a set $U$ of real homogeneous polynomials if $F$ in $U$ is nonnegative on $\mathbb{R}^n$ if and only if it is nonnegative at all points of $S$. We prove that the union of the…

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…