2009/02/28 by Murray Elder, Eric Fusy, Andrew Rechnitzer · 1 citation
Mathematics · #math.GR #math.CO #msc:20F65
paper · pdf · doi:10.1016/j.jalgebra.2010.02.035
27 pages, 9 figures, 3 tables
arxiv created 2010/02/19 · arxiv updated 2012/05/16
We present two quite different algorithms to compute the number of elements in the sphere of radius n of Thompson's group F with standard generating set. The first of these requires exponential time and polynomial space, but additionally computes the number of geodesics and is generalisable to many other groups. The second algorithm requires polynomial time and space and allows us to compute the size of the spheres of radius n with n ≤ 1500. Using the resulting series data we find that the growth rate of the group is bounded above by 2.62167.... This is very close to Guba's lower bound of \tfrac3+√(5)2 \citeGuba2004. Indeed, numerical analysis of the series data strongly suggests that the growth rate of the group is exactly \tfrac3+√(5)2.