An Alternative Proof That the Fibonacci Group F(2, 9) is Infinite

DOI10.1080/10586458.1995.10504312zbMath0853.20019arXivmath/9507204MaRDI QIDQ4891316

Derek F. Holt

Publication date: 31 October 1996

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

generators; word problem; automatic structures; Fibonacci groups; proof by computer

Mathematics Subject Classification ID

20F05: Generators, relations, and presentations of groups

20F65: Geometric group theory

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

20-04: Software, source code, etc. for problems pertaining to group theory

Uses Software

• AUTOMATA

Cites Work

• Proving a group infinite
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• The last of the Fibonacci groups
• On the Commensurability Class of the Rational Modular Group
• Unnamed Item