Related papers: Finitely presented simple groups with at least exp…

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

We give a finite presentation of the mapping class group of an oriented (possibly bounded) surface of genus greater or equal than 1, considering Dehn twists on a very simple set of curves.

The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…

A characterization of the maximal abelian sub-algebras of matrix algebras that are normalized by the canonical representation of a finite Heisenberg group is given. Examples are constructed using a classification result for finite…

Gromov proposed an averaged version of the Dehn function and claimed that in many cases it should be subasymptotic to the Dehn function. Using results on random walks in nilpotent groups, we confirm this claim for most nilpotent groups. In…

We define and study the class of positively finitely related (PFR) profinite groups. Positive finite relatedness is a probabilistic property of profinite groups which provides a first step to defining higher finiteness properties of…

Given a finitely presented group $G$ and a surjective homomorphism $G\to \mathbb{Z}^n$ with finitely presented kernel $K$, we give an upper bound on the Dehn function of $K$ in terms of an area-radius pair for $G$. As a consequence we…

If a finite group G has a presentation with d generators and r relations, it is well-known that r - d is at least the rank of the Schur multiplier of G; a presentation is called efficient if equality holds. There is an analogous definition…

In this paper it is proved that if a finitely presented group acts properly discontinuously, cocompactly and by isometries on a simply connected Riemannian manifold, then the two Dehn functions, of the group and the manifold, respectively,…

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

Hughes has defined a class of groups, which we call FSS (finite similarity structure) groups. Each FSS group acts on a compact ultrametric space by local similarities. The best-known example is Thompson's group V. Guided by previous work on…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

This survey paper concerns mainly with some asymptotic topological properties of finitely presented discrete groups: quasi-simple filtration (QSF), geometric simple connectivity (GSC), topological inverse-representations, and the notion of…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…

In this article, I study some classes of finitely presented groups with the aim of finding out whether the maximal metabelian quotients of the members of these classes admit finite presentations. The considered classes include those of…

This is the first one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple linear groups.

It is proved that every finitely generated profinite group with fewer than $2^{\aleph_0}$ conjugacy classes of elements of infinite order is finite

This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…