Related papers: Group-theoretic Methods for Bounding the Exponent …
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.
We present three families of minimal border rank tensors: they come from highest weight vectors, smoothable algebras, or monomial algebras. We analyse them using Strassen's laser method and obtain an upper bound $2.431$ on $\omega$. We also…
Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit…
It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fewer multiplications. However, there are several mutually…
The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an…
This note looks at the efficiency of the cross-wired mesh array in the context of matrix multiplication. It is shown that in case of repeated operations, the average number of steps to multiply sets of nxn matrices on a 2D cross-wired mesh…
Zwick's $(1+\varepsilon)$-approximation algorithm for the All Pairs Shortest Path (APSP) problem runs in time $\widetilde{O}(\frac{n^\omega}{\varepsilon} \log{W})$, where $\omega \le 2.373$ is the exponent of matrix multiplication and $W$…
This is an improved version of the talk of the author given at the Antalya Algebra Days VII on May 21, 2005. We present an introduction to the theory of the invariants under the action of GL(n,C) by simultaneous conjugation of d matrices of…
Most computer algebra systems incorrectly simplify (z - z)/(sqrt(w^2)/w^3 - 1/(w*sqrt(w^2))) to 0 rather than to 0/0. The reasons for this are: 1. The default simplification doesn't succeed in simplifying the denominator to 0. 2. There is a…
W.Specht (1940) proved that two $n\times n$ complex matrices $A$ and $B$ are unitarily similar if and only if $\operatorname{trace} w(A,A^{\ast}) = \operatorname{trace} w(B,B^{\ast})$ for every word $w(x,y)$ in two noncommuting variables.…
In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of…
Optimized multiple precision basic linear computation, especially matrix multiplication, is crucial for solving ill-conditioned problems. The recently proposed Ozaki scheme, which implements accurate matrix multiplication using existing…
Building on the work [18], where some standard basis for the queer $q$-Schur superalgebra $\mathcal{Q}_q(n,r;R)$ is defined by a labelling set of matrices and their associated double coset representatives, we investigate the matrix…
We suggest a two-matrix model depending on three (infinite) sets of parameters which interpolates between all the models proposed in arXiv:2206.13038, and defined there through $W$-representations. We also discuss further generalizations of…
The matrix scaling problem, particularly the Sinkhorn-Knopp algorithm, has been studied for over 60 years. In practice, the algorithm often yields high-quality approximations within just a few iterations. Theoretically, however, the…
The posit number system is arguably the most promising and discussed topic in Arithmetic nowadays. The recent breakthroughs claimed by the format proposed by John L. Gustafson have put posits in the spotlight. In this work, we first…
In this work the matrix exponential function is solved analytically for the special orthogonal groups $SO(n)$ up to $n=9$. The number of occurring $k$-th matrix powers gets limited to $0\leq k \leq n-1$ by exploiting the Cayley-Hamilton…