Related papers: On the Finiteness Property for Rational Matrices
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…
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…
We study the ergodicity of backward product of stochastic and doubly stochastic matrices by introducing the concept of absolute infinite flow property. We show that this property is necessary for ergodicity of any chain of stochastic…
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…
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…
In this paper we discuss the relationship between direct products of monounary algebras and their components, with respect to the properties of residual finiteness, strong/weak subalgebra separability, and complete separability. For each of…
We consider small factor analysis models with one or two factors. Fixing the number of factors, we prove a finiteness result about the covariance matrix parameter space when the size of the covariance matrix increases. According to this…
We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
By modifying the proof of a paper by O. Bournez and M. Branicky, we establish that the Matrix Mortality Problem is decidable with any finite set of $2\times2$ matrices which has at most one invertible matrix. The same modification also…
The lower spectral radius of a set of $d \times d$ matrices is defined to be the minimum possible exponential growth rate of long products of matrices drawn from that set. When considered as a function of a finite set of matrices of fixed…
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
Experiments suggest that typical finite sets of square matrices admit spectrum maximizing products (SMPs): that is, products that attain the joint spectral radius (JSR). Furthermore, those SMPs are often combinatorially "simple." In this…
Fourier matrices naturally appear in many applications and their stability is closely tied to performance guarantees of algorithms. The starting point of this article is a result that characterizes properties of an exponential system on a…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
We discuss in details a modified variational matrix-product-state algorithm for periodic boundary conditions, based on a recent work by P. Pippan, S.R. White and H.G. Everts, Phys. Rev. B 81, 081103(R) (2010), which enables one to study…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…