GROUPS WITH A GIVEN NUMBER OF NONPOWER SUBGROUPS

No group has exactly one or two nonpower subgroups. We classify groups containing exactly three nonpower subgroups and show that there is a unique finite group with exactly four nonpower subgroups. Finally, we show that given any integer k greater than $4$ , there are infinitely many groups with exactly k nonpower subgroups.

Cohomology of complements of toric arrangements associated with root systems

We develop an algorithm for computing the cohomology of complements of toric arrangements. In the case a finite group $$\Gamma $$ Γ is acting on the arrangement, the algorithm determines the cohomology groups as representations of $$\Gamma $$ Γ . As an important application, we determine the cohomology groups of the complements of the toric arrangements associated with root systems of exceptional type as representations of the corresponding Weyl groups.

Subgroup Graphs of Finite Groups

Let G be a fnite group with the set of subgroups of G denoted by S(G), then the subgroup graphs of G denoted by T(G) is a graph which set of vertices is S(G) such that two vertices H, K in S(G) (H not equal to K)are adjacent if either H is a subgroup of K or K is a subgroup of H. In this paper, we introduce the Subgroup graphs T associated with G. We investigate some algebraic properties and combinatorial structures of Subgroup graph T(G) and obtain that the subgroup graph T(G) of G is never bipartite. Further, we show isomorphism and homomorphism of the Subgroup graphs of finite groups. Let be a finite group with the set of subgroups of denoted by , then the subgroup graphs of denoted by is a graph which set of vertices is such that two vertices , are adjacent if either is a subgroup of or is a subgroup of . In this paper, we introduce the Subgroup graphs associated with . We investigate some algebraic properties and combinatorial structures of Subgroup graph and obtain that the subgroup graph of is never bipartite. Further, we show isomorphism and homomorphism of the Subgroup graphs of finite groups.

The Intersection Graph of Subgroups of the Dihedral Group of Order 2pq

For a finite group G, the intersection graph of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph of subgroups of the dihedral group for distinct primes . We also find the mean distance of the graph .

Structure of intersection graphs

<p style="text-align: left;" dir="ltr"> Let <em>G</em> be a finite group and let <em>N</em> be a fixed normal subgroup of <em>G</em>. In this paper, a new kind of graph on <em>G</em>, namely the intersection graph is defined and studied. We use <img src="/public/site/images/ikhsan/equation.png" alt="" width="6" height="4" /> to denote this graph, with its vertices are all normal subgroups of <em>G</em> and two distinct vertices are adjacent if their intersection in <em>N</em>. We show some properties of this graph. For instance, the intersection graph is a simple connected with diameter at most two. Furthermore we give the graph structure of <img src="/public/site/images/ikhsan/equation_(1).png" alt="" width="6" height="4" /> for some finite groups such as the symmetric, dihedral, special linear group, quaternion and cyclic groups. </p>

Equivariant K-stability under finite group action

We show that [Formula: see text]-equivariant K-semistability (respectively, [Formula: see text]-equivariant K-polystability) implies K-semistability (respectively, K-polystability) for log Fano pairs with klt singularities when [Formula: see text] is a finite group.

The sub-class sizes of some elements being square free

Let [Formula: see text] be an element of a finite group [Formula: see text], and [Formula: see text] a prime factor of the order of [Formula: see text]. It is clear that there always exists a unique minimal subnormal subgroup containing [Formula: see text], say [Formula: see text]. We call the conjugacy class of [Formula: see text] in [Formula: see text] the sub-class of [Formula: see text] in [Formula: see text], see [G. Qian and Y. Yang, On sub-class sizes of finite groups, J. Aust. Math. Soc. (2020) 402–411]. In this paper, assume that [Formula: see text] is the product of the subgroups [Formula: see text] and [Formula: see text], we investigate the solvability, [Formula: see text]-nilpotence and supersolvability of the group [Formula: see text] under the condition that the sub-class sizes of prime power order elements in [Formula: see text] are [Formula: see text] free, [Formula: see text] free and square free, respectively, so that some known results relevant to conjugacy class sizes are generalized.

Finite groups with given systems of generalised σ-permutable subgroups

Let σ = {σi|i ∈ I } be a partition of the set of all primes ℙ and G be a finite group. A set ℋ of subgroups of G is said to be a complete Hall σ-set of G if every member ≠1 of ℋ is a Hall σi-subgroup of G for some i ∈ I and ℋ contains exactly one Hall σi-subgroup of G for every i such that σi ⌒ π(G) ≠ ∅. A group is said to be σ-primary if it is a finite σi-group for some i. A subgroup A of G is said to be: σ-permutable in G if G possesses a complete Hall σ-set ℋ such that AH x = H xA for all H ∈ ℋ and all x ∈ G; σ-subnormal in G if there is a subgroup chain A = A0 ≤ A1 ≤ … ≤ At = G such that either Ai − 1 ⊴ Ai or Ai /(Ai − 1)Ai is σ-primary for all i = 1, …, t; 𝔄-normal in G if every chief factor of G between AG and AG is cyclic. We say that a subgroup H of G is: (i) partially σ-permutable in G if there are a 𝔄-normal subgroup A and a σ-permutable subgroup B of G such that H = < A, B >; (ii) (𝔄, σ)-embedded in G if there are a partially σ-permutable subgroup S and a σ-subnormal subgroup T of G such that G = HT and H ∩ T ≤ S ≤ H. We study G assuming that some subgroups of G are partially σ-permutable or (𝔄, σ)-embedded in G. Some known results are generalised.