Small Cancellation Theory - History

History

Some ideas underlying the small cancellation theory go back to the work of Max Dehn in 1910s. Dehn proved that fundamental groups of closed orientable surfaces of genus at least two have word problem solvable by what is now called Dehn's algorithm. His proof involved drawing the Cayley graph of such a group in the hyperbolic plane and performing curvature estimates via the Gauss-Bonnet theorem for a closed loop in the Cayley graph to conclude that such a loop must contain a large portion (more than a half) of a defining relation.

A 1949 paper of Tartakovskii was an immediate precursor for small cancellation theory: this paper provided a solution of the word problem for a class of groups satisfying a complicated set of combinatorial conditions, where small cancellation type assumptions played a key role. The standard version of small cancellation theory, as it is used today, was developed by Martin Greendlinger in a series of papers in early 1960s, who primarily dealt with the "metric" small cancellation conditions. In particular, Greendlinger proved that finitely presented groups satisfying the C'(1/6) small cancellation condition have word problem solvable by Dehn's algorithm. The theory was further refined and formalized in the subsequent work of Lyndon, Schupp and Lyndon-Schupp, who also treated the case of non-metric small cancellation conditions and developed a version of small cancellation theory for amalgamated free products and HNN-extensions.

Small cancellation theory was further generalized by Alexander Ol'shanskii who developed a "graded" version of the theory where the set of defining relations comes equipped with a filtration and where a defining relator of a particular grade is allowed to have a large overlap with a defining relator of a higher grade. Olshaskii used graded small cancellation theory to construct various "monster" groups, including the Tarski monster and also to give a new proof that free Burnside groups of large odd exponent are infinite (this result was originally proved by Adian and Novikov in 1968 using more combinatorial methods).

Small cancellation theory supplied a basic set of examples and ideas for the theory of word-hyperbolic groups that was put forward by Gromov in a seminal 1987 monograph "Hyperbolic groups".

Read more about this topic:  Small Cancellation Theory

Famous quotes containing the word history:

    If you look at history you’ll find that no state has been so plagued by its rulers as when power has fallen into the hands of some dabbler in philosophy or literary addict.
    Desiderius Erasmus (c. 1466–1536)

    This above all makes history useful and desirable: it unfolds before our eyes a glorious record of exemplary actions.
    Titus Livius (Livy)

    We are told that men protect us; that they are generous, even chivalric in their protection. Gentlemen, if your protectors were women, and they took all your property and your children, and paid you half as much for your work, though as well or better done than your own, would you think much of the chivalry which permitted you to sit in street-cars and picked up your pocket- handkerchief?
    Mary B. Clay, U.S. suffragist. As quoted in History of Woman Suffrage, vol. 4, ch. 3, by Susan B. Anthony and Ida Husted Harper (1902)