Related papers: A computer-friendly construction of the monster

The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a simple combinatorial condition (the Triple Product Property).…

Let $p\geq 5$ be a prime. We construct modular Galois representations for which the $\mathbb{Z}_p$-corank of the $p$-primary Selmer group (i.e., $\lambda$-invariant) over the cyclotomic $\mathbb{Z}_p$-extension is large. More precisely, for…

Finite simple groups are the building blocks of finite symmetry. The effort to classify them precipitated the discovery of new examples, including the monster, and six pariah groups which do not belong to any of the natural families, and…

We contribute towards the classification programme for Conway groupoids associated to a $2-(n,4,\lambda)$ design. Our main results improve the known bounds for a hole stabilizer to be primitive, or to contain the alternating group, ${\rm…

We construct finitely generated simple torsion-free groups with strong homological control. Our main result is that every subset of $\mathbb{N} \cup \{\infty\}$, with some obvious exceptions, can be realized as the set of dimensions of…

In this article we construct an irreducible simple subgroup G = <q, y, t, w> of GL_{8671}(13) from an irreducible subgroup T of GL_{11}(2) isomorphic to Mathieu's simple group M_{24} by means of Algorithm 2.5 of [13]. We also use the first…

As part of the programme to re-compute the character tables of all the groups in the Atlas we re-compute the character table of $\mathbb M$, the Monster simple group. We operate under the uniqueness hypotheses of $\mathbb M$ and the…

Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors $v_1,\ldots,v_m \in \mathbb{R}^d$ and a constraint family ${\cal B}\subseteq 2^{[m]}$, find a set $S \in \cal{B}$ that…

Let $r$ be an odd prime and $\mathbb{F}$ a field containing a primitive $r$th root of unity. Then for all $\ell \geq 1$, there is a faithful representation $f: \operatorname{Sp}_{2\ell}(r) \rightarrow \operatorname{GL}_{r^\ell}(\mathbb{F})$…

Every finite simple group can be generated by two elements, and Guralnick and Kantor proved that, moreover, every nontrivial element is contained in a generating pair. Groups with this property are said to be $\frac{3}{2}$-generated.…

Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications in coding theory, cryptography, wireless network communication and so on. Product designs were introduced by Robinson in order to construct…

We describe a new algorithm that computes the minimal list of inequalities for the moment cone of any representation of a complex reductive group, with implementation details for two fundamental cases: the Kronecker cone (governing the…

We prove the following two results relating real mutually unbiased bases and representations of finite groups of odd order. Let $q$ be a power of 2 and $r$ a positive integer. Then we can find a $q^{2r}\times q^{2r}$ real orthogonal matrix…

A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

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.

Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…

We introduce a presentation of the Chow ring of a matroid by a new set of generators, called "simplicial generators." These generators are analogous to nef divisors on projective toric varieties, and admit a combinatorial interpretation via…

The conjugacy classes of the Monster which occur in the McKay observation correspond to the isomorphism types of certain 2-generated subalgebras of the Griess algebra. Sakuma, Ivanov and others showed that these subalgebras match the…

We construct a finitely generated group which is an extension of two finitely generated groups coarsely embeddable into Hilbert space but which itself does not coarsely embed into Hilbert space. Our construction also provides a new infinite…