Related papers: Generalized Small Cancellation Presentations for A…

S. Gersten and H. Short have proved that if a group has a presentation which satisfies the algebraic C(4) and T(4) small-cancellation condition then the group is automatic. Their proof contains a gap which we aim to close. To do that we…

Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no…

We extend fundamental results of small cancellation theory to groups whose presentations satisfy the generalizations of the classical C(6) and C(7) conditions in graphical small cancellation theory. Using these graphical small cancellation…

We present four generalized small cancellation conditions for finite presentations and solve the word- and conjugacy problem in each case. Our conditions $W$ and $W^*$ contain the non-metric small cancellation cases C(6), C(4)T(4), C(3)T(6)…

We prove that torsion subgroups of groups defined by C(6), C(4)-T(4) or C(3)-T(6) small cancellation presentations are finite cyclic groups. This follows from a more general result on the existence of fixed points for locally elliptic…

We present a metric condition ${\LARGE{\tau}}'$ which describes the geometry of classical small cancellation groups and applies also to other known classes of groups such as two-dimensional Artin groups. We prove that presentations…

We prove that infinitely presented classical $C(6)$ small cancellation groups are SQ-universal. We extend the result to graphical $Gr_*(6)$-groups over free products. For every $p\in\mathbb{N}$, we construct uncountably many pairwise…

Graphical small cancellation extends the classical small cancellation theory and provides a powerful method for constructing groups with interesting features. In the classical setting, C(3)-T(6) small cancellation complexes are known to…

We consider groups defined by cyclic presentations where the defining word has length three and the cyclic presentation satisfies the T(6) small cancellation condition. We classify when these groups are hyperbolic. When combined with known…

We give a proof that groups satisfying the "uniform C'(1/6)" small cancellation condition admit a geometric action on a CAT(-1) space. It follows that random groups at density <1/12 are CAT(-1). The proof consists of a direct construction…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

We prove that finitely generated (not necessarily finitely presented) $C'(\frac{1}{33})$-groups are bi-exact. This is a new class of bi-exact groups.

We continue research into the cyclically presented groups with length three positive relators. We study small cancellation conditions and SQ-universality, we obtain the Betti numbers of the groups' abelianisations, we calculate the orders…

We show that the commensurator of any quasiconvex abelian subgroup in a biautomatic group is small, in the sense that it has finite image in the abstract commensurator of the subgroup. Using this criterion we exhibit groups that are CAT(0)…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the graphical C'(lambda)-small cancellation condition with respect to graphs endowed with a compatible…

In this paper we prove that C(4)-T(4)-P, C(3)-T(6)-P and C(6)-P small cancellation groups are translation dis crete in the strongest possible sense and that in these groups for any $g$ and any $n$ there is an algorithm deciding whether or…

We work in the density model of random groups. We prove that they satisfy an isoperimetric inequality with sharp constant $1-2d$ depending upon the density parameter $d$. This implies in particular a property generalizing the ordinary $C'$…

The main results of this paper is to give a complete characterization of the automaticity of one-relator semigroups with length less than or equal to three. Let $S=sgp\langle A|u=v\rangle$ be a semigroup generated by a set…

Let $G$ be a group given by the presentation [<a_1,...,a_k,b_1,... b_k\,| a_i=u_i(\bar b), b_i=v_i(\bar a) \hbox{for} 1\le i\le k>,] where $k\ge 2$ and where the $u_i\in F(b_1,..., b_k)$ and $w_i\in F(a_1,..., a_k)$ are random words.…