Involution centralisers have long been of theoretical importance.
Recently algorithms for linear groups have been developed
which exploit these. We will first discuss a method to
construct an involution centraliser, then report on their
applications to solve algorithmic questions.
After the seminar we will take the speaker to lunch at the Grandstand.
See the Algebra Seminar web page for information about other seminars in the series.
Anthony Henderson email@example.com