The existence of lattices with trivial automorphism group was shown by O'Meara, who gave an algorithm to construct such a lattice starting from any given lattice. In this process, the discriminants of the lattices increase in each step. Biermann proved the existence of a lattice…
The main result describes completely the maximal factorizations of all the finite simple groups and their automorphism groups. As a consequence, a classification of the maximal subgroups of the finite alternating and symmetric groups is obtained.
A version of Harrington's [capital Greek]Delta₃-automorphism technique for the lattice of recursively enumerable sets is introduced and developed by reproving Soare's Extension Theorem. Then this automorphism technique is used to show two technical theorems: the High Extension T…
We introduce the notion of a textile system. Using this, we study the dynamical properties of endomorphisms and automorphisms of topological Markov shifts including one-sided ones. The dynamical properties of automorphisms of sofic systems are also studied.
This monograph contains a proof of the Bestvina-Handel Theorem (for any automorphism of a free group of rank n, the fixed group has rank at most n) that to date has not been available in book form. The account is self-contained, simplified, purely algebraic, and extends the resu…
