University of Sydney
School of Mathematics and Statistics
Computational Algebra Seminar
Talks in 2002
January
Thursday 9th
Axel Kohnert
An algorithm for the computation of the plethysm of two symmetric functions
Thursday 17th
John Cannon
Finite or Infinite?
An Exposure of a Publication Scandal in Group Theory
Thursday 24th
David Kohel
Applications of class invariants on modular curves
Thursday 31st
Dimitri Leemans
Computational methods in Incidence Geometry
February
Thursday 7th
Claus Fieker
Constructive Algebraic Number Theory I
Thursday 14th
Colva Roney-Dougal
The primitive permutation groups of degree less than 1001
Thursday 21st
Helena Verrill
Lattices of modular symbols
March
Thursday 7th
Bettina Eick
Orbit-stabilizer algorithms for polycyclic groups
Thursday 21st
Agnes Szanto
Solving over-determined systems by the subresultant method
Thursday 28th
Markus Grassl
Quantum Computation - Mathematical Framework and Basic Problems
April
Thursday 4th
Markus Grassl
Quantum Error-Correcting Codes
May
Thursday 30th
Gavin Brown
A Database of K3 Surfaces
September
Thursday 26th
Robert Wilson
Condensation Techniques - Part 1.
October
Thursday 3rd
Camilla Gaardsted
Prime Factorisation.
Thursday 10th
Robert Wilson
Condensation Techniques - Part 2.
Thursday 17th
Robert Wilson
Construction of Groups.
Thursday 24th
Derek Holt
Computing First Cohomology Groups.
Thursday 31st
Nils Bruin
Local Solubility of Projective Varieties.
November
Thursday 7th
Paul van Wamelen
Jacobians of Genus 2 Curves.
Thursday 14th
Derek Holt
The Computation of Cohomology Groups - Part 2.
Thursday 21st
Jon Carlson
Comparing Group Algebras.
Thursday 28th
Damien Fisher
Computing with the p-adics.
December
Thursday 12th
Pierrick Gaudry
Mestre's Algorithm for Counting Points of Curves in Genus 2.
The original source of this page is by Andrew Mathas. Modifications by Gavin Brown, David Kohel and Volker Gebhardt.
Please mail questions or comments to
Volker Gebhardt