Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-25T17:48:12.877Z Has data issue: false hasContentIssue false
  • English
  • Français

The last of the Fibonacci groups

Published online by Cambridge University Press:  14 November 2011

George Havas ,
J. S. Richardson  and
Leon S. Sterling
George Havas
Affiliation:
Department of Mathematics, Institute of Advanced Studies, Australian National University, Canberra
J. S. Richardson
Affiliation:
Department of Mathematics, University of Melbourne, Parkville, Victoria
Leon S. Sterling
Affiliation:
Department of Mathematics, Institute of Advanced Studies, Australian National University, Canberra
Get access Rights & Permissions [Opens in a new window]

Synopsis

All the Fibonacci groups in the family F(2, n) have been either fully identified or determined to be infinite, bar one, namely F(2, 9). Using computer-aided techniques it is shown that F(2, 9) has a quotient of order 152.5741, and an explicit matrix representation for a quotient of order 152.518 is given. This strongly suggests that F(2, 9) is infinite, but no proof of such a claim is available.

Type
Research Article
Information
Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 83 , Issue 3-4 , 1979 , pp. 199 - 203
Copyright
Copyright © Royal Society of Edinburgh 1979

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1Brunner, A. M.. The determination of Fibonacci groups. Bull. Austral. Math. Soc. 11 (1974), 11–14.CrossRefGoogle Scholar
2Cannon, J. J.. A draft description of the group theory language Cayley. SYMSAC 76, 66–84 (Proc. ACM Sympos. Symbolic and Algebraic Computation, New York, 1976. Association for Computing Machinery, New York, 1976).Google Scholar
3Cannon, J. J., Dimino, L. A., Havas, G. and Watson, J. M.. Implementation and analysis of the Todd-Coxeter Algorithm. Math. Comput. 27 (1973), 463–490.CrossRefGoogle Scholar
4Chalk, C. P. and Johnson, D. L.. The Fibonacci groups. II. Proc. Roy. Soc. Edinburgh Sect. A 77 (1977), 79–86.CrossRefGoogle Scholar
5Conway, J. H.. Advanced problem 5327. Amer. Math. Monthly 72 (1965), 915.Google Scholar
6Fein, B.. Representations of direct products of finite groups. Pacific J. Math. 20 (1967), 45–58.CrossRefGoogle Scholar
7Havas, G.. A Reidemeister-Schreier program. Proc. Second Internat. Conf. Theory of Groups, Australian Nat. Univ., Canberra, 1973, 347–356 Lecture Notes in Mathematics 372 (Berlin: Springer, 1974).Google Scholar
8Havas, G.. Computer aided determination of a Fibonacci group. Bull. Austral. Math. Soc. 15 (1976), 297–305.CrossRefGoogle Scholar
9Havas, G. and Sterling, L. S.. Integer matrices and abelian groups. EUROSAM 79. Lecture Notes in Computer Science (Berlin: Springer), to appear.Google Scholar
10Johnson, D. L., Wamsley, J. W. and Wright, D.. The Fibonacci groups. Proc. London Math. Soc. 29 (1974), 577–592.CrossRefGoogle Scholar
11Miller, G. A.. The groups generated by three operators each of which is the product of the other two. Bull. Amer. Math. Soc. 13 (1907), 381–382.CrossRefGoogle Scholar
12Newman, M. F.. Calculating presentations for certain kinds of quotient groups. SYMSAC 76, 2–8 (Proc. ACM Sympos. Symbolic and Algebraic Computation, New York, 1976. Association for Computing Machinery, New York, 1976).Google Scholar