Related papers: Detecting free splittings in relatively hyperbolic…

We develop the geometry of folding paths in Outer space and, as an application, prove that the complex of free factors of a free group of finite rank is hyperbolic.

We study a class of two dimensional partially hyperbolic systems, not necessarily skew products, trying to establish the germ of a general theory. To illustrate the scope of the theory, we apply our results to the case of fast-slow…

We prove that if a countable group is elementarily equivalent to a non-abelian free group and all of its abelian subgroups are cyclic, then the group is a union of a chain of regular NTQ groups (i.e., hyperbolic towers).

In this note, we prove that a random extension of either the free group $F_N$ of rank $N\ge3$ or of the fundamental group of a closed, orientable surface $S_g$ of genus $g\ge2$ is a hyperbolic group. Here, a random extension is one…

We examine the existence of universal elements in classes of infinite abelian groups. The main method is using group invariants which are defined relative to club guessing sequences. We prove, for example: Theorem: For $n\ge 2$, there is a…

The study of geometric group theory has suggested several theorems related to subdivision tilings that have a natural hyperbolic structure. However, few examples exist. We construct subdivision tilings for the complement of every…

This article is a first step in the study of equations in periodic groups. As an application, we study the structure of periodic quotients of hyperbolic groups. We investigate for instance the Hopf and co-Hopf properties, the isomorphism…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…

This paper overviews recent developments in the classification up to quasi-isometry of finitely generated groups, and more specifically of relatively hyperbolic groups.

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…

An alternative method is described for determining the hyperbolic structure on a link complement, and some of its elementary consequences are examined. The method is particularly suited to alternating links.

Using the canonical JSJ splitting, we describe the outer automorphism group $\Out(G)$ of a one-ended word hyperbolic group $G$. In particular, we discuss to what extent $\Out(G)$ is virtually a direct product of mapping class groups and a…

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

We show that every virtually torsion-free subgroup of the outer automorphism group of a conjugacy separable relatively hyperbolic group is residually finite. As a direct consequence, we obtain that the outer automorphism group of a limit…

In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…

We introduce the new notion of quotient-saturation as a measure of the immensity of the quotient structure of a group. We present a sufficient condition for a finitely presented group to be quotient-saturated, and use it to deduce that…

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

In this paper, we develop a new method to classify abelian automorphism groups of hypersurfaces. We use this method to classify (Theorem 4.2) abelian groups that admit a liftable action on a smooth cubic fourfold. A parallel result (Theorem…