Handbook of computational group theory
著者
書誌事項
Handbook of computational group theory
(Discrete mathematics and its applications / Kenneth H. Rosen, series editor)(A Chapman & Hall book)
CRC Press, 2020, c2005
- : pbk
大学図書館所蔵 全3件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. 471-496) and indexes
内容説明・目次
内容説明
The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics.
The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors' primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity.
Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life.
目次
Group Theoretical Preliminaries. History of Computational Group Theory (CGT) and Its Place Within Computational Algebra. Methods of Representing Groups on a Computer. Base and Strong Generating Set Methods in Finite Permutation and Matrix Groups. Coset Enumeration. Computation in Finite Nilpotent and Solvable Groups. Representation Theory, Character Theory, and Cohomology. Algorithms Based on the Normal Structure of Finite Groups. Libraries and Databases of Groups. The Matrix Group Recognition Project. Special Techniques for Computing with Very Large Groups and Their Representations. Quotient Algorithms for Finitely Presented Groups. Rewriting Systems and the Knuth-Bendix Completion Process. Automatic Groups (Methods Involving Finite State Automata)
「Nielsen BookData」 より