Open AccessBook
Algebra IV: Infinite Groups, Linear Groups
Alexei Ivanovich Kostrikin,Igorʹ Rostislavovich Shafarevich +1 more
- 01 Jan 1993
3
TL;DR: The Encyclopaedia of groups is devoted to two important subjects within group theory as mentioned in this paper. The first part of the book is concerned with infinite groups and the second part treats the theory of linear groups, and the topics covered include classical groups, algebraic groups, topological methods, conjugacy theorems, and finite linear groups.
read more
Abstract: Group theory is one of the most fundamental branches of mathematics. This volume of the Encyclopaedia is devoted to two important subjects within group theory. The first part of the book is concerned with infinite groups. The authors deal with combinatorial group theory, free constructions through group actions on trees, algorithmic problems, periodic groups and the Burnside problem, and the structure theory for Abelian, soluble and nilpotent groups. They have included the very latest developments; however, the material is accessible to readers familiar with the basic concepts of algebra. The second part treats the theory of linear groups. It is a genuinely encyclopaedic survey written for non-specialists. The topics covered includethe classical groups, algebraic groups, topological methods, conjugacy theorems, and finite linear groups. This book will be very useful to allmathematicians, physicists and other scientists including graduate students who use group theory in their work.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Chromatic number and clique number of subgraphs of regular graph of matrix algebras
TL;DR: In this article, it was shown that the chromatic number of a soluble subgroup of GL n (F ) is finite for any algebraically closed field F, where A > denotes the subgroup generated by A ∈ GL n(F ).
16
•Posted Content
On the Dimension of Matrix Representations of Finitely Generated Torsion Free Nilpotent Groups
TL;DR: In this paper, the complexity of the algorithm and the dimension of the matrices produced were determined and a modification of the original algorithm presented by Nickel was presented, which was later extended to the case of polycyclic groups.
1
Decision problems for groups and semigroups
TL;DR: A detailed survey of results concerning the main decision problems of group theory and semigroup theory, including the word problem, the isomorphism problem, recognition problems, and other algorithmic questions related to them can be found in this paper.