Related papers: A similarity canonical form for max-plus matrices …

We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…

Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…

In order to guarantee the downloading quality requirements of users and improve the stability of data transmission in a BitTorrent-like peer-to-peer file sharing system, this article deals with eigenproblems of addition-min algebras. First,…

We put forward and prove a simple theorem stating that the eigenvalues of a tridiagonal matrix change their sign (as a set), once the signs of the diagonal elements of the matrix are changed. We also provide an example of application of…

To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…

This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to…

The Davis-Kahan theorem can be used to bound the distance of the spaces spanned by the first $r$ eigenvectors of any two symmetric matrices. We extend the Davis-Kahan theorem to apply to the comparison of the union of eigenspaces of any two…

An orthonormal basis matrix $X$ of a subspace ${\cal X}$ is known not to be unique, unless there are some kinds of normalization requirements. One of them is to require that $X^{\rm T}D$ is positive semi-definite, where $D$ is a constant…

Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…

We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…

It is known that the solvability of a Sylvester equation over max-plus algebra can be determined in polynomial time by verifying its principal solution. A succinct representation of the principal solution is presented, with a more accurate…

Supertropical matrix theory was investigated in [6], whose terminology we follow. In this work we investigate eigenvalues, characteristic polynomials and coefficients of characteristic polynomials of supertropical matrices and their powers,…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…

A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The proof utilizes recently developed guaranteed computation methods for both eigenvalues and…

V.I. Arnold [Russian Math. Surveys 26(2) (1971) 29-43] constructed a miniversal deformation of a square complex matrix under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it…

We define a new class of binary matrices by maximizing the peak-sidelobe distances in the aperiodic autocorrelations. These matrices can be used as robust position marks for in-plane spatial alignment. The optimal square matrices of…

Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolutions. These convolutions preserve real-rootedness and…