Related papers: Polynomial convolutions in max-plus algebra
We examine two binary operations on the set of algebraic polynomials, known as multiplicative and additive finite free convolutions, specifically in the context of hypergeometric polynomials. We show that the representation of a…
We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices.…
We consider the three finite free convolutions for polynomials studied in a recent paper by Marcus, Spielman, and Srivastava. Each can be described either by direct explicit formulae or in terms of operations on randomly rotated matrices.…
The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is a semiring with the two operations: addition $a \oplus b := \max(a,b)$ and multiplication $a \otimes b := a + b$. Roots of the characteristic polynomial of a max-plus matrix are called…
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
Our aim is to study matrix polynomials over max-algebras and their growth in terms of a max-induced semi-norm. We investigate the relationship between the asymptotic growth of polynomial products and the joint spectral radius of the…
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…
We introduce a finite version of free probability and show the link between recent results using polynomial convolutions and the traditional theory of free probability. One tool for accomplishing this is a seemingly new transformation that…
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,…
The purpose of this article is to investigate triangularization and simultaneous triangularization of matrices over max algebras using graph theoretic methods. We establish a connection between commutators and commutants with simultaneous…
This paper describes the expected characteristic polynomial of the commutator of randomly rotated matrices, in the context of the finite free probability theory initiated by Marcus, Spielman, and Srivastava. The key technical features are…
Initiated by a result of Gorin and Marcus [Int. Math. Res. Not., (3):883--913, 2020] and an observation of Steinerberger [Proc. Amer. Math. Soc., 147(11):4733--4744, 2019], there has been a recent growing body of literature connecting…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…
Univariate polynomial root-finding is both classical and 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 polynomial…
Let us extend the pair of operations (max,+) over real numbers to matrices in the same way as in conventional linear algebra. We study integer images of max-plus linear mappings. The question whether Ax (in the max-plus algebra) is an…
Let $\mu$ be a compactly supported probability measure on the real line. Bercovici-Voiculescu and Nica-Speicher proved the existence of a free convolution power $\mu^{\boxplus k}$ for any real $k \geq 1$. The purpose of this short note is…
We study in detail the class of even polynomials and their behavior with respect to finite free convolutions. To this end, we use some specific hypergeometric polynomials and a variation of the rectangular finite free convolution to…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…