Related papers: Finite matrix multiplication algorithms from infin…

Brauer Theory for a finite group can be viewed as a method for comparing the representations of the group in characteristic 0 with those in prime characteristic. Here we generalize much of the machinery of Brauer theory to the setting of…

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…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

We describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using,…

We investigate Fourier multipliers on the compact dual of arbitrary discrete groups. Our main result is a H\"ormander-Mihlin multiplier theorem for finite-dimensional cocycles with optimal smoothness condition. We also find Littlewood-Paley…

It is proved that there is no an algorithm for multiplication of $3\times3$ matrices of multiplicative length $\leq23$ that is invariant under a certain group isomorphic to $S_4\times S_3$. The proof makes use of description of the orbits…

We show that any infinite collection $(\Gamma_n)_{n\in \mathbb N}$ of icc, hyperbolic, property (T) groups satisfies the following von Neumann algebraic \emph{infinite product rigidity} phenomenon. If $\Lambda$ is an arbitrary group such…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

The "coquecigrue" problem for Leibniz algebras is that of finding an appropriate generalization of Lie's third theorem, that is, of finding a generalization of the notion of group such that Leibniz algebras are the corresponding tangent…

Beginning with a skew-symmetric matrix, we define a certain Poisson--Lie group. Its Poisson bracket can be viewed as a cocycle perturbation of the linear (or "Lie-Poisson") Poisson bracket. By analyzing this Poisson structure, we gather…

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…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

We analyze effective approximation of unitary matrices. In our formulation, a unitary matrix is represented as a product of rotations in two-dimensional subspaces, so-called Givens rotations. Instead of the quadratic dimension dependence…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…

In this article, we give the most genaral form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized quaternions (3PGQs) and study on various properties and applications. Firstly we present the definiton,…