Program Committee

• John Cannon (Sydney: Co-Chair) (Group theory) John has worked in several core areas of computational algebra for over twenty years but is best known for his contributions to computational group theory. His interests also include algebraic programming languages and mathematical databases. His team was responsible for developing the Cayley system for group theory and related areas which has been in use for 15 years. More recently, his group released the general algebra system, Magma.

• Jon Carlson (Athens-GA: Modules, cohomology) Jon is an expert in the application of cohomological methods to the study of group representations. Recently, he has made major progress towards the goal of developing Magma programs for computing rank varieties and the cohomology ring of a module.

• Jenny Key (Clemson: Finite geometry) Jenny works in the area of finite geometries and has done fundamental work with Ed Assmus on characterizing finite geometries in terms of certain linear codes derived from incidence matrices. She has used Cayley and Magma with great success to generate conjectures, many of which have subsequently been proven.

• Marty Isaacs (Madison: Group representations) Marty is an expert on group representations with particular emphasis on soluble groups. His book on character theory is the standard work on the subject. Marty has used computational methods to generate ideas and has developed an interest in algorithmic questions.

• Arjen Lenstra (Belcore: Number theory, finite fields) Arjen is a computational number theorist who has been heavily involved in new methods for integer factorization (elliptic curve, quadratic sieve, number field sieve) and the discrete logarithm problem. He pioneered the use of parallel algorithms in integer factorization. He also undertakes research in cryptanalysis.

• Stuart Margolis (Bar Ilan Univ.: Semigroups and automata) Stuart works in the area of semigroups and has a strong interest in algorithmic methods for semigroups and automata. He is spearheading a push to develop a general package for this field.

• Michael Pohst (TU, Berlin: Algebraic number theory) Michael has a broad research program concerned with the development of practical algorithms for computing the fundamental invariants for local and global arithmetic fields. His group has developed the widely used KANT package for number fields.

• Michael Slattery (Chair) (Group theory) Michael has used a variety of computational tools to gain insight into various questions about characters of finite groups. For the past ten years, he has also been involved in the design and implementation of algorithms for finite solvable groups. During this time he has worked on Cayley and Magma and given numerous talks throughout the world on computational group theory.

Return to conference homepage.