Combinatorial group theory

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.

History

See (Chandler & Magnus 1982) 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.[1]

gollark: And yes, technically stars have used wavelet transforms since about 2002.
gollark: I mean a star image.
gollark: Good, since I didn't explain it.
gollark: You can Fourier-transform images. I have a bunch of things using that.
gollark: Idea: invert the Fourier transform of a star to generate an unstar.

References
  1. Stillwell, John (2002), Mathematics and its history, Springer, p. 374, ISBN 978-0-387-95336-6
  • Chandler, B.; Magnus, Wilhelm (December 1, 1982), The History of Combinatorial Group Theory: A Case Study in the History of Ideas, Studies in the History of Mathematics and Physical Sciences (1st ed.), Springer, p. 234, ISBN 978-0-387-90749-9
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.