This book provides the first representation theoretic and algorithmic approach to the theory of abstract finite simple groups. It presents self-contained proofs of classical and new group order formulas, and a new structure theorem for abstract finite simple groups. This, and the famous Brauer-Fowler theorem, provides the theoretical background for the author's algorithm which constructs all finite simple groups G having a 2-central involution z with a given centralizer CG(z)=H. The methods presented are designed for the construction of matrix representations, permutation representations and character tables of large finite groups. The author constructs all the simple satellites of the known simple groups that are not uniquely determined by a given centralizer H. Uniform existence and uniqueness proofs are given for the modern sporadic simple groups discovered by Janko, Higman and Sims, Harada, and Thompson. This latter result proves a long standing open problem in the theory. The experimental results (courtesy of M. Weller) for Chapter 12 are documented in the accompanying DVD.
评分
评分
评分
评分
本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度,google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈图书下载中心 版权所有