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

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

A characterization of finite simple groups by the orders of solvable subgroups

Let G be a finite group and S be a finite simple group. In this paper, we prove that if G and S have the same sets of all orders of solvable subgroups, then G is isomorphic to S, or G and S are isomorphic to Bn(q), Cn(q), where n≥3 and q is odd. This gives a positive answer to the problem put forward by Abe and Iiyori.     

Finite groups in which elements of the same order outside the center are conjugate

We prove that if G is a finite group in which the elements of the same order outside the center are conjugate,then either G is abelian or G(?)S_3.     

Normal Cayley graphs of finite groups

LetG be a finite group and let S be a nonempty subset of G not containing the identity element 1. The Cayley (di) graph X = Cay(G, S) of G with respect to S is defined byV (X)=G, E (X)={(g,sg)|g∈G, s∈S} A Cayley (di) graph X = Cay (G,S) is said to be normal ifR(G) ◃A = Aut (X). A group G is said to have a normal Cayley (di) graph if G has a subset S such that the Cayley (di) graph X = Cay (G, S) is normal. It is proved that every finite group G has a normal Cayley graph unlessG≅ℤ₄×ℤ₂ orG≅Q ₈×ℤ ₂ ^r (r⩾0) and that every finite group has a normal Cayley digraph, where Z_m is the cyclic group of orderm and Q₈ is the quaternion group of order 8. Project supported by the National Natural Science Foundation of China (Grant No. 10231060) and the Doctorial Program Foundation of Institutions of Higher Education of China.     

The largest lengths of conjugacy classes and the Sylow subgroups of finite groups

Let G be a finite nonabelian group, P ∈Syl_p(G), and bcl(G) the largest length of conjugacy classes of G. In this short paper, we prove that in general and |P/O_p(G)| < bcl(G) in the case where P is abelian. Received: 26 December 2004; revised: 26 January 2005     

On Hua-Tuan’s conjecture

Let G be a finite group and |G| = pn, p be a prime. For 0 m n, sm(G) denotes the number of subgroups of of order pm of G. Loo-Keng Hua and Hsio-Fu Tuan have ever conjectured: for an arbitrary finite p-group G, if p > 2, then sm(G) ≡ 1, 1 + p, 1 + p + p2 or 1 + p + 2p2 (mod p3). In this paper, we investigate the conjecture, and give some p-groups in which the conjecture holds and some examples in which the conjecture does not hold.     

Structure of augmentation quotients of finite homocyclic abelian groups

Let G be a finite abelian group and its Sylow p-subgroup a direct product of copies of a cyclic group of order p~r,i.e.,a finite homocyclic abelian group.LetΔ~n (G) denote the n-th power of the augmentation idealΔ(G) of the integral group ring ZG.The paper gives an explicit structure of the consecutive quotient group Q_n(G)=Δ~n(G)/Δ~(n 1)(G) for any natural number n and as a consequence settles a problem of Karpilovsky for this particular class of finite abelian groups.     

On finite groups whose derived subgroup has bounded rank

Let G be a finite group with derived subgroup of rank r. We prove that |G: Z ₂(G)| ≤ |G′|^2r . Motivated by the results of I. M. Isaacs in [5] we show that if G is capable then |G: Z(G)| ≤ |G′|^4r . This answers a question of L. Pyber. We prove that if G is a capable p-group then the rank of G/Z(G) is bounded above in terms of the rank of G′.     

Finite 2-generator equilibrated p-groups

Following Blackburn, Deaconescu and Mann, a group G is called an equilibrated group if for any subgroups H,K of G with HK = KH, either H≤NG(K) or K≤NG(H). Continuing their work and based on the classification of metacyclic p-groups given by Newman and Xu, we give a complete classification of 2-generator equilibrated p-groups in this note.     

Adjacent strong edge colorings and total colorings of regular graphs

It is conjectured that χas(G) = χt(G) for every k-regular graph G with no C5 component (k 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (|V (G)| - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles.     

The finite simple groups with at most two fusion classes of every order

Elements a,b of a group G are said to be fused if a = b^σ and to be inverse-fused if a =(b^-1)^σ for some σ ? Aut(G). The fusion class of a ? G is the set {a^σ | σ ? Aut(G)}, and it is called a fusion class of order i if a has order iThis paper gives a complete classification of the finite nonabelian simple groups G for which either (i) or (ii) holds, where:

(i) G has at most two fusion classes of order i for every i (23 examples); and

(ii) any two elements of G of the same order are fused or inversenfused.

The examples in case (ii) are: A₅, A₆,L₂(7),L₂(8), L₃(4), Sz(8), M₁₁ and M₂₃An application is given concerning isomorphisms of Cay ley graphs.     

Finite isometry groups of 4-manifolds with positive sectional curvature

Let M be an oriented compact Riemannian 4-manifold with positive sectional curvature. Let G be a finite subgroup of the isometry group of M. We prove that, if G is a finite group of order , then

Weinberg bounds over nonspherical graphs

Let Aut(G) and E(G) denote the automorphism group and the edge set of a graph G, respectively. Weinberg's Theorem states that 4 is a constant sharp upper bound on the ratio |Aut(G)|/|E(G)| over planar (or spherical) 3‐connected graphs G. We have obtained various analogues of this theorem for nonspherical graphs, introducing two Weinberg‐type bounds for an arbitrary closed surface Σ, namely: where supremum is taken over the polyhedral graphs G with respect to Σ for W_P(Σ) and over the graphs G triangulating Σ for W_T(Σ). We have proved that Weinberg bounds are finite for any surface; in particular: W_P = W_T = 48 for the projective plane, and W_T = 240 for the torus. We have also proved that the original Weinberg bound of 4 holds over the graphs G triangulating the projective plane with at least 8 vertices and, in general, for the graphs of sufficiently large order triangulating a fixed closed surface Σ. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 220–236, 2000     

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.     

Representations of deformed preprojective algebras and quantum groups

Let (Γ,I) be the bound quiver of a cyclic quiver whose vertices correspond to the Abelian group Zd. In this paper, we list all indecomposable representations of (Γ,I) and give the conditions that those representations of them can be extended to representations of deformed preprojective algebra Πλ(Γ,I). It is shown that those representations given by extending indecomposable representations of (Γ,I) are all simple representations of Πλ(Γ,I). Therefore, it is concluded that all simple representa-tions of rest...     

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.     

Quasirecognition by the set of element orders of the groups E 6( q ) and 2 E 6( q )

We prove that if L is one of the simple groups E ₆(q) and ² E ₆(q) and G is some finite group with the same spectrum as L, then the commutant of G/F(G) is isomorphic to L and the quotient G/G′ is a cyclic {2,3}-group. Original Russian Text Copyright ? 2007 Kondrat’ev A. S. The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00463) and the RFBR-NSFC (Grant 05-01-39000). __________ Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 48, No. 6, pp. 1250–1271, November–December, 2007.     

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.     

Criteria for the solubility of finite groups by their centralizers

For any group G, let C(G){\mathcal{C}(G)} denote the set of centralizers of G. We say that a group G has n centralizers (G is a C_n{\mathcal{C}_n}-group) if |C(G)| = n{|\mathcal{C}(G)| = n}. In this note, we show that the derived length of a soluble C_n{\mathcal{C}_n}-group (not necessarily finite) is bounded by a function of n.