Related papers: The miracle of integer eigenvalues
A square matrix of order $n$ with $n\geq 2$ is called a \textit{permutative matrix} or permutative when all its rows (up to the first one) are permutations of precisely its first row. In this paper, the spectra of a class of permutative…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…
We consider the map X defined on the rational numbers given by x --> x * ceil(x), where ceil(x) denotes the smallest integer greater than or equal to x, and study the problem of finding, for each rational, the smallest number of iterations…
We pursue the question how integers can be ordered or partitioned according to their divisibility properties. Based on pseudometrics on $\mathbb{Z}$, we investigate induced preorders, associated equivalence relations, and quotient sets. The…
The product of a Hermitian matrix and a positive semidefinite matrix has only real eigenvalues. We present bounds for sums of eigenvalues of such a product.
We determine the structure of linear maps on complex (real) square matrices sending unitary (orthogonal) matrices to multiples of unitary (orthogonal) matrices. The result is used to determine the linear preservers of matrix pairs…
A theorem of Mirsky provides necessary and sufficient conditions for the existence of an N-square complex matrix with prescribed diagonal entries and prescribed eigenvalues. We give a simple inductive proof of this theorem.
We give a criterion when an expansion of the ordered set of real numbers defines the image of the expansion of the real field by the set of natural numbers under a semialgebraic injection. In particular, we show that for a non-quadratic…
The diagonalization of matrices may be the top priority in the application of modern physics. In this paper, we numerically demonstrate that, for real symmetric random matrices with non-positive off-diagonal elements, a universal scaling…
We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…
Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…
We consider matrices containing two diagonal bands of positive entries. We show that all eigenvalues of such matrices are of the form $r \zeta$, where $r$ is a nonnegative real number and $\zeta$ is a $p$th root of unity, where $p$ is the…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
A truncation of a Haar distributed orthogonal random matrix gives rise to a matrix whose eigenvalues are either real or complex conjugate pairs, and are supported within the closed unit disk. This is also true for a product $P_m$ of $m$…
In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…
We obtain generalisations of some inequalities for positive unital linear maps on matrix algebra. This also provides several positive semidefinite matrices and we get some old and new inequalities involving the eigenvalues of a Hermitian…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…