Related papers: A computing strategy and programs to resolve the G…

We study the Matrix Multiplication Verification Problem (MMV) where the goal is, given three $n \times n$ matrices $A$, $B$, and $C$ as input, to decide whether $AB = C$. A classic randomized algorithm by Freivalds (MFCS, 1979) solves MMV…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Let $M_{1,2}(F)$ be the algebra of $3 \times 3$ matrices with orthosymplectic superinvolution $*$ over a field $F$ of characteristic zero. We study the $*$-identities of this algebra through the representation theory of the group…

Given an ordered triple of positive integers $(n,r,b)$, where $1\leq b\leq\binom{n}{r}$, does there exist a matrix of size $r\times n$ with exactly $b$ invertible submatrices of size $r\times r$? Such a matrix is called an $(n,r,b)$-matrix.…

We will give a short proof of the fact that if the algebraic closure of a field $\mathbb F$ is a finite extension, then for $n\geq 3$ the commuting graph $\Gamma(M_n(\mathbb F))$ is connected and its diameter is four.

Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

One might argue that solving a trajectory optimization problem over a million grid points is preposterous. How about solving such a problem at an incredibly fast computational time? On a small form-factor processor? Algorithmic details that…

We observe that any $T(n)$ time algorithm (quantum or classical) for several central linear algebraic problems, such as computing $\det(A)$, $tr(A^3)$, or $tr(A^{-1})$ for an $n \times n$ integer matrix $A$, yields a $O(T(n)) + \tilde…

This paper concerns the enumeration of simultaneous conjugacy classes of $k$-tuples of commuting matrices in the upper triangular group $GT_n(\mathbf F_q)$ and unitriangular group $UT_m(\mathbf F_q)$ over the finite field $\mathbf F_q$ of…

For matrices with displacement structure, basic operations like multiplication, inversion, and linear system solving can all be expressed in terms of the following task: evaluate the product $\mathsf{A}\mathsf{B}$, where $\mathsf{A}$ is a…

I.M. Gelfand and V.A. Ponomarev (1969) proved that the problem of classifying pairs (A,B) of commuting nilpotent operators on a vector space contains the problem of classifying an arbitrary t-tuple of linear operators. Moreover, it contains…

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

An open-source C++ framework for discovering fast matrix multiplication schemes using the flip graph approach is presented. The framework supports multiple coefficient rings -- binary ($\mathbb{Z}_2$), modular ternary ($\mathbb{Z}_3$) and…

For any three $\,n\times n\,$ matrices $\,A,B,X\,$ over a commutative ring $\,S$, we prove that $\,{\rm det}\,(A+B-AXB)={\rm det}\,(A+B-BXA) \in S$. This apparently new formula may be regarded as a ``ternary generalization'' of Sylvester's…

Given a matrix $A$, a matrix nearness problem seeks an $X$ that most closely approximates $A$ in the sense of minimizing $\lVert A - X\rVert$ under a variety of constraints on $X$. A generalized matrix nearness problem seeks the same but…

In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…

We consider the vector space of $n \times n$ matrices over $\mathbb C$, Fermi operators and operators constructed from these matrices and Fermi operators. The properties of these operators are studied with respect to the underlying…

The 4IM+1CM problem is determining all pairs (f,g) of meromorphic functions in the complex plane that are not Moebius transformations of each other and share five pairs of complex values, one of them counting multiplicities. It is shown…