Related papers: Invariable generation of Thompson groups

A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…

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 subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

Recall that a group $G$ is said to be $\frac{3}{2}$-generated if every non-trivial element $g\in G$ has a co-generator in $G$ (i.e., an element which together with $g$ generates $G$). Thompson's group $V$ was proved to be…

We prove a result on the asymptotic proportion of randomly chosen pairs of permutations in the symmetric group $S_n$ which "invariably" generate a nonsolvable subgroup, i.e., whose cycle structures cannot possibly both occur in the same…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group $G$ \emph{invariably generates} $G$ if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates $G$ for every $d$-tuple $(g_{1},g_{2}\hdots,g_{d})\in G^{d}$.…

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 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.…

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ invariably generates $G$ if $\{g_1^{x_1}, \ldots , g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected value of the random…

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…

Using small cancellation methods, we show that the property invariable generation does not pass to finite index subgroups, answering questions of Wiegold and Kantor-Lubotzky-Shalev. We further show that a finitely generated group that is…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

A topological group $G$ is topologically normally generated if there exists $g \in G$ such that the normal closure of $g$ is dense in $G$. Let $S$ be a tame, infinite type surface whose mapping class group $\mathrm{Map}(S)$ is generated by…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We show that pure subgroups of infinitely braided Thompson's are bi-orderable. For every finitely generated pure subgroup, we give explicit sets of generators.

We prove that the elementary theory of Thompson's group $F$ is hereditarily undecidable.

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…

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 say that permutations $\pi_1,\dots, \pi_r \in \mathcal{S}_n$ invariably generate $\mathcal{S}_n$ if, no matter how one chooses conjugates $\pi'_1,\dots,\pi'_r$ of these permutations, $\pi'_1,\dots,\pi'_r$ generate $\mathcal{S}_n$. We…