BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 54 definitions for Conway.

Conway group

Print-Friendly
About 3 pages (936 words)

Bookmark and Share Questions on this topic? Just ask!

In mathematics, the Conway groups Co1, Co2, and Co3 are three sporadic groups discovered by John Horton Conway. Thomas Thompson relates how John Leech about 1964 investigated close packings of spheres in Euclidean spaces of large dimension. One of Leech's discoveries was a lattice packing in 24-space, based on what came to be called the Leech lattice Λ. He wondered whether his lattice's symmetry group contained an interesting simple group, but felt he needed the help of someone better acquainted with group theory. He had to do much asking around because the mathematicians were pre-occupied with agendas of their own. John Conway agreed to look at the problem. John G. Thompson said he would be interested if he were given the order of the group. Conway expected to spend months or years on the problem, but found results in just a few sessions. The largest of the Conway groups, Co1, of order

4,157,776,806,543,360,000,

is obtained as the quotient of Co0 (automorphism group of Λ) by its center, which consists of the scalar matrices ±1. The groups Co2 (of order 42,305,421,312,000) and Co3 (of order 495,766,656,000) consist of the automorphisms of Λ fixing a lattice vector of type 2 and a vector of type 3 respectively. (The type of a vector is half of its square norm, vˑv.) As the scalar −1 fixes no non-zero vector, we can regard these two groups as subgroups of Co1.

Contents

Other sporadic groups

Conway and Thompson found that 4 recently discovered sporadic simple groups were isomorphic to subgroups or quotients of subgroups of Co1. The groups Co2 and Co3 both contain the McLaughlin group McL (of order 898,128,000) and the Higman-Sims group (of order 44,352,000), which can be described as the pointwise stabilizers of a type

2-2-3 triangle

and a type

2-3-3 triangle,

respectively. Identifying R24 with C12 and Λ with

Z[ei/3]12,

the resulting automorphism group, i.e., the group of Leech lattice automorphisms preserving the complex structure, when divided by the 6-element group of complex scalar matrices, gives the Suzuki group Suz (of order 448,345,497,600). Suz is the only proper sporadic subgroup of Co1 that retains 13 as a prime factor. This group was discovered by Michio Suzuki in 1968. A similar construction gives the Hall-Janko group J2 (of order 604,800) as the quotient of the group of quaternionic automorphisms of Λ by the group ±1 of scalars. The 7 simple groups described above comprise what Robert Griess calls the second generation of the Happy Family, which consists of the 20 sporadic simple groups found within the Monster group. Several of the 7 groups contain at least some of the 5 Mathieu groups, which comprise the first generation. There was a conference on group theory held May 2-4, 1968, at Harvard University. Richard Brauer and Chih-Han Shah later published a book of its proceedings. It included important lectures on four groups of the second generation, but was a little too early to include the Conway groups. It has on the other hand been observed that if Conway had started a few years earlier, he could have discovered all 7 groups. Conway's work unified a number of rabbit trails into one system.

An important maximal subgroup of Co0

Conway started his investigation with a subgroup called N. The Leech lattice is defined by use of the binary Golay code, whose automorphism group is the Mathieu group M24. Let E be a multiplicative representation of this code, a group of diagonal 24-by-24 matrices whose diagonal elements equal 1 or -1. E is an abelian group of type 212. Define N as the holomorph E:M24. Conway found that N is a maximal subgroup of Co0 and contains 2-Sylow subgroups of Co0. He used N to deduce the order of Co0. The negative of the identity is in E and commutes with every 24-by-24 matrix. Then Co1 has a maximal subgroup with structure 211:M24.

Other subgroups

Co1 has at least 22 conjugacy classes of maximal subgroups. Co1 contains non-abelian simple groups of some 35 isomorphism types, as subgroups or as quotients of subgroups. One alternating group represented is A9.

References

  • Conway, J. H.: A perfect group of order 8,315,553,613,086,720,000 and the sporadic simple groups, Proc. Nat. Acad. Sci. U.S.A. 61 (1968), 398-400.
  • Richard Brauer and Chih-Han Shah, Theory of Finite Groups: A Symposium, W. A. Benjamin (1969)
  • Conway, J. H.: Three lectures on exceptional groups, in Finite Simple Groups, M. B. Powell and G. Higman (editors), Academic Press, (1971), 215-247. Reprinted in J. H. Conway & N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer (1988), 267-298.
  • Thompson, Thomas M.: From Error Correcting Codes through Sphere Packings to Simple Groups, Carus Mathematical Monographs, Mathematical Association of America (1983).
  • Conway, J. H.; Curtis, R. T.; Norton, S. P.; Parker, R. A.; Wilson, R. A., Atlas of finite groups. Maximal subgroups and ordinary characters for simple groups. With computational assistance from J. G. Thackray. Eynsham: Oxford University Press (1985), ISBN 0-19-853199-0
  • Griess, Robert L.: Twelve Sporadic Groups, Springer-Verlag (1998).
  • Atlas of Finite Group Representations: Co1

View More Summaries on Conway group
 
Ask any question on Conway group and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Conway group from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy