相关论文: Numerical studies of Thompson's group F and relate…

We describe the results of some computational explorations in Thompson's group F. We describe experiments to estimate the cogrowth of F with respect to its standard finite generating set, designed to address the subtle and difficult…

It is a long standing open problem whether the Thompson group $F$ is an amenable group. In this paper we show that if $A$, $B$, $C$ denote the standard generators of Thompson group $T$ and $D:=C B A^{-1}$ then…

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…

Let $F$ denote the Thompson group with standard generators $A=x_0$, $B=x_1$. It is a long standing open problem whether $F$ is an amenable group. By a result of Kesten from 1959, amenability of $F$ is equivalent to $$(i)\qquad ||I+A+B||=3$$…

We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson's group $F$ which is strictly well-ordered by the embeddability relation in type $\epsilon_0 +1$. All except the maximum element of this family…

This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…

We critically analyse a recent numerical method due to the first author, Rechnitzer and van Rensburg, which attempts to detect amenability or non-amenability in a finitely generated group by numerically estimating its asymptotic cogrowth…

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

The goal is to extend a non-standard amenability test for groups, based on random walks and superharmonic functions, to group actions on sets, and to apply it to Thompson's group F using certain properties of extensive amenability. While no…

We outline a general procedure that builds classifying spaces for generalized Thompson groups $\Gamma$. The construction depends on a small number of choices: (1) an inverse semigroup $S$ of partial transformations that ``locally determine"…

Richard Thompson's group F is the group of piecewise linear homeomorphisms of the unit interval with a finite number of break points, all at dyadic rational numbers (their denominators are powers of 2) and with slopes which are powers of 2.…

Let $F(p)$, $p\ge2$ be the family of generalized Thompson's groups. Here F(2) is the famous Richard Thompson's group usually denoted by $F$. We find the growth rate of the monoid of positive words in $F(p)$ and show that it does not exceed…

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

In this paper we study the non-amenability question of the Thompson group $F$ from the $C^{*}$ algebra side. Using a characterization of amenability in this framework we set about evaluating the reduced norm of the averages $\frac{1}{n}\sum…

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 introduce two natural notions of cogrowth for finitely generated semigroups --- one local and one global --- and study their relationship with amenability and random walks. We establish the minimal and maximal possible values for…

A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

We obtain a characterisation of confined subgroups of Thompson's group $F$. As a result, we deduce that orbital graph of a point under action of $F$ has uniformly subexponential growth if and only if this point is fixed by the commutator…

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…