Finite Groups Whose Second Maximal Subgroups are ℋ-QC-Subgroups

A group G is called an “?-QC-group” if for any element x of order 2 or 4 of G, ?x? ?y? = ?y? ?x? for all y in G. In this article, we investigate the structure of the groups G of the title. Suppose that G is non-2-closed and non-2-nilpotent, then it turns out that such a group is either S ₄ or a uniquely determined group of order 48 or A ₅ or SL(2,5). The corresponding problem for G 2-closed or 2-nilpotent is open but very difficult.     

On Certain Weak Engel-Type Conditions in Groups

Let w(x, y) be a word in two variables and 𝔚 the variety determined by w. In this paper we raise the following question: if for every pair of elements a, b in a group G there exists g ∈ G such that w(a ^g , b) = 1, under what conditions does the group G belong to 𝔚? In particular, we consider the n-Engel word w(x, y) = [x, _n y]. We show that in this case the property is satisfied when the group G is metabelian. If n = 2, then we extend this result to the class of all solvable groups.     

On finite groups with non-subnormal subgroups

For a finite group G, let n(G) denote the number of conjugacy classes of non-subnormal subgroups of G. In this paper, we show that a finite group G satisfying n(G)≤2|π(G)| is solvable, and for a finite non-solvable group G, n(G) = 2|π(G)|+1 if and only if G?A₅.     

Some Results on p-Nilpotence and Supersolvability of Finite Groups

Let G be a finite group. A subgroup K of a group G is called an ?-subgroup of G if N _G (K) ∩ K ^x  ≦ K for all x ? G. The set of all ?-subgroups of G will be denoted by ?(G). Let P be a nontrivial p-group. A chain of subgroups 1 = P ₀ ? P ₁ ? ··· ? P _n  = P is called a maximal chain of P provided that |P _i : P _i?1| = p, i = 1, 2, ···, n. A nontrivial p-subgroup P of G is called weakly supersolvably embedded in G if P has a maximal chain 1 = P ₀ ? P ₁ ? ··· ? P _i  ? ··· ? P _n  = P such that P _i  ? ?(G) for i = 1, 2, ···, n. Using the concept of weakly supersolvably embedded, we obtain new characterizations of p-nilpotent and supersolvable finite groups.     

Non-Nilpotent Graph of a Group

We associate a graph 𝒩 _G with a group G (called the non-nilpotent graph of G) as follows: take G as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this article, we study the graph theoretical properties of 𝒩 _G and its induced subgraph on G \ nil(G), where nil(G) = {x ∈ G | ? x, y ? is nilpotent for all y ∈ G}. For any finite group G, we prove that 𝒩 _G has either |Z*(G)| or |Z*(G)| +1 connected components, where Z*(G) is the hypercenter of G. We give a new characterization for finite nilpotent groups in terms of the non-nilpotent graph. In fact, we prove that a finite group G is nilpotent if and only if the set of vertex degrees of 𝒩 _G has at most two elements.     

On Finite n-Acentralizer Groups

Let G be a group and Aut(G) be the group of automorphisms of G. Then the Acentralizer of an automorphism α ∈Aut(G) in G is defined as C _G (α) = {g ∈ G∣α(g) = g}. For a finite group G, let Acent(G) = {C _G (α)∣α ∈Aut(G)}. Then for any natural number n, we say that G is n-Acentralizer group if |Acent(G)| =n. We show that for any natural number n, there exists a finite n-Acentralizer group and determine the structure of finite n-Acentralizer groups for n ≤ 5.     

Characterization of 3-Rewritable Finite Nilpotent Groups

Let n be an integer greater than 1. A group G is said to be “ n-rewritable” whenever for every n elements x ₁,…,x _n of G, there exist distinct permutations τ, σ on the set {1,2,…, n} such that x _τ(1) ··· x _τ(n) = x _{σ (1)} ··· x _{σ (n)}. In this article, we complete the classification of 3-rewritable finite nilpotent groups and prove that a finite nilpotent group G is 3-rewritable if and only if G has an abelian subgroup of index 2 or the derived subgroup has order < 6.     

On Residually Finite Groups with Engel-like Conditions

Let m, n be positive integers. Suppose that G is a residually finite group in which for every element x ∈ G there exists a positive integer q = q(x) ≤ m such that x^q is left n-Engel. We show that G is locally virtually nilpotent. Further, let w be a multilinear commutator and G a residually finite group in which for every product of at most 896 w-values x there exists a positive integer q = q(x) dividing m such that x^q is left n-Engel. Then w(G) is locally virtually nilpotent.     

On Infinite Camina Groups

A group G is called a Camina group if G′ ≠ G and each element x ∈ G?G′ satisfies the equation x ^G  = xG′, where x ^G denotes the conjugacy class of x in G. Finite Camina groups were introduced by Alan Camina in 1978, and they had been studied since then by many authors. In this article, we start the study of infinite Camina groups. In particular, we characterize infinite Camina groups with a finite G′ (see Theorem 3.1) and we show that infinite non-abelian finitely generated Camina groups must be nonsolvable (see Theorem 4.3). We also describe locally finite Camina groups, residually finite Camina groups (see Section 3) and some periodic solvable Camina groups (see Section 5).     

A Symmetric Presentation for J 1

Abstract

We give a computer-free proof that the sporadic simple group J ₁ is a isomorphic to the progenitor 2*⁵ : A ₅ factorized over a single relation. Precisely, we prove that J ₁ is defined by the presentation ?x, y, t ∣ x ⁵ = y ³ = (xy)² = 1 = t ² = [y, t] = [y, t ^{x 3} ] = (xt)⁷?.     

Noncyclic Graph of a Group

We associate a graph Γ _G to a nonlocally cyclic group G (called the noncyclic graph of G) as follows: take G\ Cyc(G) as vertex set, where Cyc(G) = {x ? G| 〈x, y〉 is cyclic for all y ? G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of Γ _G is finite if and only if Γ _G has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with Γ _G  ? Γ _H and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose noncyclic graphs are “unique”, i.e., if Γ _G  ? Γ _H for some group H, then G ? H. In view of these examples, we conjecture that every finite nonabelian simple group has a unique noncyclic graph. Also we give some examples of finite noncyclic groups G with the property that if Γ _G  ? Γ _H for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite noncyclic groups.     

Commuting graphs of groups and related numerical parameters

Given a finite group G, we denote by Δ(G) the commuting graph of G which is defined as follows: the vertex set is G and two distinct vertices x and y are joined by an edge if and only if xy = yx. Clearly, Δ(G) is always connected for any group G. We denote by κ(G) the number of spanning trees of Δ(G). In the present paper, among other results, we first obtain the value κ(G) for some specific groups G, such as Frobenius groups, Dihedral groups, AC-groups, etc. Next, we characterize the alternating group A₅, in the class of nonsolvable groups through its tree-number κ(A₅). Finally, we classify the finite groups for which the power graph and the commuting graph coincide.     

On the Genus of the Nilpotent Graphs of Finite Groups

The nilpotent graph of a group G is a simple graph whose vertex set is G?nil(G), where nil(G) = {y ∈ G | ? x, y ? is nilpotent ? x ∈ G}, and two distinct vertices x and y are adjacent if ? x, y ? is nilpotent. In this article, we show that the collection of finite non-nilpotent groups whose nilpotent graphs have the same genus is finite, derive explicit formulas for the genus of the nilpotent graphs of some well-known classes of finite non-nilpotent groups, and determine all finite non-nilpotent groups whose nilpotent graphs are planar or toroidal.     

Weak Cayley Table Groups II: Alternating Groups and Finite Coxeter Groups

A weak Cayley table isomorphism is a bijection φ: G → H of groups such that φ(xy) ～ φ(x)φ(y) for all x, y ∈ G. Here ～denotes conjugacy. When G = H the set of all weak Cayley table isomorphisms φ: G → G forms a group 𝒲(G) that contains the automorphism group Aut(G) and the inverse map I: G → G, x → x ^?1. Let 𝒲₀(G) = ?Aut(G), I? ≤ 𝒲(G) and say that G has trivial weak Cayley table group if 𝒲(G) = 𝒲₀(G). We show that all finite irreducible Coxeter groups (except possibly E ₈) have trivial weak Cayley table group, as well as most alternating groups. We also consider some sporadic simple groups.     

On a Commuting Graph on Conjugacy Classes of Groups

We consider the graph Γ(G), associated with the conjugacy classes of a group G. Its vertices are the nontrivial conjugacy classes of G, and we join two different classes C, D, whenever there exist x ∈ G and y ∈ D such that xy = yx. The aim of this article is twofold. First, we investigate which graphs can occur in various contexts and second, given a graph Γ(G) associated with G, we investigate the possible structure of G. We proved that if G is a periodic solvable group, then Γ(G) has at most two components, each of diameter at most 9. If G is any locally finite group, then Γ(G) has at most 6 components, each of diameter at most 19. Finally, we investigated periodic groups G with Γ(G) satisfying one of the following properties: (i) no edges exist between noncentral conjugacy classes, and (ii) no edges exist between infinite conjugacy classes. In particular, we showed that the only nonabelian groups satisfying (i) are the three finite groups of order 6 and 8.     

On Finite Groups with Few Automorphism Orbits

Denote by ω(G) the number of orbits of the action of Aut(G) on the finite group G. We prove that if G is a finite nonsolvable group in which ω(G) ≤5, then G is isomorphic to one of the groups A₅, A₆, PSL(2, 7), or PSL(2, 8). We also consider the case when ω(G) = 6 and show that, if G is a nonsolvable finite group with ω(G) = 6, then either G ≈ PSL(3, 4) or there exists a characteristic elementary abelian 2-subgroup N of G such that G/N ≈ A₅.     

Finite Groups all of Whose Second Maximal Subgroups are QTI-Subgroups

A subgroup H of a finite group G is called a QTI-subgroup if C _G (x) ≤ N _G (H) for any 1 ≠ x ∈ H. In this article, the finite groups all of whose second maximal subgroup are QTI-subgroups are classified.     

A New Characterization of A 10 by its Noncommuting Graph

Let G be a nonabelian group and associate a noncommuting graph ?(G) with G as follows: The vertex set of ?(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In 1987, Professor J. G. Thompson gave the following conjecture.

Thompson's Conjecture. If G is a finite group with Z(G) = 1 and M is a nonabelian simple group satisfying N(G) = N(M), then G ? M, where N(G):={n ∈ ? | G has a conjugacy class of size n}.

In 2006, A. Abdollahi, S. Akbari, and H. R. Maimani put forward a conjecture (AAM's conjecture) in Abdollahi et al. (2006) as follows.

AAM's Conjecture. Let M be a finite nonabelian simple group and G a group such that ?(G) ? ? (M). Then G ? M.

In this short article we prove that if G is a finite group with ?(G) ? ? (A ₁₀), then G ? A ₁₀, where A ₁₀ is the alternating group of degree 10.     

Non-Commuting Graphs of Nilpotent Groups

Let G be a non-abelian group and Z(G) be the center of G. The non-commuting graph Γ _G associated to G is the graph whose vertex set is G?Z(G) and two distinct elements x, y are adjacent if and only if xy ≠ yx. We prove that if G and H are non-abelian nilpotent groups with irregular isomorphic non-commuting graphs, then |G| = |H|.