Related papers: A computational approach to the Thompson group $F$

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…

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…

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…

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

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.

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…

In this short note, we show that R. Thompson's group $F$ admits a normalish amenable subgroup, and that the standard copy of $F$ in R. Thompson's group $T$ is normalish in $T$. We further conjecture that if $F$ is non-amenable, then $T$…

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…

Let $R=K[G]$ be a group ring of a group $G$ over a field $K$. It is known that if $G$ is amenable then $R$ satisfies the Ore condition: for any $a,b\in R$ there exist $u,v\in R$ such that $au=bv$, where $u\ne0$ or $v\ne0$. It is also true…

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…

In this paper we prove that the general version, F(N) of the Thompson group is inner amenable. As a consequence we generalize a result of P.Jolissaint. To do so, we prove first that F(N) together with a normal subgroup are i.c.c (infinite…

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…

In this paper we prove that the Thompson groups $T$ and $V$ are not inner amenable. In particular, their group von Neumann algebras do not have property $\Gamma$. Moreover, we prove that if the reduced group $C^\ast$-algebra of $T$ is…

This paper demonstrates the uniformly finite homology developed by Block and Weinberger and its relationship to amenable spaces via applications to the Cayley graph of Thompson's Group F. In particular, a certain class of subgraph of F is…

In a recent paper Uffe Haagerup and Kristian Knudsen Olesen show that for Richard Thompson's group $T$, if there exists a finite set $H$ which can be decomposed as disjoint union of sets $H_1$ and $H_2$ with $\sum_{g\in…

By the density of a finite graph we mean its average vertex degree. For an $m$-generated group, the density of its Cayley graph in a given set of generators, is the supremum of densities taken over all its finite subgraphs. It is known that…

We extend F{\o}lner's amenability criterion to the realm of general topological groups. Building on this, we show that a topological group $G$ is amenable if and only if its left translation action can be approximated in a uniform manner by…

The purpose of this article is to formulate conjectural generalizations of Hindman's Theorem and Ellis's Lemma for nonassociative binary systems and relate them to the amenability problem for Thompson's group $F$. Partial results are…

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

The subgroup structure of Thompson's group F is not yet fully understood. The group F is a subgroup of the group PL(I) of orientation preserving, piecewise linear self homeomorphisms of the unit interval and this larger group thus also has…