Forum Problem Lists Definitions FAQ

12.76 (1992)

Solved

Is every group generated by a set of 3-transpositions locally finite? A set of 3-transpositions is, by definition, a normal set of involutions such that the orders of their pairwise products are at most 3.

Contributor: A. I. Sozutov

Progress

Yes, it is (H. Cuypers, J. I. Hall, in: Groups, combinatorics and geometry. Proc. L. M. S. Durham symp., July 5–15, 1990 (London Math. Soc. Lecture Note Ser., 165), Cambridge Univ. Press, 1992, 121–138).

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.