Searcharxiv⌕ Search

arXiv · 2610.14689

Sylow $2$-Subgroups of Finite Groups with a Single Conjugacy Class of Involutions

Abstract

We solve Brauer's Problem 33 by determining the finite $2$-groups that occur as Sylow $2$-subgroups of finite groups with a single conjugacy class of involutions. Besides the Sylow $2$-subgroups arising from the relevant non-abelian simple groups in Table 1, these are precisely the homocyclic, generalized quaternion, and Suzuki $2$-groups. The classification of finite simple groups is used in this paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tianze Li, Yu Zeng. 2026-10-10. Sylow $2$-Subgroups of Finite Groups with a Single Conjugacy Class of Involutions. https://searcharxiv.com/abs/2610.14689

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗