Related papers: On stable range one matrices
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
We study a class of square matrices with non-negative elements which have cyclically monotone rows in the sense that each row of a matrix from the class consists of a cyclically non-increasing sequence of numbers starting from a maximal…
A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…
A ring $R$ is called strongly clean if every element of $R$ is the sum of a unit and an idempotent that commute. By {\rm SRC} factorization, Borooah, Diesl, and Dorsey \cite{BDD051} completely determined when ${\mathbb M}_n(R)$ over a…
The matricial range of the $2\times2$ matrix $E_{21}$ (i.e., the $2\times 2$ unilateral shift) is described very simply: it consists of all matrices with numerical radius at most $1/2$. The known proofs of this simple statement, however,…
A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…
We prove that the following statements are equivalent: a linear matrix equation with parameters forming a commuting set of diagonalizable matrices is consistent, a certain matrix constructed with the Drazin inverse is a solution of this…
Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…
A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…
The effect of replacing a basis element on the way the basis spans other elements is studied. This leads to a new characterization of binary matroids.
We study algebraic properties of full rank 1 algebras in a general framework and derive a method to verify if one such matrix polynomial sub-algebra is bispectral. We give two examples illustrating the method. In the first one, we consider…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…
An endo-commutative algebra is a nonassociative algebra in which the square mapping preserves multiplication. In this paper, we give a complete classification of 2-dimensional endo-commutative straight algebras of rank one over an arbitrary…
The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…
We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…
The purpose of this paper is to show that if the spectral radius of the matrix of the linearized system of a nonlinear discrete dynamical system is less then one then the characterization theorem from \cite{KBBB1,KBGB2} holds.
We prove that the algebraic set of pairs of matrices with a diagonal commutator over a field of positive prime characteristic, its irreducible components, and their intersection are $F$-pure when the size of matrices is equal to 3.…
In this lecture note, we discuss a fundamental concept, referred to as the {\it characteristic rank}, which suggests a general framework for characterizing the basic properties of various low-dimensional models used in signal processing.…
A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…