Generating finite 3-transposition groups

3Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.
Get full text

Abstract

By a result of Cuypers and Hall, any finitely generated 3-transposition group is finite. For each finite 3-transposition group we find the minimum number of 3-transpositions needed for generation. As a consequence we classify the central types of all 3-transposition groups generated by at most six of their 3-transpositions, confirming earlier results of Fischer, Zara, Hall, and Soicher on groups generated by at most five 3-transpositions. We also prove that for every r the order of a 3-transposition group generated by r of its 3-transpositions is bounded above by an explicit function of r. In particular, the number of such r-generated 3-transposition groups is finite.

Author supplied keywords

Cite

CITATION STYLE

APA

Hall, J. I. (2022). Generating finite 3-transposition groups. Journal of Algebra, 607, 338–371. https://doi.org/10.1016/j.jalgebra.2022.03.032

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free