Conference Themes

The meeting is intended to examine the prospects opened up by recent advances in the areas of algorithms and software for abstract algebra, number theory, geometry and combinatorics. Specifically, the conference will examine:

Recent work on key algorithms such as polynomial factorization.
The prospects for theoretical investigations opened up by recent developments in practical algorithms and systems.
The identification of areas where further development of computational facilities could lead to significant theoretical advances or practical applications.
The application of the techniques of computational algebra to novel problems.
An overview of recent algorithm and language development in specialized systems for algebra (e.g. Cayley, KANT, Magma, Macauley, PARI).
Approaches to making advanced CA algorithms and packages more useable by the mathematical community.
Case studies of problems investigated using specialized systems for algebra (e.g. Cayley, KANT, Magma, Macauley, PARI).

The areas of specific interest include, but are not restricted to:

Computational techniques for associative and non-associative algebras, algebraic geometry, cohomology, finite fields, finite geometry, group theory, knot theory, module theory, number theory, representation theory, ring theory, semigroups and (algebraic) topology.
Applications of these techniques to research in algebra, coding theory, combinatorics, cryptography, design theory, discrete signal processing, and hardware design.

Return to preconference homepage.

Return to conference homepage.