We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth function and solvability of the word problem. We give examples of infinitely presented groups whose finite quotients can be effectively enumerated. Finally, our main result is that a residually finite group can be even not recursively presented and still have computable finite quotients, and that, on the other hand, it can have solvable word problem while still not having computable finite quotients.
We define the notion of computability of Følner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has computable Følner sets. We also prove computability of Følner sets for a group that is extension of an amenable group with solvable word problem by a finitely generated group with computable Følner sets with subrecursive distortion function. Moreover we obtain some known and some new upper bounds for the Følner function in these particular extensions.
We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated non-amenable boundedly acyclic groups and construct a finitely presented non-amenable boundedly acyclic group. On the other hand, we construct a continuum of finitely generated groups, whose bounded cohomology has uncountable dimension in all degrees greater than or equal to~$2$, and a concrete finitely presented one. Countable non-amenable groups with these two extre…
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also study complexity of the set of all effective Følner sequences and effective paradoxical decomposition. In the appendix we attach a version of the paper "On decidability of amenability in computable groups" by K. Duda and A. Ivanov which covers Sections 9 and 10 from the previous version.
In this paper, we show that Cremona groups are sofic. We actually introduce a quantitative notion of soficity, called sofic profile, and show that the group of birational transformations of a d-dimensional variety has sofic profile at most polynomial of degree d. We also observe that finitely generated subgroups of the Cremona group have a solvable word problem. This provides examples of finitely generated groups with no embeddings into any Cremona group, answering a question of S. Cantat.
We show that every finitely generated nilpotent group of class 2 occurs as the quotient of a finitely presented abelian-by-nilpotent group by its largest nilpotent normal subgroup.
In this paper we describe a family of isomorphism invariants of a finitely generated Coxeter group W. Each of these invariants is the isomorphism type of a quotient group W/N of W by a characteristic subgroup N. The virtue of these invariants is that W/N is also a Coxeter group. For some of these invariants, the isomorphism problem of W/N is solved and so we obtain isomorphism invariants that can be effectively used to distinguish isomorphism types of finitely generated Coxeter groups.
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is that the answer depends upon what model of computation is chosen. Since our discussion involves the disparate topics of computability theory and group theory, we include substantial background material.
We generalize the Plesken-Fabiańska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the invariant ring of $\mathrm{GL}(2, K)$ on $m$ copies of $\mathrm{SL}(2, K)$ by simultaneous conjugation. By giving this description, we generalize and simplify some of the known results in invariant theory. An implementation of the algorithm is available in the computer algebra system Magma.
If G is a semidirect product N by H with N normal and finitely generated then G has the property that every finite group is a quotient of some finite index subgroup of G if and only if one of N and H has this property. This has applications to 3-manifolds and to cyclically presented groups, for instance for any fibred hyperbolic 3-manifold M and any finite simple group S, there is a cyclic cover of M whose fundamental group surjects to S. We also give a short proof of the residual finiteness of ascending HNN extensions of finite rank free groups when the induced map on homology is injective.
A nilpotent quotient algorithm for finitely presented Lie rings over Z (LieNQ) is described. The paper studies graded and non-graded cases separately. The algorithm computes the so-called nilpotent presentation for a finitely presented, nilpotent Lie ring. The nilpotent presentation consists of generators for the abelian group and the products---expressed as linear combinations---for pairs formed by generators. Using that presentation the word problem is decidable in $L$. Provided that the Lie ring $L$ is graded, it is possible to determine the canonical presentation for a lower central factor…
We introduce and investigate different definitions of effective amenability, in terms of computability of Følner sets, Reiter functions, and Følner functions. As a consequence, we prove that recursively presented amenable groups have subrecursive Følner function, answering a question of Gromov, for the same class of groups we prove that solvability of the Equality Problem on a generic set (generic EP) is equivalent to solvability of the Word Problem on the whole group (WP), thus providing the first examples of finitely presented groups with unsolvable generic EP. In particular, we prove that f…
It is shown that any finitely generated non-elementary Fuchsian group has among its homomorphic images all but finitely many of the alternating groups. This settles in the affirmative a conjecture of Graham Higman.
The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$ is amenable, e.g. of intermediate growth, (iii) any finitely presented group $E$ with a quotient isomorphic to $G$ contains non-abelian free subgroups, or the stronger (iii') any finitely presented group with a quotient isomorphic to $G$ is large.
The purpose of this paper is to introduce the theory of presentations of monoids acts. We aim to construct `nice' general presentations for various act constructions pertaining to subacts and Rees quotients. More precisely, given an $M$-act $A$ and a subact $B$ of $A$, on the one hand we construct presentations for $B$ and the Rees quotient $A/B$ using a presentation for $A$, and on the other hand we derive a presentation for $A$ from presentations for $B$ and $A/B$. We also construct a general presentation for the union of two subacts. From our general presentations, we deduce a number of fin…
In the first part of this note, we introduce Tietze transformations for $L$-presentations. These transformations enable us to generalize Tietze's theorem for finitely presented groups to invariantly finitely $L$-presented groups. Moreover, they allow us to prove that `being invariantly finitely $L$-presented' is an abstract property of a group which does not depend on the generating set. In the second part of this note, we consider finitely generated normal subgroups of finitely presented groups. Benli proved that a finitely generated normal subgroup of a finitely presented group is invariantl…
Let N be a normal subgroup of a finite group G. We prove that under certain (unavoidable) conditions the subgroup [N,G] is a product of commutators [N,y] (with prescribed values of y from a given set Y) of length bounded by a function of d(G) and |Y| only. This has several applications: 1. A new proof that G^n is closed (and hence open) in any finitely generated profinite group G. 2. A finitely generated abstract quotient of a compact Hausdorff group must be finite. 3. Let G be a topologically finitely generated compact Hausdorff group. Then G has a countably infinite abstract quotient if and …
Given the Cayley graph of a finitely generated group $G$, with respect to a presentation $G^α$ with $n$ generators, the quotient of the rank of the fundamental group of subgraphs of the Cayley graph by the cardinality of the set of vertices of the subgraphs gives rise to the definition of the normalized cyclomatic quotient $Ξ(G^α)$. The asymptotic behavior of this quotient is similar to the asymptotic behavior of the quotient of the cardinality of the boundary of the subgraph by the cardinality of the subgraph. Using Følner's criterion for amenability one gets that $Ξ(G^α)$ vanishes for i…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general computational approach for investigating finitely presented groups by way of quotients and subgroups is described and examples are presented. The techniques can provide detailed information about group structure. Under suitable circumstances a finitely presented group can be shown to be soluble and its complete derived series can be determined, using what is in effect a…
An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.
We show that the outer automorphism groups of graph products of finitely generated abelian groups satisfy the Tits alternative, are residually finite, their so-called Torelli subgroups are finitely generated, and they satisfy a dichotomy between being virtually nilpotent and containing a non-abelian free subgroup that is determined by a graphical condition on the underlying labelled graph. Graph products of finitely generated abelian groups simultaneously generalize right-angled Artin groups (RAAGs) and right-angled Coxter groups (RACGs), providing a common framework for studying these groups.…
If $G$ and $H$ are finitely generated residually nilpotent groups, then $G$ and $H$ are in the same nilpotent genus if they have the same lower central quotients (up to isomorphism). A stronger condition is that $H$ is para-$G$ if there exists a monomorphism of $G$ into $H$ which induces isomorphisms between the corresponding quotients of their lower central series. We first consider residually nilpotent groups and find sufficient conditions on the monomorphism so that $H$ is para-$G.$ We then prove that for certain polycyclic groups, if $H$ is para-$G$, then $G$ and $H$ have the same Hirsch l…
A classical result of Schreier states that nontrivial finitely generated normal subgroups of free groups are of finite index, that is, free groups can only quotient to finite groups with finitely generated kernel. In this note we extend this result to the class of right-angled Artin groups (RAAGs). More precisely, we prove that the quotient of a RAAG by a finitely generated (full) normal subgroup is abelian-by-finite and finite-by-abelian. As Schreier's result extends to nontrivial free products of groups, we further show that our result extends to graph products of groups. As a corollary, we …
We offer in this note a self-contained proof of the fact that a finitely generated group is not virtually nilpotent if and only if it has a quotient with the infinite conjugacy class (ICC) propoerty. This proof is a modern presentation of the original proof, by McLain (1956) and Duguid and McLain (1956).
It is proved that for any prime $p$ a finitely generated nilpotent group is conjugacy separable in the class of finite $p$-groups if and only if the torsion subgroup of it is a finite $p$-group and the quotient group by the torsion subgroup is abelian.
We first give a short group theoretic proof of the following result of Lackenby. If $G$ is a large group, $H$ is a finite index subgroup of $G$ admitting an epimorphism onto a non--cyclic free group, and $g$ is an element of $H$, then the quotient of $G$ by the normal subgroup generated by $g^n$ is large for all but finitely many $n\in \mathbb Z$. In the second part of this note we use similar methods to show that for every infinite sequence of primes $(p_1, p_2, ...)$, there exists an infinite finitely generated periodic group $Q$ with descending normal series $Q=Q_0\rhd Q_1\rhd ... $, such t…
We present a new method for showing that groups are virtually special. This is done by considering finite quotients and linear characters. We use this to show that an infinite family of groups, related to Bestvina-Brady groups and branching, provides new examples of virtually special groups outside of a hyperbolic context.
In this paper we prove that the profinite completion $\mathcal{\hat G}$ of the Grigorchuk group $\mathcal{G}$ is not finitely presented as a profinite group. We obtain this result by showing that $H^2(\mathcal{\hat G},\field{F}_2)$ is infinite dimensional. Also several results are proven about the finite quotients $\mathcal{G}/ St_{\mathcal{G}}(n)$ including minimal presentations and Schur Multipliers.
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its profinite completion. We show that for a wide class of S-arithmetic groups, this map is finite to one, while the the fibers are of unbounded size.
These notes are devoted to lattices in products of trees and related topics. They provide an introduction to the construction, by M. Burger and S. Mozes, of examples of such lattices that are simple as abstract groups. Two features of that construction are emphasized: the relevance of non-discrete locally compact groups, and the two-step strategy in the proof of simplicity, addressing separately, and with completely different methods, the existence of finite and infinite quotients. A brief history of the quest for finitely generated and finitely presented infinite simple groups is also sketche…
We prove that a finitely generated soluble residually finite group has polynomial index growth if and only if it is a minimax group. We also show that if a finitely generated group with PIG is residually finite-soluble then it is a linear group. These results apply in particular to boundedly generated groups; they imply that every infinite BG residually finite group has an infinite linear quotient.
We introduce right generating sets, Cayley graphs, growth functions, types and rates, and isoperimetric constants for left homogeneous spaces equipped with coordinate systems; characterise right amenable finitely right generated left homogeneous spaces with finite stabilisers as those whose isoperimetric constant is $0$; and prove that finitely right generated left homogeneous spaces with finite stabilisers of sub-exponential growth are right amenable, in particular, quotient sets of groups of sub-exponential growth by finite subgroups are right amenable.
Given a finitely presented group $G$, we wish to explore the conditions under which automorphisms of quotients $G/N$ can be lifted to automorphisms of $G$. We discover that in the case where $N$ is a central subgroup of $G$, the question of lifting can be reduced to solving a certain matrix equation. We then use the techniques developed to show that $Inn(G)$ is not characteristic in $Aut(G)$, where $G$ is a metacyclic group of order $p^n$, $p\neq 2$.
The `upper rank' of a group is the supremum of the (Prüfer) ranks of its finite quotients, and for a prime $p$, the `upper $p$-rank' is the supremum of the sectional $p$-ranks of those quotients. The former is finite if and only if the latter are finitely bounded as $p$ ranges over all primes (a deep fact). Here we discuss the question: if the upper $p$-ranks of a finitely generated group $G$ are all finite, are they necessarily bounded? The case where $G$ is a soluble group is still an open problem.
We determine all generalized Baumslag-Solitar groups (finitely generated groups acting on a tree with all stabilizers infinite cyclic) which are quotients of a given Baumslag-Solitar group BS(m,n), and (when BS(m,n) is not Hopfian) which of them also admit BS(m,n) as a quotient. We determine for which values of r,s one may embed BS(r,s) into a given BS(m,n), and we characterize finitely generated groups which embed into some BS(n,n).
We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber product of two free monoids to be finitely generated, and show that all such fiber products are also finitely presented. By way of contrast, we show that fiber products of free semigroups over finite fiber quotients are never finitely generated. We then consider fiber products of free semigroups over infinite semigroups, and show that for such a fiber product to …
In this expanded account of a talk given at the Oberwolfach Arbeitsgemeinschaft "Totally Disconnected Groups", October 2014, we discuss results of Nikolay Nikolov and Dan Segal on abstract quotients of compact Hausdorff topological groups, paying special attention to the class of finitely generated profinite groups. Our primary source is a paper, entitled "Generators and commutators in finite groups; abstract quotients of compact groups", that was published by Nikolov and Segal in 2012. Sidestepping all difficult and technical proofs, we present a selection of accessible arguments to illuminat…
In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has ascending finite endomorphic presentation. It follows that any finitely presented indicable group without free semigroups has the structure of a semidirect product $H \rtimes \field{Z}$ where $H$ has finite ascending endomorphic presentation.
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 soluble groups, of one-relator or knot groups, and of Artin groups.
We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we discuss the possibility of finding an explicit set of defining equations (i.e. of expressing G as the maximal residually free quotient of an explicit finitely presented group).
This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable family of finitely generated, residually finite non-amenable groups all of which are profinitely isomorphic to $A$. All of these groups are branch groups. Moreover, picking up Grothendieck's problem, the group $A$ embeds in these groups such that the inclusion induces an isomorphism of profinite completions. In addition, we review the concept of uniform amenabil…
We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only modify the tape at a bounded distance around the head, change the state and move the head in a bounded way. We study three natural subgroups arising in this model: the group of finite-state automata, which generalizes the topological full groups studied in topological dynamics and the theory of orbit-equivalence; the group of oblivious Turing machines whose movem…
We will give an example of a branch group $G$ that has exponential growth but does not contain any non-abelian free subgroups. This answers question 16 from \cite{Bartholdi} positively. The proof demonstrates how to construct a non-trivial word $w_{a,b}(x,y)$ for any $a,b \in G$ such that $w_{a,b}(a,b) = 1$. The group $G$ is not just-infinite. We prove that every normal subgroup of $G$ is finitely generated as an abstract group and every proper quotient soluble. Further, $G$ has infinite virtual first Betti number but is not large.
We give effective proofs of residual finiteness and conjugacy separability for finitely generated nilpotent groups. In particular, we give precise asymptotic bounds for a function introduced by Bou-Rabee that measures how large the quotients that are need to separate non-identity elements of bounded length from the identity which improves the work of Bou-Rabee. Similarly, we give polynomial upper and lower bounds for an analogous function introduced by Lawton, Louder, and McReynolds that measures how large the quotients that are need to separate pairs of distinct conjugacy classes of bounded w…
Let $M = \mathbb{B}^2 / Γ$ be a smooth ball quotient of finite volume with first betti number $b_1(M)$ and let $\mathcal{E}(M) \ge 0$ be the number of cusps (i.e., topological ends) of $M$. We study the growth rates that are possible in towers of finite-sheeted coverings of $M$. In particular, $b_1$ and $\mathcal{E}$ have little to do with one another, in contrast with the well-understood cases of hyperbolic $2$- and $3$-manifolds. We also discuss growth of $b_1$ for congruence arithmetic lattices acting on $\mathbb{B}^2$ and $\mathbb{B}^3$. Along the way, we provide an explicit example of a l…
Let $\mathbf{G}$ be a unipotent group scheme defined in terms of a nilpotent Lie lattice over the ring $\mathcal{O}$ of integers of a number field. We consider bivariate zeta functions of groups of the form $\mathbf{G}(\mathcal{O})$ encoding, respectively, the numbers of isomorphism classes of irreducible complex representations of finite dimensions and the numbers of conjugacy classes of congruence quotients of the associated groups. We show that the domains of convergence and meromorphic continuation of these zeta functions of groups $\mathbf{G}(\mathcal{O})$ are independent of the number fi…
A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is finite, provided the group in question doesn't contain any slender subgroups with infinite dihedral quotients and satisfies an ascending chain condition on certain chains of subgroups of edge groups. As a corollary, slender JSJ hierarchies of hyperbolic groups which are (virtually) without $2$--torsion and finitely presented subgroups of SL(n,Z) are both fini…
A group G is (finitely) co-Hopfian if it does not contain any proper (finite-index) subgroups isomorphic to itself. We study finitely generated groups G that admit a descending chain of proper normal finite-index subgroups, each of which is isomorphic to G. We prove that up to finite index, these are always obtained by pulling back a chain of subgroups from a free abelian quotient. We give two applications: First, we show any characteristic proper finite-index subgroup isomorphic to G arises by pulling back a finite-index subgroup of the abelianization, and secondly, we prove special cases (fo…
Let $W$ be a right-angled Coxeter group corresponding to a finite non-discrete graph $\mathcal{G}$ with at least $3$ vertices. Our main theorem says that $\mathcal{G}^c$ is connected if and only if for any infinite index quasiconvex subgroup $H$ of $W$ and any finite subset $\{ γ_1, \ldots , γ_n \} \subset W \setminus H$ there is a surjection $f$ from $W$ to a finite alternating group such that $f (γ_i) \notin f (H)$. A corollary is that a right-angled Artin group splits as a direct product of cyclic groups and groups with many alternating quotients in the above sense. Similarly, finitely gene…
Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid S(W) is finitely based. We find a simple algorithm that recognizes finitely based words among words with at most two non-linear variables. We also describe syntactically all hereditary finitely based monoids of the form S(W).
We say a group $G$ has property $R_\infty$ if the number $R(φ)$ of twisted conjugacy classes is infinite for every automorphism $φ$ of $G$. For such groups, the $R_\infty$-nilpotency degree is the least integer $c$ such that $G/γ_{c+1}(G)$ has property $R_\infty$. In this work, we compute the $R_\infty$-nilpotency degree of all Generalized Solvable Baumslag-Solitar groups $Γ_n$. Moreover, we compute the lower central series of $Γ_n$, write the nilpotent quotients $Γ_{n,c}=Γ_n/γ_{c+1}(Γ_n)$ as semidirect products of finitely generated abelian groups and classify which integer invertible matrice…
