nLab combinatorial group theory

Combinatorial group theory is an approach to the theory of discrete groups based on presentations of groups, that is describing the groups by generators and relations. Despite the apparent simplicity of the idea at first look, some of the most basic problems of combinatorial group theory are difficult and unsolvable in general; for example S.P. Novikov and collaborators proved the existence of a group for which the word problem, that is the question of equality modulo the relations of elements given by generators, is algorithmically undecidable; in other words there is a presentation of this group such that no algorithm can take as an input two arbitrary words and decide in finite time if they represent the same element of the group.

While sometimes the presentation method is used in the theory of finite groups, most often not very deep facts are used; instead finite group theory is rather dominated with interaction with representation theory, ring theory, group cohomology and so on. Typical groups for which combinatorial methods give deep results are infinite discrete groups which are close in some sense to free groups, e.g. groups with a presentation having only one relation. Such groups often make their appearance as fundamental groups of interesting topological spaces. (Of course, all discrete groups can be realised as fundamental groups of spaces, so the exchange is two way.)

Nowadays combinatorial group theory uses fruitful connections to topology and graph theory: for example, the consequences if some group can be realized say as a fundamental group of a space in a nice way, or acts on a topological space are widely explored. They are apt to invite topological / geometric methods. In fact there is a hybrid field, geometric group theory (see also English Wikipedia).


Textbook accounts:

Last revised on February 3, 2023 at 08:01:00. See the history of this page for a list of all contributions to it.