Related papers: A Note on the Group-theoretic Approach to Fast Mat…
By an {\em isotropy group} of a tensor $t\in V_1 \otimes V_2\otimes V_3=\widetilde V$ we mean the group of all invertible linear transformations of $\widetilde V$ that leave $t$ invariant and are compatible (in an obvious sense) with the…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
In order to study how well a finite group might be generated by repeated random multiplications, P. Diaconis suggested the following urn model. An urn contains some balls labeled by elements which generate a group G. Two are drawn at random…
In this work, we prove that any symplectic matrix can be factored into no more than 9 unit triangular symplectic matrices. This structure-preserving factorization of the symplectic matrices immediately reveals two well-known features that,…
We present a framework for accelerating a spectrum of machine learning algorithms that require computation of bilinear inverse forms $u^\top A^{-1}u$, where $A$ is a positive definite matrix and $u$ a given vector. Our framework is built on…
We implement an Augmented Lagrangian method to minimize a constrained least-squares cost function designed to find polyadic decompositions of the matrix multiplication tensor. We use this method to obtain new discrete decompositions and…
In this paper, we develop a method for unsupervised clustering of two-way (matrix) data by combining two recent innovations from different fields: the Sparse Subspace Clustering (SSC) algorithm [10], which groups points coming from a union…
The first paper in this series introduced a new approach to strong convergence of random matrices that is based primarily on soft arguments. This method was applied to achieve a refined qualitative and quantitative understanding of strong…
We construct a finite subgroup of Brauer-Manin obstruction for detecting the existence of integral points on integral models of homogeneous spaces of linear algebraic groups of multiplicative type. As application, the strong approximation…
We give upper bounds on limit multiplicities of certain non-tempered representations of unitary groups $U(a,b)$. These include some cohomological representations, and we give applications to the growth of cohomology of cocompact arithmetic…
Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem was that of Brent and Kung (1978). Recently, we improved…
Due to the noncommutative nature of quaternions and octonions we introduce barred operators. This objects give the opportunity to manipulate appropriately the hypercomplex fields. The standard problems arising in the definitions of…
Associated to any compact quantum group $G\subset U_N^+$ is a canonical family of group dual subgroups $\widehat{\Gamma}_Q\subset G$, parametrized by unitaries $Q\in U_N$, playing the role of "maximal tori" for $G$. We present here a series…
Compact matrix quantum groups are strongly determined by their intertwiner spaces, due to a result by S.L. Woronowicz. In the case of easy quantum groups, the intertwiner spaces are given by the combinatorics of partitions, see the inital…
We revisit the fundamental Boolean Matrix Multiplication (BMM) problem. With the invention of algebraic fast matrix multiplication over 50 years ago, it also became known that BMM can be solved in truly subcubic $O(n^\omega)$ time, where…
We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…
In this paper we consider the algebra of upper triangular matrices UT$_n(F)$, endowed with a $\mathbb{Z}_2$-grading (superalgebra) and equipped with a superinvolution. These structures naturally arise in the context of Lie and Jordan…
Matrix multiplication is the foundation from much of the success from high performance technologies like deep learning, scientific simulations, and video graphics. High level programming languages like Python and R rely on highly optimized…
A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker lower bounds by reasoning about the number of segments needed…
We present a new method to bound the cardinality of triple product sets in groups and give three applications. A new and unexpectedly short proof of the Plunnecke-Ruzsa sumset inequalities for Abelian groups. A new proof of a theorem of Tao…