Related papers: Random generation of subgroups of the modular grou…
We exhibit a finitely generated group $\M$ whose rational homology is isomorphic to the rational stable homology of the mapping class group. It is defined as a mapping class group associated to a surface $\su$ of infinite genus, and…
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…
In this paper, we prove that if G is a finite simple group with the same-size conjugacy class set U(G) = U(PSL(2, 11)), then G is isomorphic to PSL(2, 11).
Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…
We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).
An arbitrary homomorphism between groups is nonincreasing for stable commutator length, and there are infinitely many (injective) homomorphisms between free groups which strictly decrease the stable commutator length of some elements.…
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 show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.
Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
A pseudomodular group is a discrete subgroup $\Gamma \leq PGL(2,\mathbb{Q})$ which is not commensurable with $PSL(2,\mathbb{Z})$ and has cusp set precisely $\mathbb{Q}\cup\{\infty\}$. The existence of such groups was proved by Long and…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
We show that in the category of groups, every singly-generated class which is closed under isomorphisms, direct limits and extensions is also singly-generated under isomorphisms and direct limits, and in particular is co-reflective. We also…
We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…
If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…