Related papers: A computer-friendly construction of the monster
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm. We describe several families…
We detail the automatic construction of R matrices corresponding to (the tensor products of) the (0|\alpha) families of highest-weight representations of the quantum superalgebras U_q[gl(m|n)]. These representations are irreducible, contain…
There have been several constructions of family of varieties with exceptional monodromy group. In most cases, these constructions give Hodge structures with high weight(Hodge numbers spread out). N. Katz was the first to obtain Hodge…
Axial algebras are a class of commutative algebras generated by idempotents, with adjoint action semisimple and satisfying a prescribed fusion law. Axial algebras were introduced by Hall, Rehren, and Shpectorov in 2015 as a broad…
Schur multiplier $M(G)$ of a finite group $G$ has been studied heavily. To proceed further to the study of projective (or spin) representations of $G$ and their characters (called spin characters), it is necessary to construct explicitly a…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
In this article we prove that the full automorphism group of the baby-monster vertex operator superalgebra constructed by Hoehn is isomorphic to 2xB, where B is the baby-monster sporadic finite simple group and determine irreducible modules…
In this paper, we associate Galois representations to globally generic cuspidal automorphic representations on GSp(4), over a totally real field F, which are Steinberg at some finite place. This association is compatible with the local…
As an application of the representation theory for the dihedral groups, we study the symmetric central configurations in the n-body problem where $n$ equal masses are placed at the vertices of a regular $n$-gon. Since the Hessian matrices…
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices…
Slattery (2007) described computational methods to enumerate, construct, and identify finite groups of squarefree order. We generalise Slattery's result to the class of finite groups that have cyclic Sylow subgroups and provide an…
The goal of this article is to exhibit two new families of finitely generated simple groups of homeomorphisms of $\mathbf{R}$. These families are strikingly different from existing families owing to the nature of their actions on…
We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…
We develop methods to control the first-order theory of groups arising as certain direct limits of torsion-free hyperbolic groups, answering several questions in the literature. We construct simple torsion-free Tarski monsters $\Gamma$…
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…
This paper presents an algorithm for the integer multiplicative inverse (mod $2^w$) which completes in the fewest cycles known for modern microprocessors, when using the native bit width $w$ for the modulus $2^w$. The algorithm is a…
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…
The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…