This is a coherent explanation for the existence of the 26 known
sporadic simple groups originally arising from many unrelated
contexts. The given proofs build on the close relations between
general group theory, ordinary character theory, modular
representation theory and algorithmic algebra described in the
first volume. The author presents a new algorithm by which 25
sporadic simple groups can be constructed (the smallest Mathieu
group M11 can be omitted for theoretical reasons), and demonstrates
that it is not restricted to sporadic simple groups. He also
describes the constructions of various groups and proves their
uniqueness whenever possible. The computational existence proofs
are documented in the accompanying DVD. The author also states
several open problems related to the theorem asserting that there
are exactly 26 groups, and R. Brauer's warning that there may be
infinitely many. Some of these problems require new experiments
with the author's algorithm.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!