Related papers: On stable range one matrices
We explore the integration of representations from a Lie algebra to its algebraic group in positive characteristic. An integrable module is stable under the twists by group elements. Our aim is to investigate cohomological obstructions for…
We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
In this article, we study the ideal generated by $2\times 2$ permanents of a symmetric matrix. We denote this ideal by $P_2(X)$ where $X$ is a symmetric matrix. We compute a Gr\"obner basis, dimension, depth, minimal primes, and a primary…
We established two-sided Curto-Herrero conjecture for pairs of matrices, where the first matrix has a simple spectrum. Namely, it is shown that these pairs are separated by ranks of non-commutative polynomials in matrices. Moreover, we…
The set of controllers stabilizing a linear system is generally non-convex in the parameter space. In the case of two-parameter controller design (e.g. PI control or static output feedback with one input and two outputs), we observe however…
It is proved that a commutative ring is clean if and only if it is Gelfand with a totally disconnected maximal spectrum. Commutative rings for which each indecomposable module has a local endomorphism ring are studied. These rings are clean…
Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…
We analyse the stability of large, linear dynamical systems of variables that interact through a fully connected random matrix and have inhomogeneous growth rates. We show that in the absence of correlations between the coupling strengths,…
We show that if a rational map is constant on each isomorphism class of unpolarized abelian varieties of a given dimension, then it is a constant map. Our results are motivated by and shed light on a proposed construction of a cryptographic…
We study the variety of n by n matrices with commutator of rank at most one. We describe its irreducible components; two of them correspond to the pairs of commuting matrices, and n-2 components of smaller dimension corresponding to the…
We introduce a weaker form of the specification property, called "one-way specification property", and give several examples of non-transitive systems satisfying this property. As an application, we show that the $(-\beta)$-transformation…
Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…
The IIB matrix model is one of the candidates for nonperturbative formulation of string theory, and it is believed that the model contains gravitational degrees of freedom in some manner. In some preceding works, it was proposed that the…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…
On a non-compact, smooth, connected, boundaryless, complete Riemannian manifold $(M,g)$, one can define its ideal boundary by rays (or equivalently, Busemann functions). From the viewpoint of Mather theory, boundary elements could be…
We introduce the class of strong cocomparability graphs, as the class of reflexive graphs whose adjacency matrix can be rearranged by a simultaneous row and column permutation to avoid the submatrix with rows 01, 10, which we call Slash. We…
We use classical results from the theory of linear preserver problems to characterize operators that send the set of pure states with Schmidt rank no greater than k back into itself, extending known results characterizing operators that…
A $(0,1)$-matrix has the Consecutive Ones Property (C1P) for the rows if there is a permutation of its columns such that the ones in each row appear consecutively. We say a $(0, 1)$-matrix is nested if it has the consecutive ones property…