The finite <Emphasis Type="Italic">p</Emphasis>-groups with <Emphasis Type="Italic">p</Emphasis> conjugacy classes of non-normal subgroups

Let ν(G) be the number of conjugacy classes of non-normal subgroups of a finite group G. The finite groups for which ν(G) ≤ 2 were determined by Dedekind and by Schmidt in the early times of group theory. On the other hand, if G is a finite p-group, La Haye and Rhemtulla have proved that either ν(G) ≤ 1 or ν(G) ≥ p. In this note, we determine all finite p-groups satisfying ν(G) = p for p > 2.     

2-Recognizability by prime graph of <Emphasis Type="Italic">PSL</Emphasis>(2, <Emphasis Type="Italic">p</Emphasis><Superscript>2</Superscript>)

Let G be a finite group and let Γ(G) be the prime graph of G. Assume p prime. We determine the finite groups G such that Γ(G) = Γ(PSL(2, p ²)) and prove that if p ≠ 2, 3, 7 is a prime then k(Γ(PSL(2, p ²))) = 2. We infer that if G is a finite group satisfying |G| = |PSL(2, p ²)| and Γ(G) = Γ(PSL(2, p ²)) then G ? PSL(2, p ²). This enables us to give new proofs for some theorems; e.g., a conjecture of W. Shi and J. Bi. Some applications are also considered of this result to the problem of recognition of finite groups by element orders.     

On semisymmetric cubic graphs of order 6p~2

A graph r is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Г) acting transitively on its edge set but not on its vertex set. In the case of G. = A, we call r a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p.     

A note on <Emphasis Type="Italic">p</Emphasis>-groups of order ≤ <Emphasis Type="Italic">p</Emphasis><Superscript>4</Superscript>

In [1], we defined c(G), q(G) and p(G). In this paper we will show that if G is a p-group, where p is an odd prime and |G| ≤ p ⁴, then c(G) = q(G) = p(G). However, the question of whether or not there is a p-group G with strict inequality c(G) = q(G) < p(G) is still open.     

On automorphisms of some finite <Emphasis Type="Italic">p</Emphasis>-groups

We give a sufficient condition on a finite p-group G of nilpotency class 2 so that Aut _c (G) = Inn(G), where Aut _c (G) and Inn(G) denote the group of all class preserving automorphisms and inner automorphisms of G respectively. Next we prove that if G and H are two isoclinic finite groups (in the sense of P. Hall), then Aut _c (G) ≃ Aut _c (H). Finally we study class preserving automorphisms of groups of order p ⁵, p an odd prime and prove that Aut _c (G) = Inn(G) for all the groups G of order p ⁵ except two isoclinism families.     

Schur multiplicators of infinite pro-<Emphasis Type="Italic">p</Emphasis>-groups with finite coclass

Let G be an infinite pro-p-group of finite coclass and let M(G) be its Schur multiplicator. For p > 2, we determine the isomorphism type of Hom(M(G), ℤ_p), where ℤ_p denotes the p-adic integers, and show that M(G) is infinite. For p = 2, we investigate the Schur multiplicators of the infinite pro-2-groups of small coclass and show that M(G) can be infinite, finite or even trivial.     

Finite solvable groups in which the Sylow <Emphasis Type="Italic">p</Emphasis>-subgroups are either bicyclic or of order <Emphasis Type="Italic">p</Emphasis><Superscript>3</Superscript>

All groups considered in this paper will be finite. Our main result here is the following theorem. Let G be a solvable group in which the Sylow p-subgroups are either bicyclic or of order p ³ for any p ∈ π(G). Then the derived length of G is at most 6. In particular, if G is an A₄-free group, then the following statements are true: (1) G is a dispersive group; (2) if no prime q ∈ π(G) divides p ² + p + 1 for any prime p ∈ π(G), then G is Ore dispersive; (3) the derived length of G is at most 4.     

Omega subgroups of powerful <Emphasis Type="Italic">p</Emphasis>-groups

Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all i ≥ 0: (i) exp Ω_i(G) ≤ p ⁱ for odd p, and expΩ_i(G) ≤ 2 ⁱ⁺¹ for p = 2; (ii) the index |G: G ^{p i}| coincides with the number of elements of G of order at most p ⁱ. Supported by the Spanish Ministry of Science and Education, grant MTM2004-04665, partly with FEDER funds, and by the University of the Basque Country, grant UPV05/99.     

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.     

A necessary condition for non-abelian finite <Emphasis Type="Italic">p</Emphasis>-groups with second centre of order <Emphasis Type="Italic">p</Emphasis><Superscript>2</Superscript>

Let G be a non-abelian finite p-group such that |Z ₂(G)| = p ². In this paper we prove that each maximal subgroup M ≠ C _G (Z ₂(G)) is non-abelian and has cyclic centre.     

On <Emphasis Type="Italic">r</Emphasis>-recognition by prime graph of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(3) where <Emphasis Type="Italic">p</Emphasis> is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then \({G\cong B_p(3)}\) or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then \({G\cong B_3(3), C_3(3), D_4(3)}\), or \({G/O_2(G)\cong {\rm Aut}(^2B_2(8))}\). As a corollary, the main result of the above paper is obtained.     

Torsion completeness of <Emphasis Type="Italic">p</Emphasis>-primary components in modular group rings of <Emphasis Type="Italic">p</Emphasis>-reduced Abelian groups

Let G be a p-reduced Abelian group and R a commutative unital ring of prime characteristic p such that for each natural number i the subring $ R^{p^i } $ R^{p^i } has nilpotent elements. It is shown that if S(RG) is the normalized Sylow p-group in the group ring RG, then S(RG) is torsion-complete if and only if G is a bounded p-group. This strengthens our former results on this subject.     

An <Emphasis Type="Italic">s</Emphasis>-Hamiltonian Line Graph Problem

For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman proposed an open problem: for a given positive integer k, determine the value s for which the statement “Let G be a k-triangular graph. Then L(G), the line graph of G, is s-hamiltonian if and only L(G) is (s + 2)-connected” is valid. Broersma and Veldman proved in 1987 that the statement above holds for 0 ≤ s ≤ k and asked, specifically, if the statement holds when s = 2k. In this paper, we prove that the statement above holds for 0 ≤ s ≤ max{2k, 6k − 16}.     

Littlewood–Paley theorem on spaces <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">t</Emphasis>)</Superscript>(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

We point out that if the Hardy–Littlewood maximal operator is bounded on the space L ^p(t)(ℝ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ, then the well-known characterization of the spaces L ^p (ℝ), 1 < p < ∞, by the Littlewood–Paley theory extends to the space L ^p(t)(ℝ). We show that, for n > 1 , the Littlewood–Paley operator is bounded on L ^p(t) (ℝ ⁿ ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ ⁿ , if and only if p(t) = const. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 12, pp. 1709–1715, December, 2008.     

On <Emphasis Type="Italic">k</Emphasis>-pairable graphs from trees

The concept of the k-pairable graphs was introduced by Zhibo Chen (On k-pairable graphs, Discrete Mathematics 287 (2004), 11–15) as an extension of hypercubes and graphs with an antipodal isomorphism. In the same paper, Chen also introduced a new graph parameter p(G), called the pair length of a graph G, as the maximum k such that G is k-pairable and p(G) = 0 if G is not k-pairable for any positive integer k. In this paper, we answer the two open questions raised by Chen in the case that the graphs involved are restricted to be trees. That is, we characterize the trees G with p(G) = 1 and prove that p(G □ H) = p(G) + p(H) when both G and H are trees.     

Quasirecognition by prime graph of the simple group <Superscript>2</Superscript><Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>)

As the main result, we show that if G is a finite group such that Γ(G) = Γ(² F ₄(q)), where q = 2^2m+1 for some m ≧ 1, then G has a unique nonabelian composition factor isomorphic to ² F ₄(q). We also show that if G is a finite group satisfying |G| =|² F ₄(q)| and Γ(G) = Γ(² F ₄(q)), then G ≅ ² F ₄(q). As a consequence of our result we give a new proof for a conjecture of W. Shi and J. Bi for ² F ₄(q). The third author was supported in part by a grant from IPM (No. 87200022).     

The commuting graphs of some subsets in the quaternion algebra over the ring of integers modulo <Emphasis Type="Italic">N</Emphasis>

Let R be an arbitrary ring, S be a subset of R, and Z(S) = {s ∈ S | sx = xs for every x ∈ S}. The commuting graph of S, denoted by Γ(S), is the graph with vertex set S \ Z(S) such that two different vertices x and y are adjacent if and only if xy = yx. In this paper, let I _n , N _n be the sets of all idempotents, nilpotent elements in the quaternion algebra ℤ _n [i, j, k], respectively. We completely determine Γ(I _n ) and Γ(N _n ). Moreover, it is proved that for n ≥ 2, Γ(I _n ) is connected if and only if n has at least two odd prime factors, while Γ(N _n ) is connected if and only if n ∈ 2, 2², p, 2p for all odd primes p.     

<Emphasis Type="Italic">f</Emphasis>-Colorings of some graphs of <Emphasis Type="Italic">f</Emphasis>-class 1

An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v V（G） at most f（v） times. The minimum number of colors needed to f-color G is called the f-chromatic index of G and is denoted by X′f（G）. Any simple graph G has the f-chromatic index equal to △f（G） or △f（G） ＋ 1, where △f（G） =max v V（G）{[d（v）/f（v）]}. If X′f（G） = △f（G）, then G is of f-class 1; otherwise G is of f-class 2. In this paper, a class of graphs of f-class 1 are obtained by a constructive proof. As a result, f-colorings of these graphs with △f（G） colors are given.     

On r-recognition by prime graph of Bp(3) where p is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then G @ B_p(3){G\cong B_p(3)} or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then G @ B₃(3), C₃(3), D₄(3){G\cong B_3(3), C_3(3), D_4(3)}, or G/O₂(G) @ Aut(²B₂(8)){G/O_2(G)\cong {\rm Aut}(^2B_2(8))}. As a corollary, the main result of the above paper is obtained.