Date of Award
Computational Complexity, Matrix Multiplication, Group Theory, Linear Algebra, Abstract Algebra, Ring Theory, Wedderburn, Artin, Computational Group Theory, Theory, Theoretical Computer Science, Complexity Theory, Bremner, Ivanyos, Ronyai, Friedl, GAP, Sage, Semisimple Algebra, Semisimple Ring, Artinian Ring, Wedderburn Decomposition, Cohn and Umans, SUSP, Uniquely Solvable Puzzles, Matt Anderson, Jeff Hatley
Researchers Cohn and Umans proposed a framework for fast matrix multiplication algorithms. Their approach is reliant on an application of the Wedderburn-Artin Theorem: a landmark classification result in modern algebra. We show experimental success for algebras whose components all have dimension 1. We advance the Cohn and Umans framework by developing new, extendable tools to couple with their design.
Dubinsky, Zachary, "Fast Matrix Multiplication and the Wedderburn-Artin Theorem" (2023). Honors Theses. 2703.