Math 2.0

Group theory and generalizations Infinite groups and combinatorial group theory Concept

Small cancellation theory

Summary

Small cancellation theory studies groups given by presentations whose relators have only short common pieces. Under such conditions, such as C′(1/6)C'(1/6), a nontrivial word equal to the identity must contain a long part of some relator. This gives Dehn's algorithm for the word problem, and finitely presented C′(1/6)C'(1/6) groups are hyperbolic. The theory is also a tool to build groups with unusual properties, as in the construction of Tarski monster groups.

Further reading

  1. Web https://en.wikipedia.org/wiki/Small_cancellation_theory
About this page
Tag3A1D37TVF6
URIm2://3A1D37TVF6
Kindconcept
WritingW0 stub
MSC20F06, 20F05
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions