A uniqueness lemma for groups generated by 3-transpositions
Published online by Cambridge University Press: 24 October 2008
Extract
Let G be a group. A subset D of G will be called a set of 3-transpositions if |x| =2 for all xεD and |xy| = 3 whenever x, yεD do not commute. We will call the set D closed if xDx = D for each xεD. For each xεD, let
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 97 , Issue 3 , May 1985 , pp. 421 - 431
- Copyright
- Copyright © Cambridge Philosophical Society 1985
References
REFERENCES
- 6
- Cited by