Finite Groups With a Certain Number of Elements Pairwise Generating a Non-Nilpotent Subgroup

finite groups with a certain number of elements pairwise generating a non-nilpotent subgroup

Finite Groups with a Certain Number of Elements Pairwise Generating a Non-nilpotent Subgroup

Let n > 0 be an integer and X be a class of groups. We say that a group G satisfies the condition (X , n) whenever in every subset with n + 1 elements of G there exist distinct elements x, y such that 〈x, y〉 is in X . Let N and A be the classes of nilpotent groups and abelian groups, respectively. Here we prove that: (1) If G is a finite semi-simple group satisfying the condition (N , n), then ...

Relative non-Normal Graphs of a Subgroup of Finite Groups

Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...

Maximal subsets of pairwise non-commuting elements of some finite p-groups

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= 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 in any non-abelian...

Irredundant Generating Sets of Finite Nilpotent Groups

It is a standard fact of linear algebra that all bases of a vector space have the same cardinality, namely the dimension of the vector space over its base field. If we treat a vector space as an additive abelian group, then this is equivalent to saying that an irredundant generating set for a vector space must have cardinality equal to the dimension of the vector space. The same is not true for...

Finite Groups With a Certain Number of Cyclic Subgroups

In this short note we describe the finite groups G having |G| − 1 cyclic subgroups. This leads to a nice characterization of the symmetric group S3. In subgroup lattice theory, it is a usual technique to associate to a finite group G some posets of subgroups of G (see, e.g., [4]). One such poset is the poset of cyclic subgroups of G, usually denoted by C(G). Notice that there are few papers on ...