Related papers: On stable range one matrices
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
We consider orthogonal transformations of arbitrary square matrices to a form where all diagonal entries are equal. In our main results we treat the simultaneous transformation of two matrices and the symplectic orthogonal transformation of…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
We investigate the stabilizability of linear discrete-time switched systems with singular matrices, focusing on the spectral radius in this context. A new lower bound of the stabilizability radius is proposed, which is applicable to any…
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…
In an attempt to progress towards proving the conjecture the numerical range W (A) is a 2--spectral set for the matrix A, we propose a study of various constants. We review some partial results, many problems are still open. We describe our…
We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and…
The literature about strongly clean matrices over commutative rings is quite extensive. The sharpest results are about matrices over commutative local rings, for example those by Borooah, Diesl and Dorsey. The purpose of this note is to…
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is…
We numerically analyze the random matrix ensembles of real-symmetric matrices with column/row constraints for many system conditions e.g. disorder type, matrix-size and basis-connectivity. The results reveal a rich behavior hidden beneath…
Let $\bf T$ be the group of diagonal matrices in $SL_2(\bar{\mathbb{F}}_p)$, where $p$ is a prime number. Let $\Bbbk$ be an algebraically closed field of characteristic not equal to $2$ and $p$. We classify all the irreducible…
We continue the study of the rich family of norm-closed, automorphism invariant ideals of a continuous nest algebra. First we present a unified framework which captures all stable ideals as the kernels of limits of diagonal compressions. We…
An original non-standard approach to describing the structure of a column stabilizer in a group of $n \times n$ matrices over a polynomial ring or a Laurent polynomial ring of $n$ variables is presented. The stabilizer is described as an…
This report contains a numerical stability analysis of factorization algorithms for computing the Cholesky decomposition of symmetric positive definite matrices of displacement rank 2. The algorithms in the class can be expressed as…
We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…
We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…
In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…
In this paper it is established that all two-dimensional polynomial automorphisms over a regular ring R are stably tame. In the case R is a Dedekind Q-algebra, some stronger results are obtained. A key element in the proof is a theorem…
The present work is dedicated to a better understanding of the stability properties of regularized lattice Boltzmann (LB) schemes. To this extent, linear stability analyses of two-dimensional models are proposed: the standard…
We study the stability properties of linear time-varying systems in continuous time whose system matrix is Metzler with zero row sums. This class of systems arises naturally in the context of distributed decision problems, coordination and…