Related papers: New ways to multiply 3 x 3-matrices
The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any triangulation of the 3-manifold. We compute the triangulation complexity of all elliptic 3-manifolds and all sol 3-manifolds, to within a…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
The triplication method for constructing strong starters in $Z_{3m}$ from starters in $Z_{m}$ (say, a starter of order 21 from a starter of order 7) was proposed by the authors in 2025. The method reduced construction of the particular…
We present new algorithms to detect and correct errors in the product of two matrices, or the inverse of a matrix, over an arbitrary field. Our algorithms do not require any additional information or encoding other than the original inputs…
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…
We give explicit low-rank bilinear non-commutative schemes for multiplying structured $n \times n$ matrices with $2 \leq n \leq 5$, which serve as building blocks for recursive algorithms with improved multiplicative factors in asymptotic…
We consider three algorithms for allocating parliamentary seats by proportional representation. The usual approach to describing such algorithms is to compute a quota of votes that each party uses to "acquire'' representatives. This kind of…
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…
We find explicitly the multiplicities in the (mixed) trace cocharacter sequence of two $3\times 3$ matrices over a field of characteristic 0 and show that asymptotically they behave as polynomials of seventh degree. As a consequence we…
We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
Many important applications across science, data analytics, and AI workloads depend on distributed matrix multiplication. Prior work has developed a large array of algorithms suitable for different problem sizes and partitionings including…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
After Strassen presented the first sub-cubic matrix multiplication algorithm, many Strassen-like algorithms are presented. Most of them with low asymptotic cost have large hidden leading coefficient which are thus impractical. To reduce the…
In this paper we introduce a generic model for multiplicative algorithms which is suitable for the MapReduce parallel programming paradigm. We implement three typical machine learning algorithms to demonstrate how similarity comparison,…
Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…
This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…
Fast algorithms for matrix multiplication, namely those that perform asymptotically fewer scalar operations than the classical algorithm, have been considered primarily of theoretical interest. Apart from Strassen's original algorithm, few…
Decimal multiplication is the task of multiplying two numbers in base $10^N.$ Specifically, we focus on the number-theoretic transform (NTT) family of algorithms. Using only portable techniques, we achieve a 3x-5x speedup over the mpdecimal…
Given $n$ lines in general position in the plane, how many bounded triangular faces can the arrangement have? We construct a straight-line affine arrangement of $19$ lines satisfying the conditions of the iterative construction by…