|
7
4
|
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. |
|||
|
|
4
|
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. |
||
|
|
