Related papers: On the Andreadakis problem for subgroups of $IA\_n…

This work is a continuation of Automorphisms of $K$-groups I, P. Flavell, preprint. The main object of study is a finite $K$-group $G$ that admits an elementary abelian group $A$ acting coprimely. For certain group theoretic properties…

We prove that the so-called uniadic graph and its adic automorphism are Borel universal, i.e., every aperiodic Borel automorphism is isomorphic to the restriction of this automorphism to a subset invariant under the adic transformation, the…

Suppose that a Lie algebra $L$ admits a finite Frobenius group of automorphisms $FH$ with cyclic kernel $F$ and complement $H$ of order 2, such that the fixed-point subalgebra of $F$ is trivial and the fixed-point subalgebra of $H$ is…

We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

We classify the Artin groups that admit retractions onto all of their parabolic subgroups. Our approach relies on a detailed analysis of triangular subgroups, with a key ingredient being the classification of homomorphisms between dihedral…

We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Let $A$ be an infinitely generated free abelian group. We prove that the automorphism group $\aut A$ first-order interprets the full second-order theory of the set $|A|$ with no structure. In particular, this implies that the automorphism…

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

We prove sharp estimates in a shrinking target problem for the action of an arbitrary subgroup $\Gamma$ of $SL_2(\mathbb{Z})$ on the 2-torus. This can also be viewed as a non-commutative Diophantine approximation problem. The methods…

We determine which simple algebraic groups of type $^3D_4$ over arbitrary fields of characteristic different from 2 admit outer automorphisms of order 3, and classify these automorphisms up to conjugation. The criterion is formulated in…

We show that many normal subgroups of the braid group modulo its centre, and of the mapping class group of a sphere with marked points, have the property that their automorphism and abstract commensurator groups are mapping class groups of…

Let $\Gamma$ be a crystallographic group of dimension $n,$ i.e. a discrete, cocompact subgroup of $\operatorname{Isom}(\mathbb{R}^n)$ = $O(n)\ltimes\mathbb{R}^n.$ For any $n\geq 2,$ we construct a crystallographic group with a trivial…

We classify abelian subgroups of Out(F_n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element \phi into a composition of…

We describe all the fine group gradings, up to equivalence, on the Lie algebra $\mathfrak d_4$. This problem is equivalent to finding the maximal abelian diagonalizable subgroups of the automorphism group of $\mathfrak d_4$. We prove that…

We describe under a variety of conditions abelian subgroups of the automorphism group A of the regular n-ary tree T which are normalized by the n-ary adding machine t=(e,...,e,t)s where s is the n-cycle (0,1,...,n-1). As an application, for…

Let $\phi$ be an automorphism of a free group $F_n$ of rank $n$, and let $M_{\phi}=F_n \rtimes_{\phi} \mathbb{Z}$ be the corresponding mapping torus of $\phi$. We study the group $Out(M_{\phi})$ under certain technical conditions on $\phi$.…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…