Related papers: Computational explorations in Thompson's group F

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…

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…

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…

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…

We investigate the cogrowth and distribution of geodesics in R. Thompson's group $F$.

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…

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

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

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…

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…

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…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

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…

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…

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 introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

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 determine the abstract commensurator com(F) of Thompson's group F and describe it in terms of piecewise linear homeomorphisms of the real line and in terms of tree pair diagrams. We show com (F) is not finitely generated and determine…

The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…