Related papers: A computing strategy and programs to resolve the G…
The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…
We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case.…
Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesian tree matching for the case of multiple patterns. We…
Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…
We construct $R$-matrices (with a multidimensional spectral parameter) that include additive as well as non-additive parameters. They satisfy the colored Yang-Baxter equation. The solutions depend on a set of commuting operators. They…
One of the most famous conjectures in computer algebra is that matrix multiplication might be feasible in not much more than quadratic time. The best known exponent is 2.376, due to Coppersmith and Winograd. Many attempts to solve this…
A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…
In the present paper, we propose a block variant of the extended Hessenberg process for computing approximations of matrix functions and other problems producing large-scale matrices. Applications to the computation of a matrix function…
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra…
Let $SGL_n(\mathbb{F}_2)$ be the set of all invertible $n\times n$ symmetric matrices over the binary field $\mathbb{F}_2$. Let $\Gamma_n$ be the graph with the vertex set $SGL_n(\mathbb{F}_2)$ where a pair of matrices $\{A,B\}$ form an…
Quantum computers promise to outperform their classical counterparts at certain tasks. However, existing quantum devices are error-prone and restricted in size. Thus, effective compilation methods are crucial to exploit limited quantum…
In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However,…
Call two pairs $(M,N)$ and $(M',N')$ of $m\times n$ matrices over a field $K$, \emph{simultaneously K-equivalent} if there exist square invertible matrices $S,T$ over K, with $M'=SMT$ and $N'=SNT$. Kronecker \cite{Kronecker} has given a…
Given six points $A,B,C,D,E,F$ on a nonsingular conic in the complex projective plane, Pascal's theorem says that the three intersection points $AE \cap BF, BD \cap CE, AD \cap CF$ are collinear. The line containing them is called a pascal,…
Denote by $M_n(K)$ the algebra of $n$ by $n$ matrices with entries in the field $K$. A theorem of Albert and Muckenhoupt states that every trace zero matrix of $M_n(K)$ can be expressed as $AB-BA$ for some pair $(A,B)$ of matrices of…
We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…
We consider the general problem of learning about a matrix through vector-matrix-vector queries. These queries provide the value of $\boldsymbol{u}^{\mathrm{T}}\boldsymbol{M}\boldsymbol{v}$ over a fixed field $\mathbb{F}$ for a specified…
Let $A$, $B$, and $C$ be three $n\times n$ matrices. We investigate the problem of verifying whether $AB=C$ over the ring of integers and finding the correct product $AB$. Given that $C$ is different from $AB$ by at most $k$ entries, we…
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix $\mathbf{H}$ and its inverse $\mathbf{H}^{-1}$ as $\mathbf{B}\mathbf{B}^*$ under fixed-point arithmetic. If solved, these would…
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…