Y-groups via Transitive Extension
โ Scribed by A.A Ivanov
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 188 KB
- Volume
- 218
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
โฆ Synopsis
Motivated by an earlier observation by J. H. Fischer, around 1980 B. Conway conjectured that the Coxeter diagram Y on Fig. 1 together with a single 555 ลฝ . ลฝ . 10 additional so-called ''spider'' relation ab c ab c ab c s 1 form a presenta-1 1 2 2 3 3
tion for the wreath product of the Monster group M and a group of order 2. This conjecture was proved by S. P. Norton and the author in 1990. The original proof was rather involved, relying on simple connectedness results for certain diagram geometries, on numerous data obtained by coset enumeration on a computer, and on some delicate calculations with subgroups coming from the 26-node theorem. In the present work we follow an inductive approach to the identification of Y-groups by considering larger Y-groups as transitive extensions of smaller ones. Along these lines we obtain an alternative identification proof for the Y-groups which is almost ลฝ . computer-free: we refer to only one result of double coset enumeration. Our approach provides a uniform understanding of the Y-groups, particularly of features such as centres and redundant generators.
๐ SIMILAR VOLUMES
this paper is dedicated to helmut wielandt on the occasion of his 90th birthday Let A be a transitive subgroup of S n . We show that the largest cyclic quotient of A has order at most n. This can be interpreted as an equivalent result about extensions of constants in the Galois closure of a coverin