Related papers: On the Right Eigenvalues of the Quaternionic Matri…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

The purpose of this paper is to derive the Hoffman-Wielandt inequality and its generalization for quaternion matrices. Diagonalizability of the block companion matrix of certain quadratic (linear) quaternion matrix polynomials is brought…

We define zonal polynomials of quaternion matrix argument and deduce some important formulae of zonal polynomials and hypergeometric functions of quaternion matrix argument. As an application, we give the distributions of the largest and…

We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.

Horn's problem, i.e., the study of the eigenvalues of the sum $C=A+B$ of two matrices, given the spectrum of $A$ and of $B$, is re-examined, comparing the case of real symmetric, complex Hermitian and self-dual quaternionic $3\times 3$…

We introduce the quaternionic Mahler measure for non-commutative polynomials, extending the classical complex Mahler measure. We establish the existence of quaternionic Mahler measure for slice regular polynomials in one and two variables.…

The Frobenius companion matrix, and more recently the Fiedler companion matrices, have been used to provide lower and upper bounds on the modulus of any root of a polynomial $p(x)$. In this paper we explore new bounds obtained from taking…

We provide a necessary and sufficient condition for matrices in the max-plus algebra to be pseudo-diagonalizable, calculate the powers of pseudo-diagonal matrices and prove the invariance of optimal-node matrices and separable matrices…

The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…

In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…

In this paper we present a complete method for finding the roots of all polynomials of the form $\phi(z)=c_n z^n+c_{n-1} z^{n-1}+\dots+c_1 z+c_0$ over a given octonion division algebra. When $\phi(z)$ is monic we also consider the companion…

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

In this contribution we consider sequences of monic polynomials orthogonal with respect to the standard Freud-like inner product involving a quartic potential $\left\langle…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a matrix in $Z$ such that the product matrix…

Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large…

Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

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…