Strassen's algorithm via orbit flip graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910863654387712 |
|---|---|
| author | Ikenmeyer, Christian Moosbauer, Jakob |
| author_facet | Ikenmeyer, Christian Moosbauer, Jakob |
| contents | We give a short proof for Strassen's result that the rank of the 2 by 2 matrix multiplication tensor is at most 7. The proof requires no calculations and also no pattern matching or other type of nontrivial verification, and is based solely on properties of a specific order 6 group action. Our proof is based on the recent combination of flip graph algorithms and symmetries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_05467 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Strassen's algorithm via orbit flip graphs Ikenmeyer, Christian Moosbauer, Jakob Data Structures and Algorithms We give a short proof for Strassen's result that the rank of the 2 by 2 matrix multiplication tensor is at most 7. The proof requires no calculations and also no pattern matching or other type of nontrivial verification, and is based solely on properties of a specific order 6 group action. Our proof is based on the recent combination of flip graph algorithms and symmetries. |
| title | Strassen's algorithm via orbit flip graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2503.05467 |