Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-24T03:28:52.459Z Has data issue: false hasContentIssue false
  • English
  • Français

The Fibonacci groups. II

Published online by Cambridge University Press:  14 February 2012

C. P. Chalk  and
D. L. Johnson
C. P. Chalk
Affiliation:
University of East Anglia, Norwich
D. L. Johnson
Affiliation:
University of Nottingham
Get access Rights & Permissions [Opens in a new window]

Synopsis

Since the appearance of the article [15] to which this is a sequel, considerable progress has been made in the study of the groups F(r, n) of the title. It is therefore our intention to give a brief account of these developments before proceeding to our main theme, which is to apply the elegant and powerful methods of small cancellation theory to these groups. This has a variety of consequences, perhaps the most important of which is the generalisation to arbitrary r of Lyndon's proof that F(2, n) is infinite for n ≧ 11.

Type
Research Article
Information
Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 77 , Issue 1-2 , 1977 , pp. 79 - 86
Copyright
Copyright © Royal Society of Edinburgh 1977

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

1Arrhenius-Wold, Anna-LisaFinite groups with two generators satisfying the relation BA = A2B2 (Stockholm: Almqvist and Wiksell, 1971).Google Scholar
2Brunner, A. M.The determination of Fibonacci groups. Bull. Austral. Math. Soc. 11 (1974), 11–14.CrossRefGoogle Scholar
3Brunner, A. M. On groups of Fibonacci type. Proc. Edinburgh Math. Soc., to appear.Google Scholar
4Campbell, C. M. and Robertson, E. F.A note on Fibonacci-type groups. Canad. Math. Bull. 18 (1975), 173–175.CrossRefGoogle Scholar
5Campbell, C. M. and Robertson, E. F.The orders of certain metacyclic groups. Bull. London Math. Soc. 6 (1974), 312–314.CrossRefGoogle Scholar
6Campbell, C. M. and Robertson, E. F.On metacyclic Fibonacci groups. Proc. Edinburgh Math. Soc. 19 (1975), 253–256.CrossRefGoogle Scholar
7Campbell, C. M. and Robertson, E. F.Applications of the Todd-Coxeter algorithm to generalised Fibonacci groups. Proc. Roy. Soc. Edinburgh Sect. A 73 (1974), 163–166.CrossRefGoogle Scholar
8Campbell, C. M. and Robertson, E. F.On a class of finitely-presented groups of Fibonacci type. J. London Math. Soc. 11 (1975), 249–255.CrossRefGoogle Scholar
9Chalk, C. P. Small cancellation theory over the Fibonacci groups (Univ. of East Anglia Ph.D. Thesis, 1976).Google Scholar
10Johnson, D. L.A note on the Fibonacci groups. Israel J. Math. 17 (1974), 277–282.CrossRefGoogle Scholar
11Johnson, D. L.Extensions of Fibonacci groups. Bull. London Math. Soc. 7 (1974), 101–104.CrossRefGoogle Scholar
12Johnson, D. L. Some group extensions. Israel J. Math., submitted for publication.Google Scholar
13Johnson, D. L.Some infinite Fibonacci groups. Proc. Edinburgh Math. Soc. 19 (1975), 311–314.CrossRefGoogle Scholar
14Johnson, D. L.Presentations of groups (Cambridge: University Press, 1975).Google Scholar
15Johnson, D. L., Wamsley, J. W. and Wright, D.The Fibonacci groups. Proc. London Math. Soc. 29 (1974), 577–592.CrossRefGoogle Scholar
16van Kampen, E. R.On some lemmas in the theory of groups. Amer. J. Math. 55 (1933), 268–273.CrossRefGoogle Scholar
17Lyndon, R. C.On Dehn's algorithm. Math. Ann. 166 (1966), 208–228.CrossRefGoogle Scholar
18Magnus, W., Karrass, A. and Solitar, D.Combinatorial group theory (New York: Interscience, 1966).Google Scholar
19Miller, G. A.Groups generated by n operators each of which is the product of the n–1 remaining ones. Amer. J. Math. 30 (1908), 93–98.CrossRefGoogle Scholar
20Netto, E.Gruppen- und Substitutionentheorie (Leipzig: Göschen, 1908).Google Scholar
21Smith, H. Groups of cyclic presentation. J. Austral. Math. Soc., submitted for publication.Google Scholar
22Tench, R. N. Some computational problems in Group Theory (Nottingham Univ: Ph.D. Thesis, 1976).Google Scholar