Related papers: A fast implementation of the Monster group
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
Majorana theory is an axiomatic tool introduced by A. A. Ivanov in 2009 for studying the Monster group M and its subgroups through the 196884-dimensional Conway-Griess-Norton algebra. The group U3(5) is the socle of the centralizer in M of…
A systematic study of maximal subgroups of the sporadic simple groups began in the 1960s. The work is now almost complete, only a few cases in the Monster remaining outstanding. We give a survey of results obtained, and methods used, over…
In 1933 B.~H.~Neumann constructed uncountably many subgroups of ${\rm SL}_2(\mathbb Z)$ which act regularly on the primitive elements of $\mathbb Z^2$. As pointed out by Magnus, their images in the modular group ${\rm PSL}_2(\mathbb Z)\cong…
It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…
Axial algebras of Monster type are a class of non-associative algebras which generalise the Griess algebra, whose automorphism group is the largest sporadic simple group, the Monster. The $2$-generated algebras, which are the building…
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…
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…
In this article we give self-contained existence proofs for the sporadic simple groups Co_2 and Fi_{22} using the second author's algorithm [10] constructing finite simple groups from irreducible subgroups of GL_n(2). These two sporadic…
We propose a simple algorithm for generating normally distributed pseudo random numbers. The algorithm simulates N molecules that exchange energy among themselves following a simple stochastic rule. We prove that the system is ergodic, and…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…
We present a modular function-based approach to explaining, for primes larger than 3, the exponents that appear in the prime decomposition of the order of the monster finite simple group.
It is known that the multiplication of an $N \times M$ matrix with an $M \times P$ matrix can be performed using fewer multiplications than what the naive $NMP$ approach suggests. The most famous instance of this is Strassen's algorithm for…
Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…