# Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies

## TL;DR

This paper explores the geometric relationship between Strassen's and Laderman's matrix multiplication algorithms, revealing how Laderman's algorithm can be constructed using Strassen's method and tensor isotropies.

## Contribution

It establishes a geometric connection between Strassen and Laderman algorithms, providing a new perspective on their construction and related tensor symmetries.

## Key findings

- Laderman matrix multiplication algorithm can be derived from Strassen's algorithm.
- A geometric formulation of Laderman's algorithm is presented.
- The relationship between these algorithms and tensor isotropies is elucidated.

## Abstract

In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms. By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.