Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout.
Popis produktu
Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.
543543
Samozrejme! Môžete mi prosím poskytnúť viac informácií o podkategórii 543543 a jej charakteristikách? Aké produkty alebo služby zahŕňa, aké sú jej výhody a aké publikum by malo byť cieľom? Tieto detaily by mi pomohli vytvoriť presnejší a relevantnejší popis.