Related papers: Finite matrix multiplication algorithms from infin…
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…
A diagram is introduced for visualizing matrix product states which makes transparent a connection between matrix product factorizations of states and operators, and complex weighted finite state automata. It is then shown how one can…
It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix…
We consider the three finite free convolutions for polynomials studied in a recent paper by Marcus, Spielman, and Srivastava. Each can be described either by direct explicit formulae or in terms of operations on randomly rotated matrices.…
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…
Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…
The article covers developments in the representation theory of finite group schemes over the last fifteen years. We start with the finite generation of cohomology of a finite group scheme and proceed to discuss various consequences and…
Group equivariant neural networks are growing in importance owing to their ability to generalise well in applications where the data has known underlying symmetries. Recent characterisations of a class of these networks that use high-order…
We show how tools from computational group theory can be used to prove that a subgroup of matrices has infinite index.
A Mathematica based program has been elaborated in order to determine the symmetry group of a finite difference equation, by means of its differential representation. The package provides functions which enable us to solve the determining…
We consider the techniques behind the current best algorithms for matrix multiplication. Our results are threefold. (1) We provide a unifying framework, showing that all known matrix multiplication running times since 1986 can be achieved…
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
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 study finite groups arising from configurations of pairwise skew lines in $\mathbb{P}^3_K$. To such a configuration ${L}$ one associates a group $G_{L}\subset \mathrm{PGL}_2(K)$ acting on each line, and we investigate which finite…
We give an affirmative answer to the question whether there exist Lie algebras for suitable closed subgroups of the unitary group $U(\mathcal{H})$ in a Hilbert space $\mathcal{H}$ with $U(\mathcal{H})$ equipped with the strong operator…
The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…
In this paper, we study matricial representations of certain finitely presented groups with N-generators of order-2. As an application, we consider a group algebra under our representations. Specifically, we characterize the inverses of all…
We study group extensions of Finite Abelian Groups using matrices. We also prove a Theorem for equivalence of extensions using matrices.
We study generalized Jacobi sums, cyclotomic numbers, and $d$-compositions in Thaine's framework, and prove new multiplicative identities extending Davenport and Hasse's lifting theorem from the classical prime-power setting to products of…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…