| 書目名稱 | Fundamental Algorithms for Permutation Groups | | 編輯 | G. Butler | | 視頻video | http://file.papertrans.cn/350/349919/349919.mp4 | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | This is the first-ever book on computational group theory.It providesextensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groups,and p-groups where appropriate.The book begins with aconstructive introduction to grouptheory and algorithms for computing with small groups,followed by a gradual discussion of the basic ideas ofSimsfor computing with very large permutation groups, andconcludeswith algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly described,examples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material onhomomorphisms, Sylowsubgroups, and soluble permutation groups is new. | | 出版日期 | Book 1991 | | 關(guān)鍵詞 | Algebraic Algorithms; Algebraische Algorithmen; Computational Complexity; Computational Group Theory; Gr | | 版次 | 1 | | doi | https://doi.org/10.1007/3-540-54955-2 | | isbn_softcover | 978-3-540-54955-0 | | isbn_ebook | 978-3-540-46607-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 1991 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 04:22
發(fā)表于 2025-3-21 20:01:35
