2014/12/14 by Mohammad Zarrin, Zarrin, Mohammad
Engineering · Mathematics · #20D60 #20F99 #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Rings, Modules, and Algebras #graph theory and CDMA systems #math.GR #msc:20D60 #msc:20F99
paper · pdf · doi:10.48550/arxiv.1412.4349
5 pages, to appear, Group Theory, 2015
arxiv created 2014/12/14 · openalex publication_date 2014/12/14 · arxiv updated 2014/12/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A subset X of a group G is a set of pairwise non-commuting ele- ments if ab 6= ba for any two distinct elements a and b in X. If jXj ? jY j for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements and the cardinality of such a subset is denoted by !(G). In this paper, among other thing, we prove that, for each positive integer n, there are only finitely many groups G, up to isoclinic, with !(G) = n (with exactly n centralizers).