Counting elements and geodesics in Thompson's group F.

DOI10.1016/J.JALGEBRA.2010.02.035zbMATH Open1201.20038arXiv0902.0202OpenAlexW2065233055WikidataQ60692203 ScholiaQ60692203MaRDI QIDQ984996FDOQ984996

Authors: Éric Fusy, Andrew Rechnitzer, Murray Elder 

Publication date: 20 July 2010

Published in: Journal of Algebra (Search for Journal in Brave)

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 $\mathrm{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$.

Full work available at URL: https://arxiv.org/abs/0902.0202

Recommendations

• Computational explorations in Thompson's group \(F\)
• On the cogrowth of Thompson's group \(F\)
• Computing word length in alternate presentations of Thompson's group \(F\).
• Combinatorial properties of Thompson’s group 𝐹
• Growth of Positive Words in Thompson's GroupF

zbMATH Keywords

algorithmsgenerating setsgrowth functionsThompson group \(F\)numbers of elementsgeodesic growth seriesnumbers of geodesics

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Asymptotic enumeration (05A16) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• A course in combinatorics.
• Introductory notes on Richard Thompson's groups
• A method for the enumeration of various classes of column-convex polygons
• Title not available (Why is that?)
• Linear recurrences with constant coefficients: The multivariate case
• Walks confined in a quadrant are not always D-finite
• Title not available (Why is that?)
• Combinatorial properties of Thompson’s group 𝐹
• Minimal length elements of Thompson's group \(F\)
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• ON THE PROPERTIES OF THE CAYLEY GRAPH OF RICHARD THOMPSON'S GROUP F
• FOREST DIAGRAMS FOR ELEMENTS OF THOMPSON'S GROUP F
• Complete growth functions of hyperbolic groups
• The number of three-choice polygons
• Computational explorations in Thompson's group \(F\)
• Generalized atmospheric Rosenbluth methods (GARM)
• Counting elements and geodesics in Thompson's group \(F\).

Cited In (16)

• On the cogrowth of Thompson's group \(F\)
• Growth of Positive Words in Thompson's GroupF
• On the geometry of the Thompson group
• Counting elements and geodesics in Thompson's group \(F\).
• Growth in Baumslag-Solitar groups. II: The Bass-Serre tree
• Growth of positive words and lower bounds of the growth rate for Thompson's groups \(F(p)\)
• A computational approach to the Thompson group F
• Computational explorations in Thompson's group \(F\)
• ON THE PROPERTIES OF THE CAYLEY GRAPH OF RICHARD THOMPSON'S GROUP F
• Combinatorial and metric properties of Thompson’s group 𝑇
• Geometric presentations for Thompson's groups.
• Some geodesic problems in groups
• Distributions of restricted rotation distances
• R. Thompson’s group and the amenability problem
• Restricted rotation distance between k-ary trees
• Numerical studies of Thompson’s group F and related groups

Uses Software

• OEIS

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)