Related papers: Proving finitely presented groups are large by com…
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
We present an algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We use this to prove that a mapping torus of a finitely generated free group automorphism is…
We prove that if a group possesses a deficiency 1 presentation where one of the relators is a commutator then it is the integers times the integers, is large, or is as far as possible from being residually finite. Then we use this to show…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by…
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…
Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…
Finite group theorists have established many formulas that express interesting properties of a finite group in terms of sums of characters of the group. An obstacle to applying these formulas is lack of control over the dimensions of…
We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…
A group is known as `large' if some finite index subgroup admits a surjective homomorphism onto a non-abelian free group. In this paper, we give a necessary and sufficient condition for a finitely presented group to be large, in terms of…
Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a…
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…
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…
We find a family of groups generated by a pair of parabolic elements in which every relator must admit a long subword of a specific form. In particular, this collection contains groups in which the number of syllables of any relator is…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
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 consider the cyclically presented groups defined by cyclic presentations with $2m$ generators $x_i$ whose relators are the $2m$ positive length three relators $x_ix_{i+1}x_{i+m-1}$. We show that they are hyperbolic if and only if $m\in…
We consider largeness of groups given by a presentation of deficiency 1, where the group is respectively free-by-cyclic, LERF or 1-relator. We give the first examples of (finitely generated free)-by-(infinite cyclic) word hyperbolic groups…
We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…