Related papers: Matrix Roots of Eventually Positive Matrices
Given a finite Markov chain, we investigate the first minors of the transition matrix of a lifting of this Markov chain to covering trees. In a simple case we exhibit a nice factorisation of these minors, and we conjecture that it holds…
A root systems in Carroll spaces with degenerate metric are defined. It is shown that their Cartan matrices and reflection groups are affine. With the help of the geometric consideration the root system structure of affine algebras is…
A nonnegative matrix $A$ is called primitive if $A^k$ is positive for some integer $k>0$. A generalization of this concept to finite sets of matrices is as follows: a set of matrices $\mathcal M = \{A_1, A_2, \ldots, A_m \}$ is primitive if…
We study pairs of finitely generated modules over a principal ideal domain and their corresponding matrix representations. We introduce equivalence relations for such pairs and determine invariants and canonical forms.
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
Positive-definite matrices materialize as state transition matrices of linear time-invariant gradient flows, and the composition of such materializes as the state transition after successive steps where the driving potential is suitably…
We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.
We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…
A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…
We resolve an algebraic version of Schoenberg's celebrated theorem [Duke Math.J., 1942] characterizing entrywise matrix transforms that preserve positive definiteness. Compared to the classical real and complex settings, we consider…
In prioritization schemes, based on pairwise comparisons, such as the Analytical Hierarchy Process, it is necessary to extract a cardinal ranking vector from a reciprocal matrix that is unlikely to be consistent. It is natural to choose…
Roots of matrices are well-studied. The conditions for their existence are understood: The block sizes of nilpotent Jordan blocks, arranged in pairs, have to satisfy some simple algebraic property. More interesting are structured roots of…
We define and study the class of positively finitely related (PFR) profinite groups. Positive finite relatedness is a probabilistic property of profinite groups which provides a first step to defining higher finiteness properties of…
Let $p_1<p_2<\cdots<p_n$ be positive real numbers. It is shown that the matrix whose $i,j$ entry is $(p_i+p_j)^{p_i+p_j}$ is infinitely divisible, nonsingular and totally positive.
In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…
An operator convex function on (0,\infty) which satisfies the symmetry condition k(1/x) = x k(x) can be used to define a type of non-commutative multiplication by a positive definite matrix (or its inverse) using the primitive concepts of…
In this note, we consider arbitrary finite-dimensional real algebras containing a copy of complex numbers. It is proved that matrices with entries from an arbitrary finite-dimensional real algebra containing a square root of negative one in…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…