MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Are there any nice discussions of applications of small cancellation theory, or other cases of the word problem, in applied mathematics or algorithms for seemingly non-group theoretic problems?

I suppose two candidates are Anshel–Anshel–Goldfeld key exchange and braid group based cryptography.

share|cite|improve this question
Jeff, I got your email and replied. If you do not get my reply, please let me know, here I guess. I made this a "favorite" question, I will automatically be able to find this. – Will Jagy Sep 26 '11 at 4:44

The group-based cryptography is a very active area now. There are books and a special journal.

As another application, one can reformulate the problem P=NP as "Is it true that every finitely presented group with polynomial Dehn function has word problem solvable deterministically in polynomial time?" (see this paper).

Small cancelation itself is not used much in any of these areas, but many ideas are inspired by the classical small cancelation theory.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.