Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-29T19:27:10.288Z Has data issue: false hasContentIssue false

A uniqueness lemma for groups generated by 3-transpositions

Published online by Cambridge University Press:  24 October 2008

Richard Weiss
Affiliation:
Department of Mathematics, Tufts University, Medford, MA 02155, U.S.A.

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
Copyright
Copyright © Cambridge Philosophical Society 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

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