Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Combinatorial group theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
In [[mathematics]], '''combinatorial group theory''' is the theory of [[free group]]s, and the concept of a [[presentation of a group]] by [[generator (mathematics)|generators]] and [[relation (mathematics)|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]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)