Mathematics Dept., University of Hull

In this talk we will survey a novel domain of computational group theory: computing with linear groups over infinite fields.  We will provide an introduction to the area, and will discuss available methods and algorithms. Special consideration is given to algorithms for Zariski dense subgroups. This includes a computer realization of the strong approximation theorem, and algorithms for arithmetic groups. We illustrate applications of our methods to the solution of problems further afield by computer experimentation.