Related papers: The structure of strong linear preservers of gw-ma…

Various notions of joint majorization are examined in continuous matrix algebras. The relative strengths of these notions are established via proofs and examples. In addition, the closed convex hulls of joint unitary orbits are completely…

Let $M_n(\mathbb{Z})$ the ring of $n$-by-$n$ matrices with integral entries, and $n \geq 2$. This paper studies the set $G_n(\mathbb{Z})$ of pairs $(A,B) \in M_n(\mathbb{Z})^2$ generating $M_n(\mathbb{Z})$ as a ring. We use several…

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact has become the most fundamental theorem in linear algebra such that we may favor it in an unconscious way. The sole aim of this paper is to…

In this paper a complete description of the linear maps $\phi:W_{n}\rightarrow W_{n}$ that preserve the Lorentz spectrum is given when $n=2$ and $W_{n}$ is the space $M_{n}$ of $n\times n$ real matrices or the subspace $S_{n}$ of $M_{n}$…

When K is an arbitrary field, we study the affine automorphisms of M_n(K) that stabilize GL_n(K). Using a theorem of Dieudonn\'e on maximal affine subspaces of singular matrices, this is easily reduced to the known case of linear preservers…

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…

Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…

A mixed dominating set $S$ of a graph $G=(V,E)$ is a subset $ S \subseteq V \cup E$ such that each element $v\in (V \cup E) \setminus S$ is adjacent or incident to at least one element in $S$. The mixed domination number $\gamma_m(G)$ of a…

Starting from a general operator representation in the time-frequency domain, this paper addresses the problem of approximating linear operators by operators that are diagonal or band-diagonal with respect to Gabor frames. A…

The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…

Let $\mathcal{A}$ be a unital algebra over the complex field $\mathbb{C}$. A linear mapping $\delta$ from $\mathcal{A}$ into itself is called a weak (\textit{m,n,l})-Jordan centralizer if…

We consider the max-size popular matching problem in a roommates instance G = (V,E) with strict preference lists. A matching M is popular if there is no matching M' in G such that the vertices that prefer M' to M outnumber those that prefer…

We study the actions of a Lie group $G$ by birationally extendible automorphisms on a domain $D\subset C^n$. For a large class of such domains defined by polynomial inequalities, all automorphisms are of this type. In the cases 1) $G$ has…

For every nonconstant monic polynomial $g \in \mathbb{Z}[X]$, let $\mathfrak{M}(g)$ be the set of positive integers $m$ for which there exist an integer linear recurrence $(s_n)_{n \geq 0}$ having characteristic polynomial $g$ and a…

Let $G_n= \prod_{k=0}^n \binom{n}{k},$ the product of the elements of the $n$-th row of Pascal's triangle. This paper studies the partial factorizations of $G_n$ given by the product $G(n,x)$ of all prime factors $p$ of $G_n$ having $p \le…

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…

The matrix units of a digraph algebra, A, induce a relation, known as the diagonal order, on the projections in a masa in the algebra. Normalizing partial isometries in A act on these projections by conjugation; they are said to be order…

The completely positive maps, a generalization of the nonnegative matrices, are a well-studied class of maps from $n\times n$ matrices to $m\times m$ matrices. The existence of the operator analogues of doubly stochastic scalings of…