Related papers: A group-theoretic approach to fast matrix multipli…

We propose a strategy for the generation of fast and accurate versions of non-commutative recursive matrix multiplication algorithms. To generate these algorithms, we consider matrix and tensor norm bounds governing the stability and…

In this article we prove a necessary and a sufficient condition for a finite subset of the special linear group to be dominated. These conditions are purely geometric in nature, as they only involve the trace and the eigenvectors of the…

We show that if $G$ is any $p$-group of class at most two and exponent $p$, then there exist groups $G_1$ and $G_2$ of class two and exponent $p$ that contain $G$, neither of which can be expressed as a central product, and with $G_1$…

By definition, admissible matrix groups are those that give rise to a wavelet-type inversion formula. This paper investigates necessary and sufficient admissibility conditions for abelian matrix groups. We start out by deriving a block…

The purpose of this paper is construct an embedding of the C*-algebra of the Cartan motion group of a real reductive group G into the reduced C*-algebra of G itself. The embedding has a number of applications: we shall use it to…

We continue our exploration of various approaches to integration of representations from a Lie algebra $\mbox{Lie} (G)$ to an algebraic group $G$ in positive characteristic. In the present paper we concentrate on an approach exploiting…

Landau-Ginzburg mirror symmetry studies isomorphisms between graded Frobenius algebras, known as A- and B-models. Fundamental to constructing these models is the computation of the finite, Abelian $\textit{maximal symmetry group}$…

Motivated by the symmetric version of matrix multiplication we study the plethysm $S^k(\mathfrak{sl}_n)$ of the adjoint representation $\mathfrak{sl}_n$ of the Lie group $SL_n$. In particular, we describe the decomposition of this…

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…

Two-phase methods are commonly used to solve bi-objective combinatorial optimization problems. In the first phase, all extreme supported nondominated points are generated through a dichotomic search. This phase also allows the…

This paper deals with sufficiency conditions for irreducibility of certain induced modules. We also construct irreducible representations for a group $G$ over a field ${\mathbb K}$ where the group $G$ is a semidirect product of a normal…

Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

We present a new improvement on the laser method for designing fast matrix multiplication algorithms. The new method further develops the recent advances by [Duan, Wu, Zhou FOCS 2023] and [Vassilevska Williams, Xu, Xu, Zhou SODA 2024].…

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…

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…

Let $G$ be a finite nilpotent group and $n\in \{3,4, 5\}$. Consider $S_n\times G$ as a subgroup of $S_n\times S_{|G|}\subset S_{n|G|}$, where $G$ embeds into the second factor of $S_n\times S_{|G|}$ via the regular representation. Over any…

Let $G$ be an infinite abelian group with $|2G|=|G|$. We show that if $G$ is not the direct sum of a group of exponent 3 and the group of order 2, then $G$ possesses a perfect additive basis; that is, there is a subset $S\subseteq G$ such…

We propose a method that allows us to develop tableaux modulo theories using the principles of superdeduction, among which the theory is used to enrich the deduction system with new deduction rules. This method is presented in the framework…