Talks

Computing in sporadic groups: an application of symmetric generation

Mainly focuses on the content of the paper "Symmetric representation of the elements of the Conway group .0" with RT Curtis, Journal of Symbolic Computation 44 (2009) 1044-1067

The techniques of symmetric genration make it possible to express the elements of a group succinctly as what is essentialy a word of elements from a symmetric generating set. This can often represent a substantial saving in terms of memory space compared to the more traditional methods of representing group elements either as permutations or matrices. In this short talk we describe how these techniques have been successfully applied in the cases of a few of the sporadic groups.

Symmetric Generation of Not-So-Finite (Real) Reflection Groups

Presented paper ``Symmetric Presentations of Coxeter groups" submitted to "Communications in Algebra" and paper "Symmetric Generation of  Coxeter Groups" accepted by Archiv Der Mathematik

This is joint work with RT Curtis and J M¨uller. The remarkable techniques of symmetric generation have furnished almost effortless constructions of a variety of interesting groups. In this talk we shall first discuss the existence of involutory symmetric generating sets for real reflection groups meeting certain finiteness conditions. This represents the first examples of infinite groups to succumbe to the techniques of symmetric generation.

Co_2 and the Higman-Sims graph

Unpublished work

The remarkable techniques of symmetric generation have furnished almost effortless constructions of a variety of interesting groups and in turn go a long way to ‘explaining’ existence of very exceptional objects such as sporadic groups. As an example, we present a recently discovered new presentation for the Conway group Co_2 that is readily described in terms of the Higman-Sims graph.

Symmetric Presentations of Coxeter Groups

Presented paper ``Symmetric Presentations of Coxeter groups" submitted to "Communications in Algebra"

The remarkable techniques of symmetric generation have furnished several almost effortless constructions of many exceptional objects by exhibiting highly symmetric generating sets for groups. In particular, these generating sets often provide symmetric presentations for these groups. In this short talk, we will show how the familiar Coxeter-Moser presentations for the Coxeter groups of types A_n, D_n, and even the exceptional cases E_6, E_7, and E_8, may be naturally derived as symmetric presentations in an almost uniform manner. In doing so, we will construct representations of these groups with some striking properties.

A Black Box Algorithm For Computing in the Conway Group Dotto

presented paper ``Symmetric Representation of the elements of the Conway Group Dotto"

In this talk we outline an algorithm that enables us to multiply
together elements of the Conway group dotto represented in a very succinct fashion thereby making this extremely succinct representation practical to use.

An Introduction to Symmetric Generation

We introuce the basic techniques of symmetric generation of finite groups

The remarkable techniques of symmetric generation provide an elementary means of producing almost effortless constructions of finite groups, most notably the sporadic simple groups. In this talk we shall introduce these techniques and as an example give a new construction of the sporadic simple Mathieu group M_{12}.

 

x

Log In

or reset password

Reset Password

Enter the email address you signed up with, and we'll send a reset password email to that address

Academia © 2012