Abstract
The Fibonacci group F(2, 7) has been known to be cyclic of order 29 for about five years. This was first established by computer coset enumerations which exhibit only the result, without supporting proofs. The working in a coset enumeration actually contains proofs of many relations that hold in the group. A hand proof that F(2, 7) is cyclic of order 29, based on the working in computer coset enumerations, is presented here.
Publisher
Cambridge University Press (CUP)
Reference7 articles.
1. Generators and relations for cyclic groups;Amer. Math. Monthly,1967
2. Advanced problem 5327;Conway;Amer. Math. Monthly,1965
3. The determination of Fibonacci groups
4. The Fibonacci Groups
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献