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

DOI10.1080/10586458.1995.10504312zbMath0853.20019arXivmath/9507204OpenAlexW2066486953MaRDI 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

generatorsword problemautomatic structuresFibonacci groupsproof by computer

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (6)

Hyperbolic groups of Fibonacci type and T(5) cyclically presented groups ⋮ Fractional Fibonacci groups with an odd number of generators ⋮ The Development of the Theory of Automatic Groups ⋮ Fibonacci type presentations and 3-manifolds ⋮ GROUPS OF FIBONACCI TYPE REVISITED ⋮ ON CERTAIN PAIRS OF NON-ENGEL ELEMENTS IN FINITE GROUPS

Uses Software

• AUTOMATA

Cites Work

• Unnamed Item
• 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

This page was built for publication: An Alternative Proof That the Fibonacci Group F(2, 9) is Infinite