Charles Leedham-Green

Charles Leedham-Green

Charles Leedham-Green
Born Peebles, Scotland
Residence UK
Fields Mathematician
Alma mater University of Oxford
Doctoral advisor Kenneth Gravett
Known for Work on pro-p groups and computational group theory

Charles R. Leedham-Green is a retired professor of mathematics at Queen Mary, University of London, known for his work in group theory. He completed his DPhil at the University of Oxford.[1]

Along with Leonard Soicher, Leedham-Green designed the product replacement algorithm;[2] an algorithm within computational group theory that generates random elements of groups by taking a random walk through the group. This algorithm has been implemented in both GAP and MAGMA.

He is responsible for a great body of work in group theory. In recent times, this has involved research in computational group theory and pro-p groups.

The 300th edition of the Journal of Algebra was dedicated to him for his 65th birthday.[3] On the occasion of his retirement in 2006, the Mathematics Research Centre at Queen Mary held a conference in celebration of his mathematical achievements.[4]

Selected publications

References

  1. The Mathematics Genealogy Project
  2. The Product Replacement Algorithm is Polynomial
  3. Journal of Algebra, Volume 300, Issue 1: Computational Algebra Special Issue Celebrating the 65th birthday of Charles Leedham-Green.
  4. Groups and Computation 2006: A Leedham-Green Fest Archived September 28, 2011, at the Wayback Machine..
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.