Presentations of groups

D.L. Johnson

The aim of this book is to provide an introduction to combinatorial group theory. Any reader who has completed first courses in linear algebra, group theory and ring theory will find this book accessible. The emphasis is on computational techniques but rigorous proofs of all theorems are supplied. This new edition has been revised throughout, including new exercises and an additional chapter on proving that certain groups are infinite.

「Nielsen BookData」より

[目次]

  • 1. Free groups
  • 2. Schreier's method
  • 3. Nielsen's method
  • 4. Free presentations of groups
  • 5. Some popular groups
  • 6. Finitely generated groups
  • 7. Finite groups with few relations
  • 8. Coset enumeration
  • 9. Presentations of subgroups
  • 10. Presentations of group extensions
  • 11. Relation models
  • 12. An algorithm for N/N'
  • 13. Finite p-groups
  • 14. The nilpotent quotient algorithm
  • 15. The Golod-Shafarevich theorem
  • 16. Fibonacci update.

「Nielsen BookData」より

この本の情報

書名 Presentations of groups
著作者等 Johnson, D. L.
Bruce, J. W.
シリーズ名 London Mathematical Society student texts
出版元 Cambridge University Press
刊行年月 1997
版表示 2nd ed
ページ数 x, 216 p.
大きさ 23 cm
ISBN 0521585422
NCID BA32239199
※クリックでCiNii Booksを表示
言語 英語
出版国 イギリス
この本を: 
このエントリーをはてなブックマークに追加

このページを印刷

外部サイトで検索

この本と繋がる本を検索

ウィキペディアから連想