Counting elements and geodesics in Thompson's group F.

From MaRDI portal
(Redirected from Publication:984996)
Counting elements and geodesics in Thompson's group \(F\).




Abstract: 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 nleq1500. 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 frac3+sqrt52 cite{Guba2004}. Indeed, numerical analysis of the series data strongly suggests that the growth rate of the group is exactly frac3+sqrt52.





Describes a project that uses

Uses Software





This page was built for publication: Counting elements and geodesics in Thompson's group \(F\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984996)