Related papers: On stable range one matrices
We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…
The joint spectral radius of a bounded set of d times d real or complex matrices is defined to be the maximum exponential rate of growth of products of matrices drawn from that set. A set of matrices is said to satisfy the finiteness…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbolic dynamics. We consider this stable algebra (especially, shift equivalence and strong shift equivalence) for matrices over general rings as…
We consider a class of simple one parameter families of interval maps, and we study how metric (resp. topological) entropy changes as the parameter varies. We show that in many cases the entropy displays a semi-regular behaviour, i.e. it is…
The standard theorem for regular stochastic matrices is generalized to matrices with no sign restriction on the entries. The condition that column sums be equal to 1 is kept, but the regularity condition is replaced by a condition on the…
Jacobson's commutativity theorem says that a ring is commutative if, for each $x$, $x^n = x$ for some $n > 1$. Herstein's generalization says that the condition can be weakened to $x^n-x$ being central. In both theorems, $n$ may depend on…
An element of a ring $R$ is strongly $P$-clean provided that it can be written as the sum of an idempotent and a strongly nilpotent element that commute. A ring $R$ is strongly $P$-clean in case each of its elements is strongly $P$-clean.…
We prove that the range of a symmetric matrix over F_2 contains the vector of its diagonal elements. We apply the theorem to a generalization of the "Lights Out" problem on graphs.
By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…
It is well known that, for mass-action systems, complex-balanced equilibria are asymptotically stable. For generalized mass-action systems, even if there exists a unique complex-balanced equilibrium (in every stoichiometric class and for…
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 study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
In the design of decentralized networked systems, it is useful to know whether a given network topology can sustain stable dynamics. We consider a basic version of this problem here: given a vector space of sparse real matrices, does it…
If matrices almost satisfying a group relation are close to matrices exactly satisfying the relation, then we say that a group is matricially stable. Here "almost" and "close" are in terms of the Hilbert-Schmidt norm. Using tracial 2-norm…
The (co)completeness problem for the (projectively) stable module category of an associative ring is studied. (Normal) monomorphisms and (normal) epimorphisms in such a category are characterized. As an application, we give a criterion for…
A result of Borg--Hochstadt in the theory of periodic Jacobi matrices states that such a matrix has constant diagonals as long as all gaps in its spectrum are closed (have zero length). We suggest a quantitative version of this result by…
This paper considers the problem of matrix completion when some number of the columns are completely and arbitrarily corrupted, potentially by a malicious adversary. It is well-known that standard algorithms for matrix completion can return…
We investigate the properties of uniform doubly stochastic random matrices, that is non-negative matrices conditioned to have their rows and columns sum to 1. The rescaled marginal distributions are shown to converge to exponential…
Let B be a ring and $A=B[X,Y]/(aX^2+bXY+cY^2-1)$ where $a,b,c\in B$. We study the smoothness of A over B, and the regularity of B when B is a ring of algebraic integers.