On finite groups with exactly seven element centralizers

For a finite groupG, #Cent(G) denotes the number of centralizers of its elements. A groupG is calledn-centralizer if #Cent(G) =n, and primitive n-centralizer if $\# Cent(G) = \# Cent\left( {\frac{G}{{Z(G)}}} \right) = n$ . The first author in [1], characterized the primitive 6-centralizer finite groups. In this paper we continue this problem and characterize the primitive 7-centralizer finite groups. We prove that a finite groupG is primitive 7-centralizer if and only if $\frac{G}{{Z(G)}} \cong D_{10} $ orR, whereR is the semidirect product of a cyclic group of order 5 by a cyclic group of order 4 acting faithfully. Also, we compute#Cent(G) for some finite groups, using the structure ofG modulu its center.     

On Finite Groups with a Given Number of Centralizers

For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A₄, the alternating group on four letters. Also, we prove that, if G/Z(G) A₄, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A₄ and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07     

Counting the centralizers of some finite groups

For a finite groupG, #Cent(G) denotes the number of centralizers of its elements. A groupG is called n-centralizer if #Cent(G) =n, and primitiven-centralizer if # Cent(G)\text = # Cent\text(\fracGZ(G))\text = n\# Cent(G){\text{ = \# }}Cent{\text{(}}\frac{G}{{Z(G)}}){\text{ = }}n. In this paper we compute the number of distinct centralizers of some finite groups and investigate the structure of finite groups with exactly six distinct centralizers. We prove that ifG is a 6-centralizer group then % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaSaaaeaaca% WGhbaabaGaamOwaiaacIcacaWGhbGaaiykaaaacaqGGaGaeyyrIaKa% aeiiaGqaciaa-readaWgaaWcbaGaa8hoaaqabaGccaGGSaGaaeiiai% aa-feadaWgaaWcbaGaa8hnaaqabaGccaGGSaGaaeiiaiaabQfadaWg% aaWcbaGaaeOmaaqabaGccaqGGaGaey41aqRaaeiiaiaabQfadaWgaa% WcbaGaaeOmaaqabaGccaqGGaGaey41aqRaaeiiaiaabQfadaWgaaWc% baGaaeOmaaqabaGccaqGGaGaae4BaiaabkhacaqGGaGaaeOwamaaBa% aaleaacaqGYaaabeaakiaabccacqGHxdaTcaqGGaGaaeOwamaaBaaa% leaacaqGYaaabeaakiaabccacqGHxdaTcaqGGaGaaeOwamaaBaaale% aacaqGYaaabeaakiaabccacqGHxdaTcaqGGaGaaeOwamaaBaaaleaa% caqGYaaabeaaaaa!62C4!\[\frac{G}{{Z(G)}}{\text{ }} \cong {\text{ }}D_8 ,{\text{ }}A_4 ,{\text{ Z}}_{\text{2}} {\text{ }} \times {\text{ Z}}_{\text{2}} {\text{ }} \times {\text{ Z}}_{\text{2}} {\text{ or Z}}_{\text{2}} {\text{ }} \times {\text{ Z}}_{\text{2}} {\text{ }} \times {\text{ Z}}_{\text{2}} {\text{ }} \times {\text{ Z}}_{\text{2}} \] .     

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.     

9中心化子群的结构

记#Cent（G）为群G的所有互不相同的元素的中心化子个数．如果#Cent（G）=礼,则称G为n中心化子群．本文给出了9中心化子群的结构．     

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.     

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

Finite generation of iterated wreath products

Let (G _n , X _n ) be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product ${\ldots\wr G_2\wr G_1}Let (G _n , X _n ) be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product ?\wr G₂\wr G₁{\ldots\wr G_2\wr G_1} is topologically finitely generated if and only if the profinite abelian group ?_{n 3 1} G_n/G￠_n{\prod_{n\geq 1} G_n/G'_n} is topologically finitely generated. As a corollary, for a finite transitive group G the minimal number of generators of the wreath power G\wr ?\wr G\wr G{G\wr \ldots\wr G\wr G} (n times) is bounded if G is perfect, and grows linearly if G is non-perfect. As a by-product we construct a finitely generated branch group, which has maximal subgroups of infinite index.     

On finite groups whose every proper normal subgroup is a union of a given number of conjugacy classes

Let G be a finite group andA be a normal subgroup ofG. We denote by ncc(A) the number ofG-conjugacy classes ofA andA is calledn-decomposable, if ncc(A)= n. SetK _G = {ncc(A)|A ⊲ G}. LetX be a non-empty subset of positive integers. A groupG is calledX-decomposable, ifK _G =X. Ashrafi and his co-authors [1-5] have characterized theX-decomposable non-perfect finite groups forX = {1, n} andn ≤ 10. In this paper, we continue this problem and investigate the structure ofX-decomposable non-perfect finite groups, forX = {1, 2, 3}. We prove that such a group is isomorphic to Z₆, D₈, Q₈, S₄, SmallGroup(20, 3), SmallGroup(24, 3), where SmallGroup(m, n) denotes the mth group of ordern in the small group library of GAP [11].     

A subgroup involvement of the Fibonacci length

For a non-Abelian 2-generated finite group G=〈a,b〉, the Fibonacci length of G with respect to A={a,b}, denoted by LEN _A (G), is defined to be the period of the sequence x ₁=a,x ₂=b,x ₃=x ₁ x ₂,…,x _n+1=x _n?1 x _n ,… of the elements of G. For a finite cyclic group C _n =〈a〉, LEN _A (C _n ) is defined in a similar way where A={1,a} and it is known that LEN _A (C _n )=k(n), the well-known Wall number of n. Over all of the interesting numerical results on the Fibonacci length of finite groups which have been obtained by many authors since 1990, an intrinsic property has been studied in this paper. Indeed, by studying the family of minimal non-Abelian p-groups it will be shown that for every group G of this family, there exists a suitable generating set A′ for the derived subgroup G′ such that LEN _A′(G′)|LEN _A (G) where, A is the original generating set of G.     

Graded polynomial identities and codimensions: Computing the exponential growth

Let G be a finite abelian group and A a G-graded algebra over a field of characteristic zero. This paper is devoted to a quantitative study of the graded polynomial identities satisfied by A. We study the asymptotic behavior of , n=1,2,…, the sequence of graded codimensions of A and we prove that if A satisfies an ordinary polynomial identity, exists and is an integer. We give an explicit way of computing such integer by proving that it equals the dimension of a suitable finite dimension semisimple G×Z₂-graded algebra related to A.     

Thompson’s conjecture for alternating group of degree 22

For a finite group G, it is denoted by N(G) the set of conjugacy class sizes of G. In 1980s, J. G. Thompson posed the following conjecture: if L is a finite nonabelian simple group, G is a finite group with trivial center, and N(G) = N(L), then L and G are isomorphic. In this paper, it is proved that Thompson’s conjecture is true for the alternating group A ₂₂ with connected prime graph.     

On sum sets of sidon sets,II

LetG be a finite abelian group,G?{Z _n, Z₂?Z_2n}. Then every sequenceA={g ₁,...,g_t} of $t = \frac{{4\left| G \right|}}{3} + 1$ elements fromG contains a subsequenceB?A, |G|=|G| such that $\sum\nolimits_{g_i \in B^{g_i } } { = 0 (in G)} $ . This bound, which is best possible, extends recent results of [1] and [22] concerning the celebrated theorem of Erdös-Ginzburg-Ziv [21].     

Fitting ideals and the Gorenstein property

Let p be a prime number and G be a finite commutative group such that p ² does not divide the order of G. In this note we prove that for every finite module M over the group ring Z _p [G], the inequality #M  ￡  #Z_p[G]/Fit_Zp[G](M){\#M\,\leq\,\#{\bf Z}_{p}[G]/{{\rm Fit}}_{{\bf Z}_{p}[G]}(M)} holds. Here, Fit_Zp[G](M){\rm Fit}_{{\bf Z}_{p}[G]}(M) is the Z _p [G]-Fitting ideal of M.     

Derived representation type and Gorenstein projective modules of an algebra under crossed product

Let H and its dual H* be finite dimensional semisimple Hopf algebras. In this paper, we firstly prove that the derived representation types of an algebra A and the crossed product algebra A#σH are coincident. This is an improvement of the conclusion about representation type of an algebra in Li and Zhang [Sci China Ser A, 2006, 50: 1-13]. Secondly, we give the relationship between Gorenstein projective modules over A and that over A#σH. Then, using this result, it is proven that A is a finite dimensional CM-finite Gorenstein algebra if and only if so is A#σH.     

2 D n (3)(9≤n=2 m +1 not a prime) can be characterized by its order components

In this paper we prove that ifG is a finite group,² D _n (3)(9≤n=2 ^m +1 not a prime),G andM have the same order components, thenG ≈= M.     

Relation between frobenius and 2-frobenius groups with order components of finite groups

IfG is a finite group, we define its prime graph Г(G), as follows: its vertices are the primes dividing the order ofG and two verticesp, q are joined by an edge, if there is an element inG of orderpq. We denote the set of all the connected components of the graph Г(G) by T(G)= {π_i(G), fori = 1,2, …,t(G)}, where t(G) is the number of connected components of Г(G). We also denote by π(n) the set of all primes dividingn, wheren is a natural number. Then ¦G¦ can be expressed as a product of m₁, m₂, …, m_t(G), where m_i’s are positive integers with π(m_i) = π_i. Thesem _i ’s are called the order components ofG. LetOC(G) := {m ₁,m ₂, …,m _t (G)} be the set of order components ofG. In this paper we prove that, if G is a finite group andOC(G) =OC(M), where M is a finite simple group witht(M) ≥ 2, thenG is neither Frobenius nor 2-Frobenius.     

On 9- and 10-decomposable finite groups

A finite group G is called n-decomposable if every proper non-trivial normal subgroup of G is a union of n distinct conjugacy classes of G. In some research papers, the question of finding all positive integer n such that there is an n-decomposable finite group was posed. In this paper, we investigate the structure of 9- and 10-decomposable non-perfect finite groups. We prove that a non-perfect group G is 9-decomposable if and only if G is isomorphic to Aut(PSL(2,32)), Aut(PSL(3,3)), the semi-direct product Z ₃ ∝(Z ₅×Z ₅) or a non-abelian group of order pq, where p and q are primes and p?1=8q, and also, a non-perfect finite group G is 10-decomposable if and only if G is isomorphic to Aut(PSL(2,17)), PSL(2,25):2₃, a split extension of PSL(2,25) by Z ₂ in ATLAS notation (Conway et al., Atlas of Finite Groups, [1985]), Aut(U ₃(3)) or D ₃₈, where D ₃₈ denotes the dihedral group of order 38.     

A characterization of the group 2 D n (2), where n=2 m +1≥5

In this paper it is proved that the group ² D _n (2), where n=2 ^m +1≥5, can be uniquely determined by its order components. More precisely we will prove that if G is a finite group and OC(G) denotes the set of order components of G, then OC(G)=OC(² D _n (2)) if and only if G ? ² D _n (2). A main consequence of our result is the validity of Thompson’s conjecture for the group under consideration.     

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