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]

References

1. ^ Stillwell, John (2002), Mathematics and its history, Springer, p. 374, ISBN 978-0-38795336-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, pp. 234, ISBN 978-0-38790749-9 

This algebra-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Algebra stubs Combinatorial group theory Wikimedia Foundation. 2010. Игры ⚽ Поможем написать курсовую Enumerative combinatorics Combinatorial map Look at other dictionaries: Group theory — is a mathematical discipline, the part of abstract algebra that studies the algebraic structures known as groups. The development of group theory sprang from three main sources: number theory, theory of algebraic equations, and geometry. The… …   Wikipedia Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… …   Wikipedia Word (group theory) — In group theory, a word is any written product of group elements and their inverses. For example, if x , y , and z are elements of a group G , then xy , z 1 xzz , and y 1 zxx 1 yz 1 are words in the set { x , y , z }. Words play an important role …   Wikipedia History of group theory — The history of group theory, a mathematical domain studying groups in their various forms, has evolved in various parallel threads. There are three historical roots of group theory: the theory of algebraic equations, number theory and geometry.… …   Wikipedia Group isomorphism problem — In abstract algebra, the group isomorphism problem is the decision problem of determining whether two group presentations present isomorphic groups.The isomorphism problem was identified by Max Dehn in 1911 as one of three fundamental decision… …   Wikipedia Combinatorial hierarchy — is a mathematical structure of bit strings generated by an algorithm based on discrimination (exclusive or between bits). It was originally discovered by A.F. Parker Rhodes in the 1960s, and is interesting because of physical interpretations that …   Wikipedia Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …   Wikipedia Bass–Serre theory — is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated… …   Wikipedia Rank of a group — For the dimension of the Cartan subgroup, see Rank of a Lie group In the mathematical subject of group theory, the rank of a group G , denoted rank( G ), can refer to the smallest cardinality of a generating set for G , that is:… …   Wikipedia Free group — In mathematics, a group G is called free if there is a subset S of G such that any element of G can be written in one and only one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st 1 =… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”