An alternative proof that the Fibonacci group {$F(2,9)$} is infinite
Holt, Derek F.
Experiment. Math., Tome 4 (1995) no. 4, p. 97-100 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
This note contains a report of a proof by computer that the Fibonacci group $F(2,9)$ is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that the group generators have infinite order, which of course implies that the group itself is infinite.
Publié le : 1995-05-14
Classification:  20F05 
@article{1047931620,
     author = {Holt, Derek F.},
     title = {An alternative proof that the Fibonacci group {$F(2,9)$} is infinite},
     journal = {Experiment. Math.},
     volume = {4},
     number = {4},
     year = {1995},
     pages = { 97-100},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1047931620}
}

Holt, Derek F. An alternative proof that the Fibonacci group {$F(2,9)$} is infinite. Experiment. Math., Tome 4 (1995) no. 4, pp.  97-100. http://gdmltest.u-ga.fr/item/1047931620/