Related papers: Combinatorial properties of Thompson's group F
We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…
We introduce forest diagrams to represent elements of Thompson's group F. These diagrams relate to a certain action of F on the real line in the same way that tree diagrams relate to the standard action of F on the unit interval. Using…
We introduce forest diagrams and strand diagrams for elements of Thompson's group F. A forest diagram is a pair of infinite, bounded binary forests together with an order-preserving bijection of the leaves. Using forest diagrams, we derive…
We introduce a new method for computing the word length of an element of Thompson's group F with respect to a "consecutive" generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F.…
We show that Thompson's group F does not satisfy Cannon's almost convexity condition AC(n) for any integer n in the standard finite two generator presentation. To accomplish this, we construct a family of pairs of elements at distance n…
Braided Thompson's groups are finitely presented groups introduced by Brin and Dehornoy which contain the ordinary braid groups $B_n$, the finitary braid group $B_{\infty}$ and Thompson's group $F$ as subgroups. We describe some of the…
We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…
We prove that Richard Thompson's group F is not minimally almost convex with respect to the two standard generators. This improves upon a recent result of S. Cleary and J. Taback. We make use of the forest diagrams for elements of F…
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…
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…
The purpose of this paper is to study the properties of the irrational-slope Thompson's group $F_\tau$ introduced by Cleary in 1995. We construct presentations, both finite and infinite and we describe its combinatorial structure using…
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.…
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…
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…
We describe a family of words in Thompson's group F which present a challenge to the question of finding canonical minimal length representatives, and which show that F is not combable by geodesics. These words have the property that there…
We prove that seesaw words exist in Thompson's Group F(N) for N=2,3,4,... with respect to the standard finite generating set X. A seesaw word w with swing k has only geodesic representatives ending in g^k or g^{-k} (for given g\in X) and at…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
The conjugator length function of a finitely generated group is the function $f$ so that $f(n)$ is the minimal upper bound on the length of a word realizing the conjugacy of two words of length at most $n$. We study herein the spectrum of…
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…