Related papers: The "spread" of Thompson's group $F$

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element of $G$ belongs to a generating pair of $G$. Thompson's group $V$ was proved to be $\frac{3}{2}$-generated by Donoven and Harper in 2019. It was the…

It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is…

Every finite simple group can be generated by two elements and, in fact, every nontrivial element is contained in a generating pair. Groups with this property are said to be $\frac{3}{2}$-generated, and the finite $\frac{3}{2}$-generated…

A group is $\frac32$-generated if every non-trivial element is part of a generating pair. In 2019, Donoven and Harper showed that many Thompson groups are $\frac32$-generated and posed five questions. The first of these is whether there…

Every finite simple group can be generated by two elements, and Guralnick and Kantor proved that, moreover, every nontrivial element is contained in a generating pair. Groups with this property are said to be $\frac{3}{2}$-generated.…

A group $G$ is said to be $\frac{3}{2}$-generated if every nontrivial element belongs to a generating pair. It is easy to see that if $G$ has this property then every proper quotient of $G$ is cyclic. In this paper we prove that the…

A group is $\frac{3}{2}$-generated if every non-identity element is contained in a generating pair. A conjecture of Breuer, Guralnick and Kantor from 2008 asserts that a finite group is $\frac{3}{2}$-generated if and only if every proper…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

We prove that under two natural probabilistic models (studied by Cleary, Elder, Rechnitzer and Taback), the probability that a random pair of elements of Thompson's group $F$ generate the entire group is positive. We also prove that for any…

Every finite simple group can be generated by two elements, and in 2000, Guralnick and Kantor resolved a 1962 question of Steinberg by proving that in a finite simple group every nontrivial element belongs to a generating pair. Groups with…

A subset $S$ of a group $G$ invariably generates $G$ if $G= \langle s^{g(s)} | s \in S\rangle$ for every choice of $g(s) \in G,s \in S$. We say that a group $G$ is invariably generated if such $S$ exists, or equivalently if $S=G$ invariably…

In this paper it is proved that the group $F\left(\frac32\right)$, a Thompson-style group with breaks in $\mathbb{Z}\left[\frac16\right]$ but whose slopes are restricted only to powers of $\frac32$, is finitely generated, with a generating…

We prove that Thompson's group F is not minimally almost convex with respect to any generating set which is a subset of the standard infinite generating set for F and which contains x_1. We use this to show that F is not almost convex with…

A group $G$ is invariably generated if there exists a subset $S \subseteq G$ such that, for every choice $g_s \in G$ for $s \in S$, the group $G$ is generated by $\{ s^{g_s} \mid s \in S \}$. In [GGJ16] Gelander, Golan and Juschenko showed…

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 describe a procedure for constructing a generalized Thompson group out of a family of groups that is equipped with what we call a cloning system. The previously known Thompson groups F, V, Vbr and Fbr arise from this procedure using,…

We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…

We prove that Thompson's group $F$ has a generating set with two elements such that every two powers of them generate a finite index subgroup of $F$.

We prove that Richard Thompson's group F is not minimally almost convex with respect to the two standard generators. This improves upon a recent result of S. Cleary and J. Taback. We make use of the forest diagrams for elements of F…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…