Related papers: Matrix multiplication is determined by orthogonali…

Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…

A binary matrix can be scanned by moving a fixed rectangular window (submatrix) across it, rather like examining it closely under a microscope. With each viewing, a convenient measurement is the number of 1s visible in the window, which…

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

In this article, we consider birational equivalence of exponential matrices. In characteristic zero, we give a birational classification of exponential matrices of size $n$-by-$n$ $(n \geq 2)$, which consists of two types. And in positive…

We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…

Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…

Denote by $w(T)$ the numerical radius of a matrix $T$. An elementary proof is given to the fact that $w(AB) \leq w(A)w(B)$ for a pair of commuting matrices of order two, and characterization is given for the matrix pairs that attain the…

It is known that if A and B are two n-by-n complex matrices and (A,A^T) is simultaneously equivalent to (B,B^T), then A is congruent to B. We extend this statement to multilinear forms.

On the set of mappings of the given set, we define the product of mappings. If A is associative algebra, then we consider the set of matrices, whose elements are linear mappings of algebra A. In algebra of matrices of linear mappings we…

Working in the multitape Turing model, we show how to reduce the problem of matrix transposition to the problem of integer multiplication. If transposing an $n \times n$ binary matrix requires $\Omega(n^2 \log n)$ steps on a Turing machine,…

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…

Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices over a field $\mathbb{F}$ of characteristic not equal to $2$. If $n\ge 2$, we show that an arbitrary map $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$ is Jordan multiplicative,…

Let $\mathfrak{R}$ and $\mathfrak{R}'$ be two associative rings (not necessarily with the identity elements). A bijective map $\varphi$ of $\mathfrak{R}$ onto $\mathfrak{R}'$ is called a \textit{$m$-multiplicative isomorphism} if {$\varphi…

We study pairs of mutually orthogonal normal matrices with respect to tropical multiplication. Minimal orthogonal pairs are characterized. The diameter and girth of three graphs arising from the orthogonality equivalence relation are…

Given an arbitrary field K and non-zero scalars a and b, we give necessary and sufficient conditions for a matrix A in M_n(K) to be a linear combination of two idempotents with coefficients a and b. This extends results previously obtained…

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…

We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank…