Skip to main content Accessibility help

A uniqueness lemma for groups generated by 3-transpositions

  • Richard Weiss (a1)

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

Hide All
[1]Aschbacher, M.. A homomorphism theorem for finite graphs. Proc. Amer. Math. Soc. 54 (1976), 468470.
[2]Blass, A.. Graphs with unique maximal clumpings. J. Graph. Theory 2 (1978), 1924.
[3]Danielson, S., Guterman, M. and Weiss, R.. On Fischer's characterizations of Σ5 and Σn. Comm. Algebra 11 (1983), 15011510.
[4]Fischer, B.. Finite groups generated by 3-transpositions. Invent. Math. 13 (1971), 232246, and University of Warwick Lecture Notes. (Unpublished.)
[5]Griess, B.. The friendly giant. Invent. Math. 69 (1982), 1102.
[6]Parrott, D.. Characterizations of the Fischer groups I, II, III. Trans. Amer. Math. Soc. 265 (1981), 303347.
[7]Weiss, B.. On Fischer's characterization of Spεn(2) and Un(2). Comm. Algebra 11 (1983), 25272554.
[8]Weiss, R.. 3-transpositions in infinite groups. Math. Proc. Cambridge Philos. Soc. 96 (1984), 371377.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Proceedings of the Cambridge Philosophical Society
  • ISSN: 0305-0041
  • EISSN: 1469-8064
  • URL: /core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed