Related papers: A lower bound for periods of 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…

We proved recently (see \cite{lhgarasu}) the result on the title for odd prime divisors of such an $n.$ The result implies for many $n's$, more precisely, for an infinity of $n$'s with an arbitrary fixed number of prime divisors, the…

A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. This includes numerical stabilization of Gaussian elimination…

In this paper we study the structure and give bounds for the eigenvalues of the $n\times n$ matrix, which $ij$ entry is $(i,j)^\alpha[i,j]^\beta$, where $\alpha,\beta\in\Rset$, $(i,j)$ is the greatest common divisor of $i$ and $j$ and…

A matrix-valued measure $\Theta$ reduces to measures of smaller size if there exists a constant invertible matrix $M$ such that $M\Theta M^*$ is block diagonal. Equivalently, the real vector space ${\mathscr A}$ of all matrices $T$ such…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…

A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…

An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory…

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…

Let $\Omega_n$ denote the class of $n \times n$ doubly stochastic matrices (each such matrix is entrywise nonnegative and every row and column sum is 1). We study the diagonals of matrices in $\Omega_n$. The main question is: which $A \in…

We prove that an n by n random matrix G with independent entries is completely delocalized. Suppose the entries of G have zero means, variances uniformly bounded below, and a uniform tail decay of exponential type. Then with high…

In this text, we consider an N by N random matrix X such that all but o(N) rows of X have W non identically zero entries, the other rows having lass than $W$ entries (such as, for example, standard or cyclic band matrices). We always…

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…

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

Let $A=(a_{j,k})_{j,k \ge 1}$ be a non-negative matrix. In this paper, we characterize those $A$ for which $\|A\|_{\ell_p,\ell_q}$ are determined by their actions on non-negative decreasing sequences, where one of $p$ and $q$ is 1 or…

Algebraic matrix multiplication algorithms are designed by bounding the rank of matrix multiplication tensors, and then using a recursive method. However, designing algorithms in this way quickly leads to large constant factors: if one…

We study systems with finite number of states $A_i$ ($i=1,..., n$), which obey the first order kinetics (master equation) without detailed balance. For any nonzero complex eigenvalue $\lambda$ we prove the inequality $\frac{|\Im \lambda…

In these notes, we consider the problem of finding the logarithm or the square root of a real matrix. It is known that for every real n x n matrix, A, if no real eigenvalue of A is negative or zero, then A has a real logarithm, that is,…