Computing word length in alternate presentations of Thompson's group F
arXiv:0706.3218 · doi:10.1142/S0218196709005445
Abstract
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 use this method to show that (F,X_n) is not almost convex, and has pockets of increasing, though bounded, depth dependent on n.
28 pages, 13 figures