Related papers: A Note on the Group-theoretic Approach to Fast Mat…
Min-plus product of two $n\times n$ matrices is a fundamental problem in algorithm research. It is known to be equivalent to APSP, and in general it has no truly subcubic algorithms. In this paper, we focus on the min-plus product on a…
Fast matrix multiplication can be described as searching for low-rank decompositions of the matrix--multiplication tensor. We design a neural architecture, \textsc{StrassenNet}, which reproduces the Strassen algorithm for $2\times 2$…
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
The group theoretical quantization scheme is reconsidered by means of elementary systems. Already the quantization of a particle on a circle shows that the standard procedure has to be supplemented by an additional condition on the…
In a paper published in 1981, Sch\"onhage showed that large total matrix multiplications can be reduced to powers of partial matrix multiplication tensors, which correspond to the bilinear computation task of multiplying matrices with some…
It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one…
In a previous article, an `invariant method' to calculate monomial integrals over the U(n) group was introduced. In this paper, we study the more traditional group-theoretical method, and compare its strengths and weaknesses with those of…
We present a new algorithm for fast matrix multiplication using tensor decompositions which have special features. Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for…
We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$
These notes were prepared for the MSRI hot topics workshop on superstrong approximation (2012). We give a brief overview of the developments in the theory, especially the fundamental expansion theorem. Applications to diophantine problems…
Topos theory has been suggested first by Isham and Butterfield, and then by Isham and Doering, as an alternative mathematical structure within which to formulate physical theories. In particular, it has been used to reformulate standard…
We prove a geometric criterion for the bounded multiplicity property of "small" infinite-dimensional representations of real reductive Lie groupsin both induction and restrictions. Applying the criterion to symmetric pairs, we give a full…
Integrals for the product of unitary-matrix elements over the U(n) group will be discussed. A group-theoretical formula is available to convert them into a multiple sum, but unfortunately the sums are often tedious to compute. In this…
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…
It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one…
The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…
Aasen's algorithm factorizes a symmetric indefinite matrix $A$ as $A = P^TLTL^TP$, where $P$ is a permutation matrix, $L$ is unit lower triangular with its first column being the first column of the identity matrix, and $T$ is tridiagonal.…
In this paper, we introduce a new technique in the study of the $*$-regular closure of some specific group algebras $KG$ inside $\mathcal{U}(G)$, the $*$-algebra of unbounded operators affiliated to the group von Neumann algebra…
We define a class of groups equipped with an invariant probability measure, which includes all compact groups and is closed under taking ultraproducts with the induced Loeb measure; in fact, this class also contains the ultraproducts all…