Related papers: Generic properties of Whitehead's Algorithm and is…

We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…

Let $\mathcal{G}$ be a smooth linear group scheme of finite type. For any positive integer $k$ and a finite field $\mathbb{F}$, let $W_k(\mathbb{F})$ be the ring of Witt vectors of length $k$ over $\mathbb{F}$. We show that the group…

Let $FH$ be a Frobenius group with kernel $F$ and complement $H$, acting coprimely on the finite solvable group $G$ by automorphisms. We prove that if $C_{G}(H)$ is of Fitting length $n$ then the index of the $n$-th Fitting subgroup…

In this paper we prove several results regarding decidability of the membership problem for certain submonoids in amalgamated free products and HNN extensions of groups. These general results are then applied to solve the prefix membership…

For every one-relator monoid $M = \langle A \mid u=v \rangle$ with $u, v \in A^*$ we construct a contractible $M$-CW complex and use it to build a projective resolution of the trivial module which is finitely generated in all dimensions.…

We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in…

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…

We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…

We give a solution to Dehn's isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to…

The group isomorphism problem asks whether two finite groups given by their Cayley tables are isomorphic or not. Although there are polynomial-time algorithms for some specific group classes, the best known algorithm for testing isomorphism…

We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

We show that every automorphism $\alpha$ of a free group $F_k$ of finite rank $k$ has {\it asymptotically periodic} dynamics on $F_k$ and its boundary $\partial F_k$: there exists a positive power $\alpha^q$ such that every element of the…

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Previously, the authors proved that the presentation complex of a one-relator group $G$ satisfies a geometric condition called negative immersions if every two-generator, one-relator subgroup of $G$ is free. Here, we prove that one-relator…

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

The standard $(n, k, d)$ model of random groups is a model where the relators are chosen randomly from the set of cyclically reduced words of length $k$ on an $n$-element generating set. Gromov's density model of random groups considers the…

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…