相关论文: Thompson's Group F is not Minimally Almost Convex

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…

We prove that the group of almost-automorphisms of the infinite rooted regular $d$-ary tree $\mathcal{T}_d$ arises naturally as the Thompson-like group of a so called $d$-ary cloning system. A similar phenomenon occurs for any…

We show that a large class of languages in the standard finite generating set X = {$x_0, x_1, x_0^{-1}, x_1^{-1}$} cannot be part of an automatic structure for Thompson's Group F. These languages are ones that accept at least one…

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Jones introduced unitary representations for the Thompson groups $F$ and $T$ from a given subfactor planar algebra. Some interesting subgroups arise as the stabilizer of certain vector, in particular the Jones subgroups $\vec{F}$ and…

We extend the concept of two-way forest diagrams, introduced by Belk and Brown in 2003, to represent elements of $F(n)$ as a pair of infinite, bounded $n$-ary forests together with an order-preserving bijection of the leaves. This…

We prove that Thompson's group $F$ has a subgroup $H$ such that the conjugacy problem in $H$ is undecidable and the membership problem in $H$ is easily decidable. The subgroup $H$ of $F$ is a closed subgroup of $F$. That is, every function…

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups $\mathbb{Z}\wr \mathbb{Z},$ the lamplighter group, $(\mathbb{Z}\wr \mathbb{Z})\wr \mathbb{Z}$ and the Navas-Brin group $B.$ We have also given…

We consider generalisations of Thompson's group $V$, denoted by $V_r(\Sigma)$, which also include the groups of Higman, Stein and Brin. It was shown by the authors in [20] that under some mild conditions these groups and centralisers of…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…

It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a…

Let $\Gamma$ be a simplicial, finite, connected graph such that $\Gamma$ does not decompose as a nontrivial join. We prove that two notions of strong quasiconvexity and stability are equivalent in the right-angled Artin group $A_\Gamma$…

The purpose of this article is prove that Thompson's group F is amenable. The methods developed will then be used to prove a generalization of Hindman's theorem for the free nonassociative binary system on one generator.

We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…

Golan and Sapir \cite{MR3978542} proved that the Thompson's groups $F$, $T$ and $V$ have linear divergence. In the current paper, we focus on the divergence properties of several generalisation of the Thompson's groups, we first consider…

We consider a class of groups $V_n(G)$ which are supergroups of the Higman-Thompson groups $V_n$. These groups fit in a framework of Elizabeth Scott for generating infinite virtually simple groups, and the groups we study in particular are…

Let $f$ be an automorphism of a group $G$. Two elements $x, y$ in $G$ are said to be in the same $f$-twisted conjugacy class if there exists an element $z$ in $G$ such that $y=z x f(z^{-1})$. This is an equivalence relation known as…

Richard J. Thompson invented his group F in the 60s; it is a group full of surprises: it has a finite presentation with 2 generators and 2 relators, and a derived group that is simple; it admits a peculiar infinite presentation and has a…

The distance from the origin in the word metric for generalizations F(p) of Thompson's group F is quasi-isometric to the number of carets in the reduced rooted tree diagrams representing the elements of F(p). This interpretation of the…

We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We define the groups as partial transformation groups and we give a faithful representation in the Cuntz C*-algebra. For the…