More Like this

1. Malnormal matrices

   https://doi.org/10.1090/proc/15821  

   Mulcahy, Garrett; Sinclair, Thomas (July 2022, Proceedings of the American Mathematical Society)

   We exhibit an operator norm bounded, infinite sequence { A n } \{A_n\} of 3 n × 3 n 3n \times 3n complex matrices for which the commutator map X ↦ X A n − A n X X\mapsto XA_n - A_nX is uniformly bounded below as an operator over the space of trace-zero self-adjoint matrices equipped with Hilbert–Schmidt norm. The construction is based on families of quantum expanders. We give several potential applications of these matrices to the study of quantum expanders. We formulate several natural conjectures and provide numerical evidence. 

   more » « less
2. Fast multiplication of random dense matrices with sparse matrices

   Liang, Tianyu; Murray, Riley; Buluc, Aydin; Demmel, James (May 2024, IEEE International Parallel & Distributed Processing Symposium 2024)

   This work focuses on accelerating the multiplication of a dense random matrix with a (fixed) sparse matrix, which is frequently used in sketching algorithms. We develop a novel scheme that takes advantage of blocking and recomputation (on- the-fly random number generation) to accelerate this operation. The techniques we propose decrease memory movement, thereby increasing the algorithm’s parallel scalability in shared memory architectures. On the Intel Frontera architecture, our algorithm can achieve 2x speedups over libraries such as Eigen and Intel MKL on some examples. In addition, with 32 threads, we can obtain a parallel efficiency of up to approximately 45%. We also present a theoretical analysis for the memory movement lower bound of our algorithm, showing that under mild assumptions, it's possible to beat the data movement lower bound of general matrix-matrix multiply (GEMM) by a factor of sqrt(M), where $$M$$ is the cache size. Finally, we incorporate our sketching method into a randomized algorithm for overdetermined least squares with sparse data matrices. Our results are competitive with SuiteSparse for highly overdetermined problems; in some cases, we obtain a speedup of 10x over SuiteSparse. 

   more » « less
3. Counting dope matrices

   https://doi.org/10.1016/j.jalgebra.2023.01.006  

   Alon, Noga; Kravitz, Noah; O'Bryant, Kevin (April 2023, Journal of Algebra)
4. Numerical semigroups from rational matrices I: power-integral matrices and nilpotent representations

   https://doi.org/10.1080/00927872.2024.2402832  

   Chhabra, Arsh; Garcia, Stephan Ramon; Zhang, Fangqian; Zhang, Hechun (March 2025, Communications in Algebra)
5. Real and symmetric matrices

   https://doi.org/10.1215/00127094-2022-0076  

   Chen, Tsao-Hsien; Nadler, David (June 2023, Duke Mathematical Journal)