COUNTING THE CINTRALIZERS OF SOME FINITE GROUPS

  • Ashrafi, Ali Reza (Institute for Studids in Theoretical Physics and Mathematics, Department of Mathematics, Faculty of Science, University of Kashan)
  • 발행 : 2000.01.01

초록

For a finite group G, #Cent(G) denotes the number of cen-tralizers of its clements. A group G is called n-centralizer if #Cent( G) = n. and primitive n-centralizer if #Cent(G) = #Cent(${\frac}{G}{Z(G)$) = n. In this paper we compute the number of distinct centralizers of some finite groups and investigate the structure of finite groups with Qxactly SLX distinct centralizers. We prove that if G is a 6-centralizer group then ${\frac}{G}{Z(G)$${\cong}D_8$,$A_4$, $Z_2{\times}Z_2{\times}Z_2$ or $Z_2{\times}Z_2{\times}Z_2{\times}Z_2$.

키워드

참고문헌

  1. Southeast Asian Bulletin of Mathematics v.2 On the n-sum groups, n = 6, 7 A.R. Ashrafi
  2. Math. Mag. v.5 Counting Centralizers in Finite Groups S.M. Belcastro;G.J. Sherman
  3. Math.Scand. v.75 On n-sum groups J.H.E. Cohn
  4. Osaka J. Math. v.33 A condition of lengths of conjugacy classes and character degree A. Hanaki
  5. Nagoya Math. J. v.3 On the degrees of irreducible representations of a finite group N. Ito
  6. Representations and characters of groups G.D. James;M.W. Liebeck
  7. North-Holland Mathematical Studies v.177 Group Representations, Volume 2 G. Karpilovsky
  8. J. London Math. Soc. v.29 Groups covered by permutable subsets B.H. Neumann
  9. A course in the theory of groups D.J.S. Robinson
  10. Lehrstuhl D fur Mathematik GAP: Groups, algorithms, and programming M. Schonert(et al.)
  11. Comm. Alg. v.15 Groups covered by finitely many cosets or subgroups M.J. Tomkinson