Plethysm and fast matrix multiplication

DOI10.1016/j.crma.2017.11.012zbMath1416.17005arXiv1710.00528OpenAlexW2761176940MaRDI QIDQ1704645

Tim Seynnaeve

Publication date: 12 March 2018

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.00528

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Basic linear algebra (15A99) Numerical linear algebra (65F99)

Related Items

Bounds on complexity of matrix multiplication away from Coppersmith-Winograd tensors ⋮ Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Plethysm and lattice point counting
• Matrix multiplication via arithmetic progressions
• \((\mathrm{GL}_n,\mathrm{GL}_m)\)-duality and symmetric plethysm
• Secants of minuscule and cominuscule minimal orbits
• Abelian tensors
• Gaussian elimination is not optimal
• New lower bounds for the border rank of matrix multiplication
• Powers of tensors and fast matrix multiplication
• On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry
• Geometry and Complexity Theory
• Multiplying matrices faster than coppersmith-winograd
• On the Plethysm of S-Functions
• On Symmetrized Kronecker Powers and the Structure of the Free Lie Ring