Maximal subset of pairwise non-commuting elements of finite minimal non-Abelian groups
classification
🧮 math.GR
keywords
elementsnon-commutingpairwisesubsetmaximalfinitegroupsminimal
read the original abstract
Let G be a group. A subset X of G is a set of pairwise non-commuting elements if xy is not equal to yx for any two distinct elements x and y in X. If |X|>=|Y| 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. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements for finite minimal non-abelian groups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.