Open Access
1995 An alternative proof that the Fibonacci group {$F(2,9)$} is infinite
Derek F. Holt
Experiment. Math. 4(2): 97-100 (1995).


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.


Download Citation

Derek F. Holt. "An alternative proof that the Fibonacci group {$F(2,9)$} is infinite." Experiment. Math. 4 (2) 97 - 100, 1995.


Published: 1995
First available in Project Euclid: 17 March 2003

zbMATH: 0853.20019
MathSciNet: MR1377412

Primary: 20F05

Rights: Copyright © 1995 A K Peters, Ltd.

Vol.4 • No. 2 • 1995
Back to Top