Related papers: A computing strategy and programs to resolve the G…
This work relates to three problems, the classification of maximal Abelian subalgebras (MASAs) of the Lie algebra of square matrices, the classification of 2-step solvable Frobenius Lie algebras and the Gerstenhaber's Theorem. Let M and N…
Gerstenhaber showed in 1961 that any commuting pair of n x n matrices over a field k generates a k-algebra A of k-dimension \leq n. A well-known example shows that the corresponding statement for 4 matrices is false. The question for 3…
Gerstenhaber proved in 1961 that the unital algebra generated by a pair of commuting $d\times d$ matrices over a field has dimension at most $d$. It is an open problem whether the analogous statement is true for triples of matrices which…
Gerstenhaber's theorem states that the dimension of the unital algebra generated by two commuting $n\times n$ matrices is at most $n$. We study the analog of this question for positive matrices with a positive commutator. We show that the…
Motzkin and Taussky (and independently, Gerstenhaber) proved that the unital algebra generated by a pair of commuting $d\times d$ matrices over a field has dimension at most $d$. Since then, it has remained an open problem to determine…
Suppose that $A$ is a nonnegative $n\times m$ real matrix. The NMF problem is the determination of two nonnegative real matrices $F$, $V$ so that $A=FV$ with intermediate dimension $p$ smaller than $min\{ n,m\}$. In this article we present…
In this paper, we consider the symmetric multi-type non-negative matrix tri-factorization problem (SNMTF), which attempts to factorize several symmetric non-negative matrices simultaneously. This can be considered as a generalization of the…
Given the matrix equation ${\bf A X} + {\bf X B} + f({\bf X }) {\bf C} ={\bf D}$ in the unknown $n\times m$ matrix ${\bf X }$, we analyze existence and uniqueness conditions, together with computational solution strategies for $f \,:…
In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of…
Let $K$ be a perfect field, $L$ be an extension field of $K$ and $A,B\in\mathcal{M}_n(K)$. If $A$ has $n$ distinct eigenvalues in $L$ that are explicitly known, then we can check if $A,B$ are simultaneously triangularizable over $L$. Now we…
In this study, we propose a simple method for fault-tolerant Strassen-like matrix multiplications. The proposed method is based on using two distinct Strassen-like algorithms instead of replicating a given one. We have realized that using…
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity needs to be small. Many sub-cubic algorithms have large leading…
This paper investigates the distributed computation of the well-known linear matrix equation in the form of $AXB = F$, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective.…
Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…
Given a ring $R$ with center $Z(R)$, we say a linear map $f:R\rightarrow R$ is commuting if $[f(x),x]=0$ for all $x\in R$. Such a map has a standard form if there exists $\lambda\in R$ and additive $\mu:R\rightarrow Z(R)$ such that…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
Obeying constraints imposed by classical physics, we give optimal fine-grained algorithms for matrix multiplication and problems involving graphs and mazes, where all calculations are done in 3-dimensional space. We assume that whatever the…
We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…
It is known that the multiplication of an $N \times M$ matrix with an $M \times P$ matrix can be performed using fewer multiplications than what the naive $NMP$ approach suggests. The most famous instance of this is Strassen's algorithm for…
Matrix multiplication (GEMM) is a core operation to numerous scientific applications. Traditional implementations of Strassen-like fast matrix multiplication (FMM) algorithms often do not perform well except for very large matrix sizes, due…