Combinatorial properties of Thompson’s group 𝐹 (Q4813787)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2091181
Language Label Description Also known as
default for all languages
No label defined
    English
    Combinatorial properties of Thompson’s group 𝐹
    scientific article; zbMATH DE number 2091181

      Statements

      Combinatorial properties of Thompson’s group 𝐹 (English)
      0 references
      0 references
      0 references
      13 August 2004
      0 references
      Thompson group \(F\)
      0 references
      tree pair diagrams
      0 references
      word lengths
      0 references
      types of carets
      0 references
      Cayley graphs
      0 references
      dead ends
      0 references
      deep pockets
      0 references
      presentations
      0 references
      normal forms
      0 references
      Thompson's group \(F\) has been commonly understood by the following two different types of presentation \[ F=\langle a_0,a_1\mid a^{-1}_1a_2a_1=a_3,\;a^{-1}_1a_3a_1=a_4\rangle, \] where we define \(a_n=a^{-1}_0a_{n-1}a_0\) for \(n>1\), and the infinite presentation \[ P=\langle a_k,\;k\geq 0\mid a^{-1}_ia_ja_i=a_{j+1},\text{ if }i<j\rangle. \] The authors study some combinatorial consequences of Blake Fordham's theorems on the word metric of Thompson's group in the standard two generator presentations. They discuss many interesting combinatorial properties of Thompson's group, which are derived from the relationship between the normal form of elements of \(F\) and the pairs of finite rooted trees used to represent elements of \(F\). Such combinatorial properties have applications to estimating word lengths in \(F\) and counting and determining caret types, leading to algorithms for constructing minimal length paths in the standard two generator presentations. In section 2 a brief introduction to Thompson's group and Fordham's method for calculating word lengths are described together with details for the bijective process which transforms a tree pair diagram representing an element of \(F\) into its unique normal form in the infinite presentation. In section 3 they describe Fordham's method to immediately obtain an estimate of the word length \(|w|\) of an element \(w\) in \(F\) from the tree pair diagram representing \(w\) in the word metric arising from the finite presentations of Thompson's group. In section 4 they use Fordham's method of calculating word lengths to explore an interesting phenomenon which occurs in the Cayley graph of \(F\) with respect to the standard two generator finite presentation. In section 5 they describe the combinatorial relationship between the normal form of an element \(w\in F\) and the number and types of carets in the tree pair diagram representing \(w\). Finally in section 6 they present a method of constructing minimal length paths in the standard two generator presentation for strictly positive and negative words in \(F\).
      0 references

      Identifiers