Related papers: New classes of matrix decompositions

The principal objective of this paper is to determine the structure of $n$-Lie derivations ($n\geq 3$) on generalized matrix algebras.It is shown that under certain mild assumptions, every $n$-Lie derivation can be decomposed into the sum…

In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…

We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulations, which provide another way of counting the number of…

Results on matrix canonical forms are used to give a complete description of the higher rank numerical range of matrices arising from the study of quantum error correction. It is shown that the set can be obtained as the intersection of…

We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an…

Two new matrix classes are introduced; inverse cyclic matrices and bi-diagonal south-west matrices. An interesting relation is established between these classes. Applications to two classes of inverse $Z$-matrices are provided.

The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

In matching theory, one of the most fundamental and classical branches of combinatorics, {\em canonical decompositions} of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known…

Let $\mathscr{R}$ be a type $II_1$ von Neumann algebra. We show that every unitary in $\mathscr{R}$ may be decomposed as the product of six symmetries (that is, self-adjoint unitaries) in $\mathscr{R}$, and every unitary in $\mathscr{R}$…

To study the set of torsion classes of a finite dimensional basic algebra, we use a decomposition, called sign-decomposition, parametrized by elements of $\{\pm1\}^n$ where $n$ is the number of simple modules. If $A$ is an algebra with…

Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…

Balanced weighing matrices with parameters $$ \left(1+18\cdot\frac{9^{m+1}-1}{8},9^{m+1},4\cdot 9^m\right), $$ for each nonzero integer $m$ is constructed. This is the first infinite class not belonging to those with classical parameters.…

We characterize in terms of inequalities the possible generalized singular numbers of a product AB of operators A and B having given generalized singular numbers, in an arbitrary finite von Neumann algebra. We also solve the analogous…

We consider a $Q$-polynomial distance-regular graph $\Gamma$ with vertex set $X$ and diameter $D \geq 3$. For $\mu, \nu \in \lbrace \downarrow, \uparrow \rbrace$ we define a direct sum decomposition of the standard module $V=\C X$, called…

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…

In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…