Fetching the paper…
Reading the bibliography…
In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication.
Vicente Landazuri and Gary M. Seitz, On the minimal degrees of projective representations of the finite Chevalley groups , J. Algebra 32
1974
Earlier work this paper cites.
Joe Harris, Algebraic geometry: a first course , Graduate Texts in Mathematics, vol. 133, Springer-Verlag, New York, 1992. doi: 10.1007/978-1-4757-2189-8
1992
Earlier work this paper cites.
Henry Cohn and Christopher Umans, A group-theoretic approach to fast matrix multiplication , Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS 2003), IEEE Computer Society, 2003, pp. 438–449. doi: 10.1109/SFCS.2003.1238217
2003
Earlier work this paper cites.
Michèle Audin, Torus actions on symplectic manifolds , revised ed., Progress in Mathematics, vol. 93, Birkhäuser Verlag, Basel, 2004. doi: 10.1007/978-3-0348-7960-6
2004
Earlier work this paper cites.
Henry Cohn, Robert Kleinberg, Balázs Szegedy, and Christopher Umans, Group-theoretic algorithms for matrix multiplication , Proceedings of the 46th Annual Symposium on Foundations of Computer Science (FOCS 2005), IEEE Computer Society, 2005, pp. 379–388. doi: 10.1109/SFCS.2005.39
2005
Earlier work this paper cites.
W. T. Gowers, Quasirandom groups , Combin. Probab. Comput. 17
2008
Earlier work this paper cites.
Gunter Malle and Donna Testerman, Linear algebraic groups and finite groups of Lie type , Cambridge Studies in Advanced Mathematics, vol. 133, Cambridge University Press, Cambridge, 2011. doi: 10.1017/CBO9780511994777
2011
Cited alongside, same era.
Jason Fulman and Robert Guralnick, Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements , Trans. Amer. Math. Soc. 364
2012
Cited alongside, same era.
Michael Larsen, Gunter Malle, and Pham Huu Tiep, The largest irreducible representations of simple groups , Proc. Lond. Math. Soc. (3) 106
2013
Cited alongside, same era.
Emmanuel Breuillard, A brief introduction to approximate groups , Thin groups and superstrong approximation, Math. Sci. Res. Inst. Publ., vol. 61, Cambridge Univ. Press, Cambridge, 2014, pp. 23–50. http://library.msri.org/books/Book61/files/15breu.pdf
2014
Cited alongside, same era.
2017
Later among the works it cites.
Josh Alman and Virginia Vassilevska Williams, Limits on all known (and some unknown) approaches to matrix multiplication , Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018), IEEE, 2018, pp. 580–591. doi: 10.1109/FOCS.2018.00061
2018
Later among the works it cites.
Will Sawin, Bounds for matchings in nonabelian groups , Electron. J. Combin. 25
2018
Later among the works it cites.
Josh Alman, Limits on the universal method for matrix multiplication , Theory Comput. 17
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Andris Ambainis, Yuval Filmus, and François Le Gall, Fast matrix multiplication: limitations of the Coppersmith–Winograd method , Proceedings of the 2015 ACM Symposium on Theory of Computing (STOC 2015), ACM, 2015, pp. 585–593. doi: 10.1145/2746539.2746554
2015
Cited alongside, same era.
Jonah Blasiak, Thomas Church, Henry Cohn, Joshua A. Grochow, Eric Naslund, William F. Sawin, and Chris Umans, On cap sets and the group-theoretic approach to matrix multiplication , Discrete Anal. (2017), Paper No. 3, 1–27. doi: 10.19086/da.1245
2017
Cited alongside, same era.
2021
Later among the works it cites.
Matthias Christandl, Péter Vrana, and Jeroen Zuiddam, Barriers for fast matrix multiplication from irreversibility , Theory. Comput. 17
2021
Later among the works it cites.