On Solvability of Finite Groups with Few Non-Normal Subgroups

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

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₅.     

Varieties of Algebras without the Amalgamation Property

Let α be an ordinal and κ be a cardinal, both infinite, such that κ ≤ |α|. For τ ∈^αα, let sup(τ) = {i ∈ α: τ(i) ≠ i}. Let G _κ = {τ ∈^αα: |sup(τ)| < κ}. We consider variants of polyadic equality algebras by taking cylindrifications on Γ ? α, |Γ| < κ and substitutions restricted to G _κ. Such algebras are also enriched with generalized diagonal elements. We show that for any variety V containing the class of representable algebas and satisfying a finite schema of equations, V fails to have the amalgamation property. In particular, many varieties of Halmos’ quasi-polyadic equality algebras and Lucas’ extended cylindric algebras (including that of the representable algebras) fail to have the amalgamation property.     

The Primitive Sharp Permutation Groups of Twisted Wreath Type

A permutation group G ≤ Sym(X) on a finite set X is sharp if |G|=∏ _l?L(G)(|X| ? l), where L(G) = {|fix(g)| | 1 ≠ g ? G}. We show that no finite primitive permutation groups of twisted wreath type are sharp.     

Super-π-Brauer Characters and Super-π-Regular Classes

Supercharacter theories for an arbitrary finite group were developed by Diaconis and Isaacs. Let G* denote the set of all π-regular elements of G. Set I^π(G) = {χ* | χ ∈Irr(G) and χ* ≠ α* + β* for characters α, β of G}, where χ* means the restriction of χ to G*. In this paper, we consider the partitions of I^π(G) and G* for a π-separable group G. We obtain some results which generalize those of Diaconis and Isaacs.     

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.     

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.     

Groups with Anticentral Elements

We study finite groups G with elements g such that |C _G (g)| = |G:G′|. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class of nilpotent supplements for the commutator subgroup and, using the classification of finite simple groups, that these groups are solvable.     

Classifying Finite Simple Groups with Respect to the Number of Orbits Under the Action of the Automorphism Group

Abstract

Let ω(G) denote the number of orbits on the finite group G under the action of Aut(G). Using the classification of finite simple groups, we prove that for any positive integer n, there is only a finite number of (non-abelian) finite simple groups G satisfying ω(G) ≤ n. Then we classify all finite simple groups G such that ω(G) ≤ 17. The latter result was obtained by computational means, using the computer algebra system GAP.     

Commutativity Pattern of Finite Non-Abelian p-Groups Determine Their Orders

Let G be a non-abelian group and Z(G) be the center of G. Associate a graph Γ _G (called noncommuting graph of G) with G as follows: Take G?Z(G) as the vertices of Γ _G , and join two distinct vertices x and y, whenever xy ≠ yx. Here, we prove that “the commutativity pattern of a finite non-abelian p-group determine its order among the class of groups"; this means that if P is a finite non-abelian p-group such that Γ _P  ? Γ _H for some group H, then |P| = |H|.     

Commuting Graphs of Group Algebras

The commuting graph of a ring R, denoted by Γ(R), is a graph of all whose vertices are noncentral elements of R, and 2 distinct vertices x and y are adjacent if and only if xy = yx. In this article we investigate some graph-theoretic properties of Γ(kG), where G is a finite group, k is a field, and 0 ≠ |G| ∈k. Among other results it is shown that if G is a finite nonabelian group and k is an algebraically closed field, then Γ(kG) is not connected if and only if |G| = 6 or 8. For an arbitrary field k, we prove that Γ(kG) is connected if G is a nonabelian finite simple group or G′ ≠ G″ and G″ ≠ 1.     

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.     

A Family of Finite Simple Groups Which Are 2-Recognizable by Their Elements Order

Abstract

Let G be a finite group and ω(G) the set of all orders of elements in G. Denote by h(ω(G)) the number of isomorphism classes of finite groups H satisfying ω(H) = ω(G), and put h(G) = h(ω(G)). A group G is called k-recognizable if h(G) = k < ∞ , otherwise G is called non-recognizable. In the present article we will show that the simple groups PSL(3, q), where q ≡ ±2(mod 5) and (6, (q ? 1)/2) = 2, are 2-recognizable. Therefore if q is a prime power and q ≡ 17, 33, 53 or 57 (mod 60), then the groups PSL(3, q) are 2-recognizable. Hence proving the existing of an infinite families of 2-recognizable simple groups.     

On element-centralizers in finite groups

For any group G, let |Cent(G)| denote the number of centralizers of its elements. A group G is called n-centralizer if |Cent(G)| = n. In this paper, we find |Cent(G)| for all minimal simple groups. Using these results we prove that there exist finite simple groups G and H with the property that |Cent(G)| = |Cent(H)| but ${G\not\cong H}$ . This result gives a negative answer to a question raised by A. Ashrafi and B. Taeri. We also characterize all finite semi-simple groups G with |Cent(G)| ≤  73.     

A note on the conjugacy classes of non-cyclic subgroups

Let G be a finite group and δ(G) denote the number of conjugacy classes of all non-cyclic subgroups of G. The symbol π(G) denotes the set of the prime divisors of |G|. In [7 Meng, W., Li, S. R. (2014). Finite groups with few conjugacy classes of non-cyclic subgroups. Scientia Sin. Math. 44:939–944.[Crossref] , [Google Scholar]], Meng and Li showed the inequality δ(G)≥2^|π(G)|?2, where G is non-cyclic solvable group. In this paper, we describe the finite groups G such that δ(G) = 2^|π(G)|?2. Another aim of this paper would show δ(G)≥M(G)+2 for unsolvable groups G and the equality holds ?G?A₅ or SL(2,5), where M(G) denotes the number of conjugacy classes of all maximal subgroups of G.     

Finite Groups with Conjugacy Classes Number One Greater than Its Same Order Classes Number

ABSTRACT

Let k(G) be the number of conjugacy classes of finite groups G and π _e (G) be the set of the orders of elements in G. Then there exists a non-negative integer k such that k(G) = |π _e (G)| + k. We call such groups to be co(k) groups. This article classifies all finite co(1) groups. They are isomorphic to one of the following groups: A ₅, L ₂(7), S ₅, Z ₃, Z ₄, S ₄, A ₄, D ₁₀, Hol(Z ₅), or Z ₃ ? Z ₄.     

Characterization of A5 and SL(2,5) by the number of conjugacy classes of non-cyclic subgroups

For a finite group G, let ν_c(G) denote the number of conjugacy classes of non-normal non-cyclic subgroups of G. We show that for every finite non-solvable group G, ν_c(G) = |π(G)|+1 if and only if G?A₅, the alternating group on 5 letters, or SL(2,5).     

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.     

Coleman Automorphisms of Permutational Wreath Products

Let N be a finite nontrivial nilpotent group and H a finite centerless permutation group on a finite set Ω (i.e., H acts faithfully on Ω). Let G = N?H = N^|Ω| ? H be the corresponding permutational wreath product of N by H. It is shown that every Coleman automorphism of G is an inner automorphism. This generalizes a well-known result due to Petit Lobão and Sehgal stating that the normalizer property holds for complete monomial groups with nilpotent base groups.