Related papers: On the Definition of Word Hyperbolic Groups

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…

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…

We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.

We study the countable set of rates of growth of a hyperbolic group with respect to all its finite generating sets. We prove that the set is well-ordered, and that every real number can be the rate of growth of at most finitely many…

These notes are a self-contained introduction to the use of dynamical and probabilistic methods in the study of hyperbolic groups. Most of this material is standard; however some of the proofs given are new, and some results are proved in…

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…

A basic point about hyperbolic groups is that they have "spaces at infinity" which are spaces of homogeneous type in the sense of Coifman and Weiss, and with a lot of self-similarity coming from the group. This short survey deals with some…

Let $w$ be a group-word. Suppose that the set of all $w$-values in a profinite group $G$ is contained in a union of countably many subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

We classify finitely generated, residually finite automorphism-induced HNN-extensions in terms of the residual separability of a single associated subgroup. This classification provides a method to construct automorphism-induced…

We give experimental support for a conjecture of Louder and Wilton saying that words of imprimitivity rank greater than two yield hyperbolic one-relator groups.

In this paper we give new requirements that a tree of $\delta$-hyperbolic spaces has to satisfy in order to be $\delta$-hyperbolic itself. As an application, we give a simple proof that limit groups are relatively hyperbolic.

In this paper we investigate Gromov's question: whether every one-ended word hyperbolic group contains a surface subgroup. The case of double groups is considered by studying the associated one relator groups. We show that the majority…

Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\{H_1, ..., H_m\} $. We prove that if each of the subgroups $H_1, ..., H_m$ has finite asymptotic dimension, then asymptotic dimension of $G$…

Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related…

We prove that an automorphism $\phi:F\to F$ of a finitely generated free group $F$ is hyperbolic in the sense of Gromov if it has no nontrivial periodic conjugacy classes.

We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata)…

By means of a dynamical process we provide a characterization of the Goldbach Conjecture in an infinite set of even numbers that depends on time.