
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
In the mathematical field of group theory, the monster group M or F1 (also known as the Fischer–Griess monster, or the Friendly Giant) is a group of finite order.It is a simple group, meaning it does not have any proper nontrivial normal subgroups (that is, the only nontrivial normal subgroup is M itself).
The finite simple groups have been completely classified (see the Classification of finite simple groups). The list of finite simple groups consists of 18 countably infinite families, plus 26 sporadic groups that do not follow such a systematic pattern. The monster group is the largest of these sporadic groups and contains all but six of the other sporadic groups as subquotients. Robert Griess has called these six exceptions pariahs, and refers to the others as the happy family.The monster group is one of two principal constituents in the Monstrous moonshine conjecture by Conway and Norton, which relates discrete and nondiscrete mathematics and was finally proved by Richard Borcherds in 1992.
In this setting, the monster group is visible as the automorphism group of the monster module, a vertex operator algebra, an infinite dimensional algebra containing the Griess algebra, and acts on the monster Lie algebra, a generalized Kac–Moody algebra.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment