Summary
In mathematics, combinatorial group theory is the theory of free groups, and the concept of a presentation of a group by generators and relations. It is much used in geometric topology, the fundamental group of a simplicial complex having in a natural and geometric way such a presentation. A very closely related topic is geometric group theory, which today largely subsumes combinatorial group theory, using techniques from outside combinatorics besides. It also comprises a number of algorithmically insoluble problems, most notably the word problem for groups; and the classical Burnside problem. See for a detailed history of combinatorial group theory. A proto-form is found in the 1856 icosian calculus of William Rowan Hamilton, where he studied the icosahedral symmetry group via the edge graph of the dodecahedron. The foundations of combinatorial group theory were laid by Walther von Dyck, student of Felix Klein, in the early 1880s, who gave the first systematic study of groups by generators and relations.
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (2)
Combinatorial Group Theory
Introduces combinatorial group theory, emphasizing group presentations, normal subgroups, and group quotients.
Show more
Related publications (2)
Related concepts (8)
Hyperbolic group
In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a word hyperbolic group or Gromov hyperbolic group, is a finitely generated group equipped with a word metric satisfying certain properties abstracted from classical hyperbolic geometry. The notion of a hyperbolic group was introduced and developed by . The inspiration came from various existing mathematical theories: hyperbolic geometry but also low-dimensional topology (in particular the results of Max Dehn concerning the fundamental group of a hyperbolic Riemann surface, and more complex phenomena in three-dimensional topology), and combinatorial group theory.
Presentation of a group
In mathematics, a presentation is one method of specifying a group. A presentation of a group G comprises a set S of generators—so that every element of the group can be written as a product of powers of some of these generators—and a set R of relations among those generators. We then say G has presentation Informally, G has the above presentation if it is the "freest group" generated by S subject only to the relations R. Formally, the group G is said to have the above presentation if it is isomorphic to the quotient of a free group on S by the normal subgroup generated by the relations R.
Word problem for groups
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group G is the algorithmic problem of deciding whether two words in the generators represent the same element. More precisely, if A is a finite set of generators for G then the word problem is the membership problem for the formal language of all words in A and a formal set of inverses that map to the identity under the natural map from the free monoid with involution on A to the group G.
Show more