6 GTC Proceedings

Golestan University
Faculty of Sciences
Department of Mathematics
The Extended Abstract of
The 6
th
National Group Theory
Conference
1213 March 2014
Contents
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii
Invariants of a nite group acted on by a Frobenius-like group . . . . . . . . . . . . . . . . . . . 2
Ercan, G.
Representations of a Finite Group with an Extraspecial Normal Subgroup . . . . . . . 3
G uloglu,

I. S.
The Classication of Groups via Capability; A Reality to Dream. . . . . . . . . . . . . . . . . 9
Kayvanfar, S.
Direct Limits of Finitary Symmetric Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
Kuzucuoglu, M.
Algebraically closed groups and embedding theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
Shahryari, M.
On the cover-avoiding properties in nite groups. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
Shum, K. P.
Some open problems in non-commuting graphs of groups . . . . . . . . . . . . . . . . . . . . . . . 28
Abdollahi, A.
The relative nth nilpotency degree of two subgroups of a nite group . . . . . . . . . 31
Abdul Hamid*, M., Mohd Ali, N. M., Sarmin, N. H. and Erfanian, A.
Generalize commutator on polygroups and hypergroups. . . . . . . . . . . . . . . . . . . . . . . . . 35
Aghabozorgi*, G. H., Jafarpour, M. and Davvaz, B.
Some solved and unsolved problems in loop theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
Ahmadidelir, K.
Inequality for the number of generators of the cnilpotent multiplier . . . . . . . . . . . 46
Alizadeh Sanati, M. and Mahdipour*, Z.
Characterization of
2
D
n
(2) by the set of orders of maximal abelian subgroups . . 50
ii
Asadian*, B. and Ahanjideh, N.
A characterization of Sz(8) by nse. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
Asgary*, S. and Ahanjideh, N.
Symmetry classes of polynomials with respect to product of groups . . . . . . . . . . . . . 58
Babaei*, E. and Zamani, Y.
(Strongly) Gorenstein homological dimension of groups . . . . . . . . . . . . . . . . . . . . . . . . . 63
Bahlekeh, A.
OD-Characterization of the simple group G
2
(p), where p < 100 . . . . . . . . . . . . . . . . . 67
Bibak*, M., Sajjadi*, M. and Rezaeezadeh, G.
Combinatorial conditions on groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
Faramarzi Salles*, A. and Khosravi, H.
On the number of elements of a given order . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
Farrokhi D. G.*, M. and Saeedi, F.
On the lower autocentral series of groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
Gholamian*, A. and Nasrabadi, M. M.
On a conjecture about automorphisms of nite p-groups . . . . . . . . . . . . . . . . . . . . . . . . 80
Ghoraishi, S. M.
Embeddings of borel subgroup of the Ree groups of type
2
F
4
(q
2
) . . . . . . . . . . . . . . . 84
Ghorbany, M.
The commutativity degree of a polygroup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
Hokmabadi, A., Mohammadzadeh, F. and Mohammadzadeh*, E.
Finite p-groups whose order of their Schur multiplier is given(t=6). . . . . . . . . . . . . . 92
Jafari, S. H.
Investigating equality of edge and vertex connectivity number in prime graph of
alternative groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
Jahandideh*, M., Kazemi Esfeh, H. and Farhami, N.
iii
A note on the tensor and exterior center of a pair of Lie algebras . . . . . . . . . . . . . . 101
Johari*, F., Niroomand, P. and Parvizi, M.
Capability of nite nilpotent groups of class 2 with cyclic Frattini subgroups. . . 105
Kaheni*, A., Hatamian, R. and Kayvanfar, S.
Support enumerators for some permutation groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
Kahkeshani, R. and Yazdany Moghaddam*, M.
On semigroups generated by vector spaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
Khoddami, A. R.
Engel degree and Isoclinism classes of nite groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 116
Khosravi*, H. and Araskhan, M.
Burnside condition on some intersection subgroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
Mirebrahimi*, H. and Ghanei, F.
Some properties of centralizer and autocommutator subgroup in auto-Engel gro-
ups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
Moghaddam, M. R. R. and Badrkhani Asl*, M.
Counting centralizers in non-abelian n-dimensional Lie algebras . . . . . . . . . . . . . . . 127
Moghaddam, M. R. R., Hoseini Ravesh, M. and Saarnia*, S.
Some properties of 2-Engel transitive groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132
Moghaddam, M. R. R. and Rostamyari*, A.
Embedding a special subgroup in n-autocentral subgroups of a group. . . . . . . . . . 136
Moghaddam, M. R. R. and Sadeghifard*, M. J.
Triangle-free commuting conjugacy classes graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
Mohammadian*, A., Erfanian, A. and Farrokhi D. G., M.
Isologism crossed modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 144
Mohammadzadeh, H.
The structure of non-solvable CTI-groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
Mousavi, H., Rastgoo*, T. and Zenkov, V.
iv
P-semisimple BCI-algebras and adjoint groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
Naja*, A. and Rasouli, H.
The nite -solvable groups with three conjugacy class sizes of primary and bipri-
mary -elements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157
Naja*, M. and Ahanjideh, N.
On the absolute center of some groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
Nasrabadi*, M. M. and Gholamian, A.
On countability of homotopy groups. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
Nasri*, T., Mashayekhy, B. and Mirebrahimi, H.
The schur multiplier of pairs for some nite groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
Nawi*, A. A., Mohd Ali, N. M., Sarmin, N. H., Rashid, S. and Zainal, R.
Separation properties of topological fundamental groups . . . . . . . . . . . . . . . . . . . . . . . 174
Pakdaman*, A., Mashayekhi, B. and Torabi, H.
On the characterizations of nite groups. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178
Parvizi Mosaed*, H., Iranmanesh, A. and Foroudi Ghasemabadi, M.
An approach to c-imperfect groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 181
Pourmirzaei, A. and Hassanzadeh*, M.
The structure of Permutation Groups with t = 1/3(6m2) . . . . . . . . . . . . . . . . . . . 185
Razzaghmaneshi, B.
Permutation Groups with Three Constant Orbits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
Razzaghmaneshi, B.
On minimal non PST-groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
Rezaeezadeh, G. and Aghajari*, Z.
The structure of SS-semipermutable groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
Rezaeezadeh, G. and Mirdamadi*, S. E.
Movement of permutation groups with two orbits. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199
v
Rezaei, M.
Irreducible characters and conjugacy classes in nite groups . . . . . . . . . . . . . . . . . . . 203
Robati, S. M.
The classication of some nilpotent Leibniz 4-algebras . . . . . . . . . . . . . . . . . . . . . . . . . 207
Saeedi, F. and Akbarossadat*, S. N.
Finite groups with a given number of relative centralizers. . . . . . . . . . . . . . . . . . . . . . 212
Saeedi*, F. and Farrokhi D. G., M.
Cellular Automata and its application in group theory. . . . . . . . . . . . . . . . . . . . . . . . . 217
Safa, H.
On t-extensions of abelian groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220
Sahleh, H. and Alijani*, A. A.
OD-characterization of almost simple groups related to L
2
(p
2
). . . . . . . . . . . . . . . . . 224
Sajjadi*, M., Bibak, M. and Rezaeezadeh, G.
A new characterization of A
p
where p and p 2 are twin primes . . . . . . . . . . . . . . . 227
Salehi Amiri, S. S.
Commuting graphs on conjugacy classes of nite groups . . . . . . . . . . . . . . . . . . . . . . . 230
Shadab, M. and Saeidi*, A.
A Quotient OF Topological Fundamental Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
Torabi*, H., Pakdaman, A. and Mashayekhy, B.
On 11decomposable nite groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 236
Youse*, M. and Ashra, A. R.
The nonabelian tensor square of some nite groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239
Zainal*, R., Mohd Ali, N. M., Sarmin, N. H., Rashid, S. and Nawi, A. A.
Epicenter of Lie rings and the Lazard correspondence. . . . . . . . . . . . . . . . . . . . . . . . . . 244
Zandi, S.
A generalization of Mohress Theorem on groups with all subnormal sub-
vi
groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248
Zarrin, M.
* Speaker
vii
Preface
The 6th National Conference on Group Theory was held on the Faculty of Sciences
of Golestan University in Gorgan during 12-13 March 2014. The conference provides
a forum for mathematicians and scholar students to present their latest results about
all aspects of group theory and a means to discuss their recent researches with each
other.
The organizing committee of the conference warmly welcomes the participants
to Gorgan, hoping that their stay here will be happy and fruitful one.
The secretary oce of the conference has received more than 115 papers from
which 62 papers have been accepted by the scientic committee.
Al in all, we have made every eort to make the conference as worthwhile as
possible. It is our pleasure to express our thanks to all whose help has made this
gathering possible, particularly the referees of the papers for spending many hours
reviewing papers and providing valuable feedback to the authors; the authors of all
submitted papers for their contributions and the administration of Golestan Univer-
sity.
Chair of Conference: Dr. M. Alizadeh Sanati
Scientic Chair: Dr. S. M. Taheri
Executive Chair: Dr. A. Pakdaman
viii
General Talks
The 6
th
International Group Theory Conference
1213 March 2014, Golestan University, Gorgan, Iran.
Invariants of a nite group acted on by a Frobenius-like
group
G ul
In Ercan
Middle East Technical University, Ankara, Turkey
ercan@metu.edu.tr
Abstract
Let F be a nite group acted on by a nite group H via auto-
morphisms. This action is said to be Frobenius if C
F
(h) = 1
for all nonidentity elements h H. Accordingly the semidi-
rect product FH is called a Frobenius group with kernel F
and complement H whenever F and H are nontrivial. It
is well known that Frobenius actions are coprime actions
and the kernel F is nilpotent. A slight generalization of
the Frobenius group will be the object of this talk. More
precisely, we consider nontrivial nite groups F and H so
that H acts on F via automorphisms, F is nilpotent and
[F, h] = F for all nonidentity elements h H, and call the
semidirect product FH a Frobenius-like group. It should
be noted that the group FH is Frobenius-like if and only if
F is a nontrivial nilpotent group and the group FH/F
is
Frobenius with kernel F/F
and complement isomorphic to

H.
There have been a lot of research about the structure of
nite solvable groups admitting a Frobenius group FH of
automorphisms. In this talk the action of a Frobenius-like
group FH on a nite group G will be discussed and con-
clusions about some invariants of G and F under additional
hypothesis will be drawn.
2
The 6
th
Representations of a Finite Group with an Extraspecial
Normal Subgroup
Ismail S.G uloglu

Department of Mathematics, Dogus University,

Istanbul,T urkiye
ercan@metu.edu.tr
Abstract
In this talk I will present a technical result which seems
to be of some independent interest and which was obtained
during our joint research with G.Ercan on the inuence of
xed-point free action of a Frobenius-like group on a solv-
able group which will appear in Jour. of Algebra with the
title Action of a Frobenius-like Group. We shall prove a
theorem about irreducible and faithful , complex representa-
tions of a nite group G=PH which has a normal subgroup
P isomorphic to an extraspecial group and a complement H
in which each Sylow subgroup is cyclic and H/F(H) is not a
nontrivial 2-group.
1 Introduction
Many questions about certain invariants of a nite group like nilpotent length, de-
rived length, p-length are answered by reducing the relevant group structure to some
relatively simple conguration and then invoking some representation theoretic ar-
guments. And most of these representation theoretic arguments are about linear
groups and say that a certain group has regular orbits on the natural module on
which this linear group acts. Regular modules force the existence of large dimension
and xed points and hence there is a wide range of possible aplications,especially in
the study of groups admitting a xed-point-free group of automorphisms.
The result I want to present in my talk in this conference is a generalization of
a very well known theorem which was proven by Dade, namely the following
Theorem Let H be a group in which each Sylow subgroup is cyclic. Assume
that H/F(H) is not a nontrivial 2-group. Let P be an extraspecial group of order
3
p
2m+1
for some prime p not dividing |H|. Suppose that H acts on P in such a way
that H centralizes Z(P), and [P, h] = P for any nonidentity element h H. Let k be
an algebraically closed eld of characteristic not dividing the order of G = PH and
let V be a kG-module on which Z(P) acts nontrivially and P acts irreducibly. Let
be the character of G aorded by V. Then |H| divides p
m
and
H
=
p
m
|H|
+
where is the regular character of H, is a linear character of H and {1, 1}.
In particular, V
H
contains the regular kH-module as a direct summand if G is of
odd order.
2 Proof of the Theorem
In this section we present a proof of the theorem.
Lemma 2.1. Let FH be a group with F FH, F
= F and [F, h] = F for all

nonidentity elements h H. Assume that all Sylow subgroups of H are cyclic.
Then
(i) the groups H
and H/H
are cyclic of coprime orders,

(ii) H = H
y = H
0
y with H
y = 1 for some y H where H

0
denotes the
Fitting subgroup of H, and H
0
= H
C
y
(H
) is cyclic,
(iii) (H
0
) = (H).
Proof. The group FH/F
is Frobenius with Frobenius complement isomorphic to

H. Then (i) follows by [3, Theorem 5.16]. In particular, H = H
y for some y H
with H
y = 1. On the other hand the group H has a unique subgroup of order p

for each prime p dividing its order by the argument applied in the proof of Theorem
6.19 in [3] which relies on [3, Theorem 6.9]. Hence (H
0
) = (H) as claimed in
(iii). Let now H
0
denote the Fitting subgroup of H. Then H
0
= H
(H
0
y) and
[H
0
y, H
] = 1, that is, H
0
y C
y
(H
) H
0
. This establishes the claim
(ii).
Proof. of The Theorem Since all Sylow subgroups of H are cyclic and G/Z(P)
is a Frobenius group with a complement isomorphic to H, we see that H has the
properties described in Lemma 2.1. By [Huppert, V.17.13] we can assume that H is
not nilpotent and recall that H/F(H) is not a 2-group by hypothesis.
Note that dimV = p
m
as
P
is a faithful irreducible character of P. Let D be the
representation of G aorded by the module V and let M be the k-space of square
matrices of size p
m
over k. We dene a left kH-module structure on M by letting
h X := D(h)XD(h
1
), for any X M and for any h H.
4
It is known that H acts on Hom
k
(V, V ) via the multiplication (h T)(v) = hT(h
1
v)
for any h H, T Hom
k
(V, V ), and v V. Then clearly M is isomorphic to the
k[H]-module Hom
k
(V, V ). Furthermore Hom
k
(V, V ) and V
V are isomorphic as
k[H]-modules. So by letting Irr(H) = {
1
,
2
, . . . ,
s
} and
H
=
s
i=1
n
i
i
with
nonnegative integers n
i
, i = 1, . . . s, we have =
k,l=1,...,s
n
k
n
l
l
where is
the character of H aorded by M.
Choose a transversal T for Z(P) in P. Then the set {D(x)|x T} forms a basis
for M by a result of Burnside [Huppert, V.5.14] and the fact that D(zx) = (z)D(x)
for any x T and z Z(P). Notice that P/Z(P) is the union of one H-orbit of
length 1 and d =
p
2m
1
|H|
orbits of length |H|. Thus we have M = I M
1
M
d
with M
i

= k[H] as H-module for any i = 1, 2, . . . , d. So we get
= 1
H
+
s
i=1
p
2m
1
|H|

i
(1)
i
=
s
k,l=1
n
k
n
l
l
.
Thus the multiplicity of the principal character 1
H
in is
[1
H
, ]
H
= 1 +
p
2m
1
|H|
=
s
k=1
n
2
k
and the multiplicity of any nonprincipal Irr(H) in is
[, ]
H
=
p
2m
1
|H|
(1) =
s
k,l=1
n
k
n
l
(
l
,
k
).
In particular for any nonprincipal linear character of H we have
p
2m
1
|H|
=
Irr(H)
n
.
This gives
1 =
Irr(H)
n
2
Irr(H)
n
, and hence 2 =
Irr(H)
(n
)
2
for any nonprincipal linear character of H.
The group

H/H
of characters of the abelian group H/H
is isomorphic to H/H
.
In particular it is cyclic. Let be a generator of

H/H
. It acts on Irr(H) by
multiplication. Let
i
, i = 1, . . . , b be the orbits of on Irr(H) and let m
i
= |
i
| .
Then we have 2 =
b
i=1
i
(n
)
2
. So there are exactly two elements
and in Irr(H) such that |n
| = 1 = |n
|, and we have n
= n
for any
Irr(H) {, }. If
i
and /
i
, then n
= n
= n
2 = = n
m
i
1 =
n
, which is not possible. So if necessary by reindexing the orbits, we can assume

that and are both elements of
b
, and n
= n
for any i = 1, 2, . . . , b 1 and

any
i
.
Suppose that =
u
for some u {1, 2, . . . , m
b
1}. We have
n
= n
= = n
u = n
u+1 = = n
m
b
1 = n
.
Since each
i
is either a
2
-orbit or the union of two
2
-orbits of the same size
5
we get
2 =
b
i=1
i
(n
2)
2
=
b
(n
2)
2
.
So the dierences n
2, n
m
b
1 n
, n
2 are all nonzero if

u {2, . . . , m
b
2}, which is a contradiction. If necessary by replacing by
1
we
can assume that n
= n
= n
2 = = n
m
b
1 = n
.
We let n
= n
+, with
some {1, 1}. Choose an element
i
from
i
, i = 1, 2, . . . , b 1, and let
b
= .
Then
H
=
b
i=1
n
i
(
i
+
i
+
i
m
i
1
) +, where =
b
.
By [Huppert, V.17.13] we have
=
p
m
|H
= (
b
i=1
n
i
m
i
i
)
H
+
b
H
for some
{1, 1} and
Irr(H
) where
is the regular character of H
.
It follows by that if i = j then the sets of irreducible constituents of the restric-
tions of
i
and
j
are disjoint. By Cliords theorem we have
iH
= e
i
t
i
j=1
i,j
where I
H
(
i,1
) = T
i
, t
i
= [H : T
i
], H =
t
i
j=1
T
i
x
i,j
, and
i,j
=
x
i,j
i,1
, j = 1, 2, . . . , t
i
; i = 1, 2, . . . , b. Now {
i,j
|j = 1, 2, . . . , t
i
; i = 1, 2, . . . , b} =
Irr(H
).
It is known that there is a unique
i
Irr(T
i
) such that
i
H
=
i
and
i
H
=
e
i
i,1
. On the other hand as T
i
/H
is cyclic,
i,1
has an extension, say , to T
i
. But
then
H
must belong to the -orbit containing
i
which implies
i
H
= (
H
)
H
.
Therefore we have
e
i
= [
i
H
,
i,1
] = [(
H
)
H
,
i,1
] = [
H
,
i,1
] = 1 for any i = 1, 2, . . . , b.
Let now e =
p
m
|H
|
and
=
i
0
,j
0
. Then for any

H
we have
[
H
, ]
H
=
_
e if =
e +
if =
.
Set H
0
= F(H). Applying [Huppert, V.17.13] to the action of PH
0
on V we see
in particular that |H
0
| divides p
m

for some
{1, 1}. Then |H
| divides
ae
2

= (p
m

) (p
m
ae
2
) and so we have either ae
2
=
or |H
| = 2.
If the latter holds then H
Z(H) and hence H is abelian, which is not the case.

Thus |H
0
/H
| divides e. In particular e > 1 and so e +
> 0 which shows that

[
H
,
i
0
]
H
= 0.
6
If t
i
0
= 1, then there exists j
1
= j
0
such that
e = [
H
,
i
0
,j
1
]
H
= [
H
,
i
0
,j
0
]
H
= e +
which is not possible. Then t

i
0
= 1 and hence
is H-invariant. This yields that
i
0
H
=
i
0
,1
. In particular
i
0
is a linear character of H and so m
i
0
= |H/H
|.
Furthermore we have
e +
=
_
n
i
0
m
i
0
if i
0
< b
n
b
m
b
+ if i
0
= b
.
Now |H
0
/H
| divides the greatest common divisor of e and m

i
0
which forces that
i
0
= b as H
0
/H
is nontrivial. Furthermore if =
we have |H
0
/H
| = 2, which
implies by Lemma 2.1 that H/H
is a 2-group. This contradiction shows that =
and hence n
b
m
b
= e by the above formula. In particular
p
m
|H|
= n
b
is an integer.
On the other hand we also have e = [
H
,
i,1
]
H
= n
i
m
i
if i < b.
Set next r
i
= |T
i
/H
| . As

T
i
/H
= |
T
i
we obtain T
i
Ker
r
i
. As
i
=
i
H
for some
i
of T
i
and T
i
is normal in H, we observe that
i
(x) = 0 for any x /
T
i
. Combining these two observations we get
r
i
i
=
i
. Thus m
i
divides r
i
and hence |H/H
| = r
i
t
i
= m
i
c
i
t
i
for some positive integer c
i
. It follows now that
n
i
m
i
c
i
t
i
= ec
i
i
(1) and hence n
i
=
p
m
|H|
c
i
i
(1)
p
m
|H|

i
(1). Thus
p
m
|H|
+
occurs in
H
. As the degrees of these characters are the same we see that they are
equal. This completes the proof of the theorem.
The next example shows that the hypothesis about the structure of H can not
be avoided.
Example Let V be the GF(3)-space GF(3
4
). We dene the map
(|) : V V GF(3) by (|)(x, y) = Tr(d (xy
9
x
9
y)) for x, y V , where
d is an element of order 16 in GF(3
4
)
. One can check that (|) is a nonsingular

symplectic form on V.
Let b GF(3
4
)
be an element of order 5 and c GF(3

4
)
be an element of
order 4. We dene
b
: V V by
b
(x) = b x and : V V by (x) = c x
9
.
Then H =
b
, is a subgroup of GL(4, 3) preserving the symplectic form, with
|H| = 20, H
=
b
of order 5, and F(H) = H

2
of order 10. Furthermore
h(v) = v for some 0 = v V and h H implies that h = 1. So if P is the
extraspecial group of order 3
5
and exponent 3, then it admits H as a subgroup of
automorphisms of P, centralizing Z(P) and satisfying [P, h] = P for any nonidentity
element h H. Let be any irreducible character of the group PH which does
not contain Z(P) in its kernel. Clearly, we have
H
=
3
2
|H|
+ for the regular
H-character and any {1, 1} and Irr(H), because
3
2
|H|
is not an integer.
7
References
[1] B. Huppert, Endliche Gruppen, Springer-Verlag, Berlin-New York 1967.
[2] G. Ercan,

I. S. G uloglu: Action of a Frobenius-like Group 2014, will appear
in J. Algebra.
8
The 6
th
The Classication of Groups via Capability; A Reality
to Dream
Saeed Kayvanfar
Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran
skayvanf@math.um.ac.ir; skayvanf@yahoo.com
Abstract
This talk is a survey article on the classication of groups.
The classication of prime power groups of order at most p
6
was done using the notion of isoclinism and invoking a fun-
damental instrument, namely the capability of groups. Since
the basic concepts of this classication i.e., isoclinism and
capability were generalized to any variety of groups, there-
fore this talk intends to propound a basic question whether
it is possible to dene some suitable varieties that could play
the key role for classifying some other families of groups.
1 Introduction
One of the most important problem in group theory is the classication of groups.
The problem which has been always studied along with the age of group theory.
There have been also various approaches to face the problem. Among several dif-
ferent approaches, one of the most classical notions is the concept of isomorphism
between groups. However, this notion is too strong in many cases. For this reason,
P. Hall in 1940 [5] introduced the notion of isoclinism between two groups (which
is weaker than isomorphism) and could classify some groups of prime power order.
Using his method, his student Eastereld [6] and then M. Hall and J. Senior in 1964
[6] and later R. James in 1988 [8] completed the classication of groups of order at
most p
n
, where p is a prime and n is at most 6.
2010 Mathematics Subject Classication. Primary 20E10; Secondary 20D15.
Key words and phrases. Classication, isologism, capability.
9
We also know that the notion of isoclinism was generalized by P. Hall [5] to
isologism. Isologism is in fact isoclinism with respect to a certain variety of groups.
If one takes the variety of all trivial groups, one gets the notion of isomorphism back.
The variety of all abelian groups yields isoclinism.
On the other hand, we know that the main strong tool in the P. Halls classica-
tion is the notion of capability and this notion also was simultaneously generalized
to varietal capability by J. Burns and G. Ellis [3] and a joint paper of the author [9]
in 1997.
Now, using all these facts in hand, we just intend to propound a fundamental
question; Is it possible to dene some suitable varieties so that invoking them the
classication of some other families of groups happens? Indeed, in the face of these
facts, it seems that the classication of some other suitable families of groups will not
be so far! By this sentence, we mean that it might probably exist some special kind
of varieties such that their obtained classes caused by isologim can be considered
as the rst step of screening in the classication, though they might be so broad.
Although we do understand that as usual, the stating such a problem is so easy
while nding the answer may not!
2 Reality; The Classication of some Prime Power Groups
There are dierent approaches that can be considered for the description of nite
p-groups. We used the word description rather than classication because we
know that classifying p-groups is notoriously open and dicult. Some of the ap-
proaches are, for instance, the order, the coclass and the class of nilpotency. But
each of them has some restrictions and diculties in this way so that P. Hall in 1940
[5] introduced the notion of isoclinism for the classication of all groups, though he
could classify only some prime power groups.
Denition 2.1. Two groups G
1
and G
2
are said to be isoclinic provided that there
exist two isomorphisms : G
1
/Z(G
1
) G
2
/Z(G
2
) and :
2
(G
1
)
2
(G
2
)
such that if (a
1
Z(G
1
)) = a
2
Z(G
2
) and (b
1
Z(G
1
)) = b
2
Z(G
2
), then ([a
1
, b
1
]) =
[a
2
, b
2
]. This notion is written by G
1
G
2
.
In the P. Halls classication, regular group which was dened by him, plays the
key role. There are many equivalent ways to dene regular p-groups. One is that if
a and b are any elements of the group, then
(ab)
p
r
= a
p
r
b
p
r
c
1
p
r
. . . c
p
r
t
,
where c
i
are elements of the commutator subgroup of < a, b >. In fact, a group is
regular if the operation of taking pth powers interacts well with taking commuta-
tors. P. Hall [5] showed that in a regular p-group, one can dene type invariants
10
which are similar to the invariant factors for nite abelian groups. Though they do
not completely determine the groups the way the invariant factors do for abelian
groups, they are usually a very good rst reduction towards the analysis. Note that
if p n, then a group of order p
n
is necessarily regular (more generally, if the group
is of class c and p > c, then the group is regular, in particular, since a group of
order p
n
is of class at most n 1, the observation just made follows). In fact, P.
Hall mentioned in [4] that if we x n, then most groups of order p
n
are regular
(since only those with p < n may fail to be regular). This leads, classically, to a
separation of p-groups into those of small class (when the class is smaller than p),
and the rest. In other words, this means that when classifying groups of order
p
n
, the analysis usually breaks into two dierent cases: when the group is regular
(which includes all p n), and when the group is irregular. The latter case leads
to a case-by-case analysis for small primes. This occurs, for example, in the clas-
sication of groups of order p
3
(in which odd primes and 2 should be considered
separately). Likewise Burnsides work on group of order p
4
. Or similar to the work
of R. James [8] in the classication of groups of order p
6
and E. A. OBrien and M.
R. Vaughan-Lee [10] for p
7
. The latter separates p 7 with the groups of order 3
7
and 5
7
. Note that the latest work uses Lie rings and algebras as a starting point.
There are algorithms that are known to produce and check isomorphism types (see
[10]).
The above comments explains that how groups of order p
n
for all primes p have
been fully classied for n 7, rst (most of the times) by isoclinism and then up to
isomorphism. Note, in particular, that the number of isomorphism classes increases
with p when n 5. One may know that the Higman PORC conjecture (polynomial
on residue classes) is that, for each n, this number is a polynomial function of p and
of p (mod k) for a nite collection of values of k. Although a family of examples
constructed by M. D. Sautoy and M. R. Vaughan-Lee [12] of order p
10
show while
not actually disproving the conjecture, suggests that it is very unlikely indeed that
it is true. We should remind also that their construction depends on the geometry
of elliptic curves. It will probably illustrate that how describing all groups of order
p
10
would be complicated.
Let us comeback to the isoclinism. The notion of isoclinism denes an equivalence
relation on the class of all groups and has this trait that some other properties
of groups are invariant under isoclinism. For instance, it is proved in [2] that,
restricting ourselves to nite groups, we have the following hierarchy of classes of
groups, invariant under isoclinism: abelian < nilpotent < supersolvable < strongly
monomial < monomial < solvable. For charactering the families of isoclinism, P.
Hall [5] tried to nd some properties which are invariant in each family. Accordingly,
any quantity depending on a variable group and which is the same for any two groups
11
of the same family is called a family invariant. For instance, it is easy to see that the
members of the derived series and the central quotient groups are family invariants.
It follows that the groups belonging to the same family have the same derived length
and nilpotency class. Note that the commutator quotient group and the center are
not family invariants, as is the minimal number of generators.
Now, the importance of central quotient groups for this classication may be
seen. Such groups are called capable. More precisely;
Denition 2.2. A group G is called capable if there exists a group E such that
G

=
E
Z(E)
.
Among many dierent points on capability, there are two important tools for
recognition the capability of a group. One of them is a necessary condition which
was established by P. Hall [5]. He considered a generating system J for a group G
and dened
J
=
xJ
< x > and denoted the join of all subgroups
J
, where J
varies over all generating systems of G, by (G) and gave a necessary condition for
the capability of G in such a way that a capable group G must satisfy (G) = 1.
The other tool for characterizing the capability is a criterion that was introduced
by F. R. Beyl, U. Felgner and P. Schmid [1]. They showed that every group G
possesses a uniquely determined central subgroup Z
(G) which is minimal subject

to being the image in G of the center of some central extension of G. This Z
(G) is
characteristic in G and is the image of the center of every stem cover of G.
Denition 2.3. The intersection of all subgroups of the form (Z(E)), where :
E G is a surjective homomorphism with ker Z(E), is called the precise center
subgroup of G and denoted by Z
(G).
F. R. Beyl et al. [1] proved that Z
(G) is the smallest central subgroup of G

whose factor group is capable. Now using this fact the criterion for capability can
be given as follows.
Theorem 2.4. (F. R. Beyl, U. Felgner and P. Schmid 1979 [1]) G is capable if and
only if Z
(G) = 1.
3 Dream; The Classication of Other Classes of Groups!
The works and attempts which were explained as the Reality in Section 1 for the
classication of some prime power groups evidence that this way of classication
might not be quite simple. In other words, determining nite p-groups of order p
n
up to isomorphism, will be so complicated while n becomes large and larger. This
shows the necessity of primary screening not only for p-groups, but also for other
families of groups.
12
On the other hand, we should not forget that whatever, for instance, R. James
[8] did was heavily indebted to the work of P. Hall [5] on isoclinism. That is why,
we believe that as isoclinism could help us as the rst step of classication of prime
power groups of order p
n
for small n, paying attention to its generalization may be
helpful as the rst step of classication of some other classes of groups! Therefore in
this section, we remind all the notions and the tools in Section 1 which were gener-
alized to any variety of groups. In fact, the primary denitions and the preliminary
statements which provide the context of determining of the equivalence classes in
isoclinism were generalized in two steps. First, the isoclinism and capability
were transformed to c-isoclinism and ccapability and then they were gener-
alized to isologism and varietal capability, respectively. In the following, the
general case is provided.
Denition 3.1. Let V be a variety of groups dened by the set of laws V . Two
groups G and H are V- isologic if there exist isomorphisms
:
G
V
(G)

H
V
(H)
and : V (G) V (H),
such that (v(g
1
, g
2
, . . . , g
n
)) = v(h
1
, h
2
, . . . , h
n
), where g
i
G, h
i
(g
i
V
(G))
for each 1 i n. In this case, we write G
V
H. The pair (, ) is said to be a
V-isologism between G and H.
Likewise the isoclinism, for each variety V, isologism gives an equivalence relation
on the class of all groups. The larger variety implies the weaker equivalence relation.
If V is the variety of all abelian groups, V-isologism coincides with isoclinism. The
groups in a variety V fall into one single equivalence class, they are actually V-
isologic to the trivial group. (For more information about V-isologism see [7]).
On the other hand, it is observed from the denition of isologism that the
marginal factor group can play an important role in this system of classication.
Such a group is called varietal capable with respect to the variety V, or briey
V-capable [9].
Denition 3.2. Let V be a variety of groups dened by the set of laws V . A group
G is said to be V-capable , if there exists a group E such that G

= E/V
(E) .
Some properties of varietal capability are given in [9]. Specially, nding a cri-
terion for recognition of varietal capability is illustrated in [9]. More precisely, it is
shown that every group G possesses a uniquely determined subgroup (V
(G) of
the marginal subgroup V
(G) , which is minimal subject to being the image in G of

the marginal subgroup of some V-marginal extension of G. In fact, if : E G is
a surjective homomorphism with ker V
(E), then (V
(G) is dened to be the

intersection of all subgroups of the form (V
(E)).
13
If V is the variety of abelian groups then the subgroup (V
(G) is Z
(G) and
the V-capability coincides with the usual capability. If one takes V to be the variety
of nilpotent groups of class at most c, c 1, then one gets (V
(G) to be Z
c
(G) as
J. Burns and G. Ellis introduced in [3] and the V-capability will be their c-capability.
(V
(G) is characteristic and it is also proved in [9] that (V
(G) is the small-

est subgroup contained in the marginal subgroup of G for which the factor group
G/(V
(G) is V-capable. In other words;

Theorem 3.3. (M. R. R. Moghaddam and S. Kayvanfar [9]) G is V-capable if and
only if (V
(G) = 1.
The above comments explain that for a classication of a family of groups, the
notion of isologism might be helpful as a primary screening. The most important
tool that can be considered for characterizing the families of isologism is the V-
capable group. On the other hand, there are a few statements for recognition the
varietal capability (for instances, see [3] and [9]) invoking them one can nd out
the V-capability of some groups. There is also another helpful tool for recognizing
the V-capability; the Baer invariant of groups, which has been calculated for many
varieties. Invoking the Baer invariant, the varietal capability of some types of groups
has been characterized for some special kind of varieties (for example see [11]).
All these facts motivate us to think more to the dream of classication of groups
by varietal isologism via the varietal capability.
Acknowledgement
The author would like to thank Dr. A. Kaheni with whom I have had many useful
conversations on the classication of groups.
References
[1] F. R. Beyl, U. Felgner and P. Schmid, On groups occuring as centre factor
groups, J. Algebra 61 (1979), 161177.
[2] J. C. Bioch and R. W. van der Waall, Monomiality and isoclinism of groups, J.
reine ang. Math. 298 (1978), 7488.
[3] J. Burns and G. Ellis, On the nilpotent multipliers of a group, Math. Z. 226
(1997), 40528.
[4] P. Hall, A contribution to the theory of groups of prime power order, Proc.
London Math. Soc. (series 2) 36 (1934), no.1, 2995.
14
[5] P. Hall, The classication of prime-power groups, J. reine ang. Math.182 (1940),
130141.
[6] M. Hall, Jr., and J. K. Senior, The groups of order 2
n
(n 6), Macmillan, New
York, 1964.
[7] N. S. Hekster, Varieties of groups and isologism, J. Austral. Math. Soc. (series
A) 46 (1989), 2260.
[8] R. James, The groups of order p
6
(p an odd prime), Math. of Computation 34
no. 150 (1980), 613637.
[9] M. R. R. Moghaddam and S. Kayvanfar, A new notion derived from varieties
of groups, Algebra Colloquium 4:1 (1997), 111.
[10] E. A. OBrien and M. R. Vaughan-Lee, The groups with order p
7
for odd prime
p, J. Algebra 292 (2005), 243258.
[11] M. Parvizi, B. Mashayekhy and S. Kayvanfar, Polynilpotent capability of nitely
generated abelian groups, Journal of Advanced Research in Pure Mathematics
2(3) (2010), 81 86.
[12] M. D. Sautoy and M. R. Vaughan-Lee, Non-PORC behaviour of a class of
descendant p-groups, arXiv:1106.5530, 30 Jan, 2013.
15
The 6
th
Direct Limits of Finitary Symmetric Groups
Mahmut Kuzucuoglu
Middle East Technical University Department of Mathematics Ankara, Turkey
matmah@metu.edu.tr
Abstract
We describe the construction of a new class of simple locally
nite groups as a direct limit of nitary symmetric groups.
Moreover we investigate the structure of the centralizers of
elements in these groups.
1 Introduction
A group is called a locally nite group if every nitely generated subgroup is a
nite group. One of the natural construction of locally nite groups is by taking the
direct limit of nite groups. Using this method uncountably many, simple locally
nite groups of countably innite order is constructed as a direct limit of nite
symmetric groups in Kegel-Wehfritz [2, Chapter 6], (1976). Then the classication of
these groups by using Steinitz numbers is done by N. V. Kroshko-V. I. Sushchansky
in [3], (1998). We now describe this construction.
Let be the permutation dened by =
_
1 . . . n
i
1
. . . i
n
_
. Then the permutation
d
r
() =
(
1 . . . n n + 1 . . . 2n . . . (r 1)n + 1 . . . rn
i
1
. . . in n + i
1
. . . n + in . . . (r 1)n + i
1
. . . (r 1)n + in
)
is called a homogeneous r-spreading of the permutation .
Let be the set of sequences consisting of prime numbers and . So =
(p
1
, p
2
, . . .) is a sequence consisting of not necessarily distinct primes p
i
. We obtain
direct systems by using homogeneous p
i
-spreading from the following embeddings
{1}
d
p
1
S
n
1
d
p
2
S
n
2
d
p
3
S
n
3
d
p
4
. . .
2010 Mathematics Subject Classication. Primary:20F50; Secondary: 20E32.
Key words and phrases. Centralizers, Direct Limit groups, Simple groups.
16
{1}
d
p
1
A
n
1
d
p
2
A
n
2
d
p
3
A
n
3
d
p
4
. . .
where n
0
= 1, n
1
= p
1
, n
i
= n
i1
p
i
, i = 2, 3 . . . and S
n
i
is the symmetric group
on n
i
letters, A
n
i
is the alternating group on n
i
letters. The direct limit groups
obtained from the above direct systems are of strictly diagonal type and denoted by
S() and A(), respectively. Observe that S() Sym(N).
It is proved that such groups satisfy the followings:
If the prime 2 appears innitely often in the sequence , then the limit group
S() is a simple non-linear locally nite group.
If a prime p appears innitely often, then S() contains an isomorphic copy of
the locally cyclic p-group C
p
.
For each sequence , we dene Char() = p
r
1
1
p
r
2
2
. . . where r
i
is the number of
times that prime p
i
repeat in . If it repeats innitely often, then we write
p
i
. Therefore for each there corresponds a Steinitz number Char(). For a
group S() obtained from the sequence we dene Char(S()) = Char()
Two groups S(
1
) and S(
2
) are isomorphic if and only if Char(S(
1
)) =
Char(S(
2
)).
There are uncountably many non-isomorphic simple locally nite groups of
this type.
We will discuss some of the results for the centralizers of elements in S(), in
particular the following Theorem.
Theorem 1.1. (G uven, Kegel, Kuzucuoglu [1]) Let be an innite sequence, g
S() and the type of principal beginning g
0
S
n
k
be t(g
0
) = (r
1
, r
2
, . . . , r
n
k
). Then
C
S()
(g)

=
n
k
Dr
i=1
C
i
(C
i
S(
i
))
where Char(
i
) =
Char()
n
k
r
i
for i = 1, . . . , n
k
. If r
i
= 0, then we assume that
corresponding factor is {1}.
Let be an arbitrary set and Sym() be the symmetric group on the set .
Let g Sym(). We dene Supp(g) = { | g() = } the set of el-
ements of which are moved by the permutation g. Then FSym() = {g
Sym()| |Supp(g)| < }. Then FSym() is a locally nite, normal subgroup of
Sym() with the same cardinality of for an innite set .
Let be an arbitrary innite cardinal number. Let FSym() denote the nitary
symmetric group and Alt() denote the alternating group on the set . As before, let
17
be the set of sequences of prime numbers and . Then is a sequence of not
necessarily distinct primes. Let FSym(), ( Alt() ). For a natural number
p N a permutation d
p
() FSym(p) dened by (s +i)
d
p
()
= s +i
, i
and 0 s p 1 is called a homogeneous p-spreading of the permutation .
We divide the ordinal p into p equal parts and on each part we repeat the permu-
tation diagonally as in the nite case. So if =
_
1 . . . n
i
1
. . . i
n
_
FSym(), then the
homogeneous pspreading of the permutation is
d
p
() =
(
1 . . . n + 1 . . . + n . . . (p 1) + 1 . . . (p 1) + n
i
1
. . . in + i
1
. . . + in . . . (p 1) + i
1
. . . (p 1) + in
)
with the assumption that the elements in p \ supp(d
p
()) are xed.
We continue to take the embeddings using homogeneous p-spreadings with re-
spect to the given sequence of primes in . From the given sequence of embeddings,
we have direct systems and hence direct limit groups FSym()(), (Alt()()). Ob-
serve that FSym()() and Alt()() are subgroups of Sym().
The principal beginning
0
of an element FSym()() is dened to be the
smallest positive integer n
j
N such that
0
FSym(n
j
) and
0
is not obtained
as a sequence of embeddings d
p
i
for any p
i
.
Theorem 1.2. (G uven, Kegel, Kuzucuoglu [1]) Let be an innite sequence. If
FSym()() with principal beginning
0
FSym(n
i
), t(
0
) = (r
1
, . . . , r
n
),
and |supp(
0
)| = n. Then
C
FSym()()
()

=
n
(Dr
i=1
C
i
(C
i
S(
i
))) FSym()(
)
where Char(
i
) =
Char()
n
i
r
i
and Char(
) =
Char()
n
i
. If r
i
= 0, then we assume that
the corresponding factor in the direct product is {1}.
References
[1] G uven

U. B., Kegel O. H., Kuzucuoglu M.; Centralizers of subgroups in di-
rect limits of symmetric groups with strictly diagonal embedding, To appear in
Communications in Algebra .
[2] Kegel O. H., Wehrfritz B. A. F.; Locally Finite Groups, North-Holland Publish-
ing Company - Amsterdam, 1973.
18
[3] Kroshko N. V.; Sushchansky V. I.; Direct Limits of symmetric and alternating
groups with strictly diagonal embeddings, Arch. Math. 71, 173182, (1998).
19
The 6
th
Algebraically closed groups and embedding theorems
M. Shahryari
Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Tabriz,
Tabriz, Iran
mshahryari@tabrizu.ac.ir
Abstract
Using the notion of algebraically closed structures, we obtain
new embedding theorems for groups and Lie algebras. We
also prove the existence of some groups and Lie algebras
with prescribed properties.
The group Z
2
is the only nite group which has just two conjugacy classes. Is there
any innite group with the same property? Denis Osin [7], proved that there is a
nitely generated innite group with exactly two conjugacy classes. His method is
based on the small cancellation theory over relatively hyperbolic groups. Another
example of such groups is obtained by Higman, Neumann and Neumann using their
well-known embedding methods, [3]. In this article, we are dealing with problems
like this. Using the concept of algebraically closed groups, we prove that any R-group
can be embedded in a Q-group which has only two conjugacy classes. Remember
that a group G is called R-group, if for any integer m, the equality x
m
= y
m
implies
x = y. We also give a generalization of these groups and dene an R
-group to
be a group G such that the equality x
m
= y
m
implies x = y, whenever m is a
-
number. We prove that any R
-group can be embedded in a simple Q
-group, whose
elements of the same order are conjugate. We study many interesting properties of
such groups and then we obtain similar results for Lie algebras. By the notion of
algebraically closed Lie algebras, we show that any Lie algebra L can be embedded
in a simple Lie algebra L
which has many rare properties; for any non-zero elements

a and b, there is x such that [x, a] = b, and so for all non-zero x the derivation ad x
is not nilpotent. In the case of nite elds, every nite dimensional Lie algebra can
2010 Mathematics Subject Classication. Primary 20E45, Secondary 20E06.
Key words and phrases. Conjugacy classes, R-groups; R-groups, algebraically closed groups;
HNN-extension; Q-groups; Lie algebras; derivations; embedding theorems, Monsters
20
be embedded in L
and it is possible to describe the derivation algebra of any nite

dimensional algebra A as the quotient algebra N
G
(A)/C
G
(A). We also prove the
existence of some groups and Lie algebras with prescribed properties. Our main
tool in this work is HNN-extensions of groups and Lie algebras. The rst one is
well-known and the reader can consult any book on combinatorial group theory
(for example [3]) to see denition and properties of HNN-extensions of groups. The
HNN-extensions of Lie algebras are not so popular and it seems that there are only
two articles ever published in the subject, [2] and [11].
Although, we are dealing just with groups and Lie algebras in this article, it is
useful to give a general denition of algebraically closed structures in the frames of
the universal algebra. Let L be an algebraic language and A be an algebra of type
L. We extend L to a new language L
A
by adding new constant symbols c
a
for any
a A. Let T
A
(X) be the term algebra of L
A
with variables from a countable set X.
If p(x
1
, . . . , x
n
) and q(x
1
, . . . , x
n
) are elements of this term algebra, then we call the
expression p(x
1
, . . . , x
n
) = q(x
1
, . . . , x
n
) an equation with coecients from A. An
inequation is the negation of an equation. A system of equations and inequations
over A (or a system over A) is a nite set consisting equations and inequations. We
say that A is algebraically closed (a.c. for short), if and only if any system over A
having a solution in an extension B of A, has already a solution in A. In this article,
we consider the case of groups and Lie algebras, but some of the theory here, can be
generalized to arbitrary algebraic structures. Note that in the case of a group G, we
may assume that an equation has the form w(x
1
, . . . , x
n
) = 1, where w is an element
of the free product G F(X). Here F(X) is the free group on the set X. Similarly,
if L is a Lie algebra (or any non-associative algebra), then an equation over L has
the form w(x
1
, . . . , x
n
) = 0, with w and element of the free product LF(X), where
F(X) is the free Lie algebra over X.
1 Algebraically closed groups
A group G is called algebraically closed, if any nite consistent system of equations
and inequations with coecients from G has a solution in G. A system
S = {w
i
(x
1
, . . . , x
n
) = 1; (1 i r), w
j
(x
1
, . . . , x
n
) = 1; (r + 1 j s)} (I)
with coecients in G is called consistent, if there is a group K containing G, such
that S has a solution in K. One can generalize this denition to an arbitrary class
of groups: Let X be a class of groups. A group G X is called algebraically closed in
the class X, if every X-consistent system S has a solution in G. Here, X-consistency
means that there exists a group K X which contains G and S has a solution in K.
21
Recall that a class of groups is called inductive, if it contains the union of any
chain its elements. We will use the next theorem to obtain our embedding results
on groups.
Theorem 1.1. Let X be an inductive class of groups which is closed under the
operation of taking subgroups. Let G X. Then, there exists a group G
X, with
the following properties,
1- G is a subgroup of G
.
2- G
is algebraically closed in the class X.

3- |G
| max{
0
, |G|}.
We use the concept of algebraically closed groups and above theorem to embed
R-groups in Q-groups of the same cardinality with just two conjugacy classes. Then,
we will extend our results to the class of R
-groups for any set of primes . Our

main tool in this section is HNN-extensions of groups and normal forms of elements
in such groups, [3]. Recall that an R-group is group for which x
m
= y
m
implies
x = y for any non-zero integer m. A divisible R-group is a rational exponential
group or a Q-group in other words. The reader can consult [4] or [5] for a theory of
exponential groups.
Theorem 1.2. Let G be an R-group. Then G can be embedded in a Q-group G
with only two conjugacy classes. Further |G
| = |G|.
We can generalize the embedding theorem of R-groups to a more general classes
of groups. Let be a set of prime numbers. We consider the ring
Q
= {
m
n
Q : n is a
number}.
If consists of a single element p, then we denote this ring by Q
p
. A group G is an
R
-group, i for any x and y and any
-number n, we have the implication

x
n
= y
n
x = y.
The order of any element of such a group is innite or a -number. We say that G
is -divisible, i for any x G and any
-number n, there exists y G, such that

y
n
= x. Note that if a group G is both R
-group and -divisible, then there is a

unique y satisfying y
n
= x, for a given
-number n. So, we denote this element by

x
1
n
. Now, a group which is both R
-group and -divisible, can be regarded as an

exponential group over the ring Q
(or Q
-group for short) via x

m
n
= (x
1
n
)
m
. The
reader most consult [4] and [5] for the theory of exponential groups. Note that any
Q
-group is also R
-group and -divisible.

22
Theorem 1.3. Let G be an R
-group. Then there exists a Q
-group G
containing
G and with same cardinality as G, such that
1- G
is simple,
2- element of the same order in G
are conjugate,
3- G
is not nitely generated,

4- every nite -group embeds in G
.
5- every nitely presented -group can be residually embedded in G
,
6- for any nite -group A, we have Aut(A)

=
N
G
(A)
C
G
(A)
.
2 Algebraically closed algebras
Our next mission is to nd similar embedding theorems for Lie algebras. But there
are two major dierences between groups and Lie algebras. First, we dont have
any suitable denition of torsion in the case of Lie algebras so, in advance, we dont
have a parallel concept of R-Lie algebra and so on. Instead, we can express our
theorems in terms of arbitrary Lie algebras. The second main dierence is related
to HNN-extensions of Lie algebras. Here, an HNN-extension comes from a Lie
algebra and a derivation of some subalgebra, despite groups where HNN-extensions
are always dened by groups and isomorphisms between subgroups. We will give
a brief summary of HNN-extensions of Lie algebras in the next section. In this
section, we give the analogue of Theorem 1.1 for Lie algebras, in fact since it can be
formulated for arbitrary non-associative algebras, we prove it in the most general
form.
Theorem 2.1. Let X be an inductive class of (not necessarily associative) algebras
over a eld K. Suppose X is closed under subalgebra and L X. Then there exists
an algebra L
X with the following properties,

1- L is a subalgebra of L
.
2- L
is algebraically closed in the class X.

3- dimL
max{
0
, dimL, |K|}.
In [2] and [11], the concept of the HNN-extension is dened for Lie algebras.
Suppose L is a Lie algebra over a led K and A be a subalgebra. Let : A L be
a derivation. Dene a Lie algebra L
with the presentation

L
= L, t : [t, a] = (a); (a A).

The properties of this HNN-extension is studied in [2] and [11]. It is proved that L
is a subalgebra of L
. Similar constructions are also introduced for Lie p-algebras

and rings in [2]. In this section, using this HNN-extension, the theorem above, and
the notion of algebraically closed Lie algebras, we obtain a new embedding theorem.
23
Theorem 2.2. Let L be a Lie algebra over a eld K. Then there exists a Lie algebra
L
having the following properties,

1- L is a subalgebra of L
,
2- for any non-zero a, b L
, there exists x L
such that [x, a] = b,

3- for any non-zero x L
the derivation ad x is never nilpotent,

4- L
is simple,
5- dimL
max{
0
, dimL, |K|},
6- L
is not nitely generated,

7- every nite dimensional simple Lie algebra over K embeds in L
,
8- every nitely presented Lie algebra over K embeds residually in L
,
9- if K is nite, then every nite dimensional Lie algebra over K embeds in L
,
10- if K is nite and A is nite dimensional Lie algebra over K, then we have
Der(A)

=
N
L
(A)
C
L
(A)
.
3 Some Olshanskii like groups
In mid twenties, Alfred Tarski asked about the existence of innite groups all proper
non-trivial subgroups of which are of xed prime order p. In 1982, A. Yu. Olshanskii
[6], constructed an uncountable family of such groups using his geometric method of
graded diagrams over groups, for all primes p > 10
75
. The groups constructed are
called Tarskii monsters since then. These groups are two-generator simple groups
and hence are countable. In this section, for any xed prime p, we give a quite ele-
mentary proof for existence of countable non-abelian simple groups with the property
that their all non-trivial nite subgroups are cyclic of order p.
We will consider two special classes of groups in this section. The rst one
consists of groups all nite subgroups in which are cyclic. We will denote this class
by X
fc
. The second class which will be denoted by X
p
, is the class of all groups
in which their non-trivial nite subgroups are of order p, for a xed prime p. Note
that both classes are inductive and closed under subgroup. Clearly the Monsters
constructed by Olshanskii satisfy the requirements of the next theorem, but we dont
use that monsters, since we have a very elementary proof for our claims. What we
need is the theorem 1.2 and some facts about nite subgroups of HNN-extensions
(and also those of free products). It is known that (see [3], page 212) every nite
subgroup of any HNN-extension
G = A, t : tFt
1
= (F)
is contained in some conjugate of A. Also, every nite subgroup of any free product
A B is contained in some conjugate of A or some conjugate of B.
24
Theorem 3.1. There exists a countable non-abelian simple group M such that all
nite subgroups of M are cyclic and for any prime p, the group M has an element
of order p.
A similar result can be obtained if we use the class X
p
.
Theorem 3.2. Let p be a xed prime. Then there exists a countable non-abelian
simple group M (which is not torsion free) such that any nite non-trivial subgroup
of M is cyclic of order p.
References
[1] Higman, G., Scott, E. L. Existentially closed groups, Clarendon Press, 1988.
[2] Lichtman, A. I., Shirvani, M. HNN-extensions for Lie algebras, Proc. AMS, Vol.
125, No. 12, pp. 3501-3508, 1997.
[3] Lyndon, R. C., Schupp, P. E. Combinatorial group theory, Springer-Verlag,
2001.
[4] Myasnikov A. G., Remeslennikov V. N. Exponential groups I: fundations of the
theory and tensor completions, Siberian Math. J. Vol 35, No. 5, pp. 986-996,
1994.
[5] Myasnikov A. G., Remeslennikov V. N. Exponential groups II: extensions of
centralizers and tensor completion of CSA-groups, International J. Algebra and
Computation, Vol. 6, No. 6, pp. 687-711, 1996.
[6] Olshanskii, A. Y. Geometry of dening relations in groups, Kluwer Academic
Publishers, 1991.
[7] Osin, D. Small cancellations over relatively hyperbolic groups and embedding
theorems, Ann. of Math. (2), 172 (1), pp. 1-39, 2010.
[8] Scott, W. R. Algebraically closed groups, Proc. of AMS, No. 2, pp. 118-121,
1951.
[9] Shahryari, M. A note on derivations of Lie algebras, Bull. Aust. Math. Soc.
Vol. 84, pp. 444-446, 2011.
[10] Shahryari, M. Embeddings coming from algebraically closed groups, submitted.
[11] Wasserman, A. A derivation HNN construction for Lie algebras , Israil J. Math.
Vol. 106, pp. 76-92, 1998.
25
The 6
th
On the cover-avoiding properties in nite groups
Kar Ping Shum
The Chinese University of Hong Kong
.
Abstract
In this talk, I will talk about the process of the investigation
on cover-avoiding properties. Mainly talk about:
Cover-avoiding properties and the structure of nite
groups
Semi cover-avoiding properties and the structure of -
nite groups
Further investigations
All groups mentioned here are nite.
26
Talks
The 6
th
Some open problems in non-commuting graphs of
groups
Alireza Abdollahi
Department of Mathematics, University of Isfahan, Isfahan 81746-73441, Iran
and School of Mathematics, Institute for Research in Fundamental Sciences (IPM),
P.O.Box: 19395-5746, Tehran, Iran
a.abdollahi@math.ui.ac.ir
Abstract
Let G be a non-abelian group. The non-commuting graph of
G, denoted by
G
, is the graph whose vertex set is G and two
vertices are adjacent if they do not commute. In this talk,
we briey review some open problems about non-commuting
graphs of nite groups.
1 Introduction
Let G be a non-abelian group. The non-commuting graph of G, denoted by
G
,
is the graph whose vertex set is G and two vertices are adjacent if they do not
commute. The non-commuting graph is studied in [2]. Here we briey review some
open problems about non-commuting graphs of nite groups.
2 Order Conjecture
It is conjectured in [2] that if two nite non-abelian groups G and H have the same
non-commuting graph, then |G| = |H|. This conjecture is refuted by an example
due to I. M. Isaacs given in [4]. M. R. Darafsheh [4] has proved that the conjecture
is valid whenever one the groups G or H are simple. Abdollahi et al. [1] showed
the validity of the conjecture whenever one the groups G or H has prime power
2010 Mathematics Subject Classication. Primary 20D60; Secondary 20F99.
Key words and phrases. Non-commuting graph; Nilpotent group; Finite group.
28
order. In [3] it is proved that the conjecture holds if the non-commuting graphs of
the groups are irregular. Note that in the example given by Isaacs, groups have the
same regular non-commuting graph.
3 Nilpotent Conjecture
It is not known if G is a nite non-abelian nilpotent group such that
G

=
H
for
some H, then H is also nilpotent. In [2] it is noted that by using a result of [4] the
latter is true if |G| = |H|.
4 Nilpotency class conjecture
It is not known if two nite non-abelian nilpotent groups with same non-commuting
graphs have the same nilpotency class. The least example of two nilpotent non-
isomorphic groups with the same non-commuting graphs are dihedral group of order
8 and the quaternion group of order 8, where these two latter groups have the same
nilpotency class 2. By examples given in [4] one can see that for every prime p 3
there are groups G
1
and G
2
of order p
5
such that
G
1
=
G
2
such that the nilpotency
class of G
1
is 2 and the nilpotency class of G
2
is 3. Let us bring the details from [4].
Let G be a non-abelian nite p-group possessing an abelian maximal subgroup M
(necessarily normal of index p). Observe that, for x M \ Z(G), C
G
(x) = M
and if x G \ M, then C
G
(x) = Z(G)x. It follows that all proper centralizers
of G are abelian and their orders are |G| or |G|/p or p|Z(G)|. Therefore the non-
commuting graph of G is the complete multipartite graph K
|G|/p,p|Z(G)|,...,p|Z(G)|
,
where the number of parts of order p|Z(G)| is equal to
|G|
p|Z(G)|
. Hence, if G
1
and G
2
are two non-abelian nite p-groups possessing abelian maximal subgroups such that
|G
1
| = |G
2
| and |Z(G
1
)| = |Z(G
2
)|, then
G
1
=
G
2
.
Back to the non-abelian p-group G possessing an abelian maximal subgroup M
and suppose further that the subgroup M is elementary abelian, so that we can
regard it as a vector space over F
p
, the eld with p elements. The element x induces
some linear transformation on this space, and if t is the number of blocks of the
Jordan form of this transformation, then |Z(G)| = p
t
. The class of G, on the other
hand, is the maximal size of these blocks. Now each Jordan block has size at most
p, and so if p = 2, the partition into blocks is uniquely determined by their number
and the F
p
-dimension of M. However, if p 3 and dim(M) = 4, it is easy to
construct examples of linear transformations x and x
of M with the same number

of blocks but having dierent maximal sizes. (For instance, when dim(M) = 4, the
linear transformation x could have two blocks of size 2 while x
has a block of size 1

and a block of size 3.) Then the semidirect products G
1
= Mx and G
2
= Mx
29
have the same non-commuting graphs. In particular, there is a pair of such groups
of order p
5
for any p 3.
5 Solvable conjecture
We do not know if G is a nite non-abelian solvable group such that
G

=
H
for
some H, then H is also solvable.
Acknowledgement
This research was in part supported by a grant from IPM (No. 92050219).
References
[1] A. Abdollahi, S. Akbari, H. Dorbidi and H. Shahverdi, Commutativity pattern
of nite non-abelian p-groups determine their orders, Comm. Algebra, 41 No. 2
(2013) 451-461.
[2] A. Abdollahi, S. Akbari and H. R. Maimani, Non-commuting graph of a group,
J. Algebra, 298 (2006) 468-492.
[3] A. Abdollahi and H. Shahverdi, Non-commuting graphs of nilpotent groups, to
appear in Comm. Algebra.
[4] J. Cossey, T. Hawkes, A. Mann, A criterion for a group to be nilpotent, Bull.
London Math. Soc., 24 (1992) 327-332.
[5] M. R. Darafsheh, Groups with the same non-commuting graph, Discrete Applied
Math., 157 No. 4 (2009) 833-837.
[6] A. R. Moghaaddamfar, About noncommuting graphs, Siberian Math. J., 47 No.
5 (2006) 911-914.
30
The 6
th
The relative nth nilpotency degree of two subgroups
of a nite group
Muhanizah Abdul Hamid
1
, Nor Muhainiah Mohd Ali
2
, Nor Haniza
Sarmin
3
and Ahmad Erfanian
4
1,2,3
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi
Malaysia, 81310 UTM Johor Bahru, Johor, Malaysia
muhanizah.maths@gmail.com
1
, normuhainiah@utm.my
2
, nhs@utm.my
3
4
Department of Mathematics, Faculty of Mathematical Sciences, Ferdowsi University of
Mashhad, Mashhad, Iran
erfanian@um.ac.ir
Abstract
The commutativity degree of a group is the probability that
two randomly chosen elements of G commute. The concept
of commutativity degree is then extended to the relative
commutativity degree of a group, which is dened as the
probability that two arbitrary elements one in H and an-
other in G commute. Similarly, we can extend it to two
arbitrary elements one in H and another in K, where H
and K are two subgroups of G. In this research, the rel-
ative commutativity degree concept is further extended to
the relative n-th nilpotency degree of two subgroups of a
group G which is dened as the probability that the com-
mutator of two arbitrary elements h H and k K belong
to Z
n
(G), where Z
n
(G) is the nth central series of G. We
give some upper and lower bounds for the about probability
and compute it for some known groups.
Speaker
2010 Mathematics Subject Classication. Primary 16U80; Secondary 20F99, 20D15.
Key words and phrases. Commutativity degree, relative commutativity degree, relative n-th
nilpotency degree of two subgroups.
31
1 Introduction
The theory of commutativity degree in group theory is one of the oldest areas in
group theory and plays a major role in determining the abelianness of the group.
It has been attracted by many researchers and it is studied in various directions.
Many papers give explicit formulas of the commutativity degree of G denoted by
P(G) for some particular nite groups G. The concept of commutativity degree
can be generalized and modied in many directions. For instance, commuting of an
element of a subgroup H with an element of G or even commuting of two elements
on in subgroup H and another in subgroup K of G ; or by changing the role of
commuting the rst element in subgroup H to the n-th power of such element. One
dierent way of generalization of commutativity degree is to replace the notion of
commutativity by nilpotency class n. It is clear that if n = 0 then two concepts of
nilpotency class 0 and commutative are concide. So, we may associate parameter n
to this kind of generalization of commutativity degree. First, let us remind that if
G is a nite group, then the commutativity degree of G, denoted by P(G), is the
probability that two randomly chosen element of G commute. The rst appearance
of this concept was in 1944 by Miller [5]. Then, the idea to compute P(G) for
symmetric groups has been introduced by Erdos and Turan [3] at the end of the 60s.
For any nite group G and its subgroup H, the relative commutativity degree
of G denoted by P
G
(H, G), is dened as the probability for an element of H and an
element of G commute. This concept was rst introduced by Erfanian et al. in [3].
Similarly, if K is another subgroup of G then we may extend it as the probability
for an element of H commute to an element of K which is denoted by P
G
(H, K).
This probability is called the relative commutativity degree of two subgroups H and
K of a group G which can be written as
P
G
(H, K) =
|{(h, k) H K|hk = kh}|
|H| |K|
.
In 2011, Erfanian et al. [4] dened the relative n-th commutativity degree de-
noted by P
n
(H, G) as the probability that the n-th power of a random element of H
commutes with a random element of G. Now, we are going to give a generalization
of commutativity degree, relative commutativity degree of a subgroup and relative
commutativity degree of two subgroups in a dierent way as the following. For any
group G and two subgroups H and K of G dene
P
nil(G)
(n, H, K) =
|{(h, k) H K|[h, k] Z
n1
(G)}|
|H| |K|
,
32
which is called the relative n-th nilpotency degree of two subgroups H and K in G.
If K = G then is denoted by P
nil(G)
(n, H, G) and called the relative n-th nilpotency
degree of subgroup H in G and if H = K = G then is denoted by P
nil(G)
(n, G) and
called the n-th nilpotency degree of G. It is clear that if n = 1 then P
nil(G)
(1, G) =
P(G), P
nil(G)
(1, H, G) = P
G
(H, G) and P
nil(G)
(1, H, K) = P
G
(H, K). Morover,
P
nil(G)
(n, G) = 1 if and only if G is nilpotent of class n. Also, if H Z
n
(G) then
P
nil(G)
(n, H, G) = 1.
2 Main results
The following theorems give a lower and upper bound for the above probabilties.
Theorem 2.1. Let G be a nite group, H be a subgroup and p is the smallest prime
number dividing the order of G. Then for every n 1
|Z
n
(G)|
|G|
+
p(|G| |Z
n
(G)|)
|G|
2
P
nil(G)
(n, G)
|H| +|Z
n
(G)|
2 |H|
.
We can also improve it for P
nil(G)
(n, H, G) and P
nil(G)
(n, H, K).
Theorem 2.2. If G is a nite group and H is a subgroup of G. Then for every
n 1
|Z
n
(G) H|
|G|
+
p(|H| |Z
n
(G) H|)
|G|
2
P
nil(G)
(n, H, G)
|H| +|Z
n
(G) H|
2 |H|
,
where p is the smallest prime number dividing the order of G.
The following theorem gives a comparison of the probability of G and
G
N
.
Theorem 2.3. Let G be a nite group, H and N be subgroups of G such that
N H. If N is normal then for every n 1
P
nil(G)
(n, H, G) P
nil(
G
N
)
(n,
H
N
,
G
N
)P
nil(N)
(n, N).
Finally, we state some evaluations ofthe above probabilities for some small groups
and small values of n through the group theory package GAP.
33
Acknowledgement
The authors would like to thank Universiti Teknologi Malaysia (UTM) for the -
nancial funding through the Research University Grant (RUG) Vote No. 04H13
and UTM Mobility Program. The rst author would also like to thank Ministry of
Education (MOE) Malaysia for her MyPhD Scholarship.
References
[1] D. S. Dummit and R. M. Forte, Abstract Algebra, Third Edition, USA. John
Wiley and Sons, Inc., 2004.
[2] P. Erdos, and P. Turan, On some problems of a statistical group theory, IV, Acta
Math. Acad Sci. Hungaricae, 19 (1968), 413-435.
[3] A. Erfanian, B. Tolue and N. H. Sarmin, Some considerations on the n-th com-
mutativity degrees of nite groups, Ars Combinatorial Journal. Press, 2011.
[4] A. Erfanian and B. Tolue, Relative non nill-n graphs of nite groups, ScienceAsia
38 (2012), no 1, 201 - 206.
[5] A. Erfanian, R. Rezaei and P. Lescot, On the relative commutativity degree of a
subgroup of a nite group, Communications in Algebra, 35 (2007), 4183-4197.
[6] G. Miller, A relative number of non-invariant operators in a group, Proc. Nat.
Acad. Sci. USA, 30 (1944), no. 2, 25-28.
34
The 6
th
Generalize commutator on polygroups and hypergroups
Gholamhossien Aghabozorgi
1
, Morteza Jafarpour
1
and Bijan Davvaz
2
1
Department of Mathematics, Vali-e-Asr University of Rafsanjan, Rafsanjan, Iran
h.aghabozorgi@vru.ac.ir, m.j@vru.ac.ir
2
Department of Mathematics, Yazd University, Yazd, Iran
davvaz@yazduni.ac.ir
Abstract
The purpose of this paper is to provide a detailed structure
description of derived subpolygroups of polygroups. We in-
troduce the concept of perfect and solvable polygroups and
we give some results in this respect.
1 Introduction
Hyperstructure theory was born in 1934 at the 8th congress of Scandinavian Math-
ematicions, where Marty introduced the hypergroup notion as a generalization of
groups and after, he proved its utility in solving some problems of groups, algebraic
functions and rational fractions. Surveys of the theory can be found in the books
of Corsini [3], Davvaz [4], Corsini and Leoreanu [4]. In the following we generalize
Commutator and dened derived subpolygroup. We recall here some basic notions
of hypergroup theory.
Let H be a non-empty set and P
(H) be the set of all non-empty subsets of

H. Let be a hyperoperation (or join operation) on H, that is, is a function from
H H into P
(H). If (a, b) H H, its image under in P
(H) is denoted by
a b. The join operation is extended to subsets of H in a natural way, that is, for
non-empty subsets A, B of H, A B = {ab | a A, b B}. The notation a A is
Speaker
2010 Mathematics Subject Classication. 20N20.
Key words and phrases. Hypergroup, Polygroup, derived subpolygroup, solvable polygroup,
Commutator.
35
used for {a} A and A a for A {a}. Generally, the singleton {a} is identied with
its member a. The structure (H, ) is called a semihypergroup if a (b c) = (a b) c
for all a, b, c H, which means that
uxy
u z =
vyz
x v,
and is called a hypergroup if it is a semihypergroup and aH = Ha = H for all a H.
A hypergroup P is called polygroup and is denoted by P, , e, 1 if the following
conditions hold:
(1) P has a scalar identity e (i.e., e x = x e = x, for every x P);
(2) every element x of P has a unique inverse x
1
in P;
(3) x y z implies y x z
1
and z y
1
x.
A non-empty subset K of a polygroup P, , e, 1 is a subpolygroup of P if x, y K
implies x y K, and x K implies x
1
K. A subpolygroup N of a polygroup
P, , e, 1 is normal in P if x
1
N x N, for all x P.
2 Derived subhypergroups
In this section, we introduce and analyze a new denition for derivative of a hyper-
group H.
Denition 2.1. Let H be a hypergroup. We dene
(1) [x, y]
r
= {h H |x y y x h = } ;
(2) [x, y]
l
= {h H |x y h y x = } ;
(3) [x, y] = [x, y]
r
[x, y]
l
.
From now on we call [x, y]
r
, [x, y]
l
and [x, y] right commutator x and y, left
commutator x and y and commutator x and y, respectively. Also, we will denote
[H, H]
r
, [H, H]
l
and [H, H] the set of all right commutators, left commutators and
commutators, respectively.
Proposition 2.2. If H be a group, then [y, x]
1
r
= [x, y]
r
= [x
1
, y
1
]
l
= [y
1
, x
1
]
1
l
,
for every x, y in H.
36
Example 2.3. Suppose that H = {e, a, b}. Consider the hypegroup (H, ), where
is dened on H as follows:
e a b
e a, b e e
a e a b
b e a, b a, b
It is easy to see that {a} = [a, a]
r
= [a, a]
l
= {a, b} = [a
1
, a
1
]
l
, where a
1
is
the inverse of a in H.
Proposition 2.4. If H is a commutative hypergroup, then [x, y]
r
= [x, y]
l
= [x, y],
for all (x, y) H
2
.
Let X be a nonempty subset of a polygroup P, , e, 1. Let {A
i
| i J} be
the family of all subpolygroups of P in which contain X. Then
iJ
A
i
is called the
subpolygroup generated by X. This subpolygroup is denoted by < X > and we
have < X >= {x
1
1
. . . x
k
k
| x
i
X, k N,
i
{1, 1}}. If X = {x
1
, x
2
, . . . , x
n
},
then the subpolygroup < X > is denoted < x
1
, x
2
, . . . , x
n
>. In a special case
< [P, P]
r
>, < [P, P]
l
> and < [P, P] > are shown by P
r
, P
l
and P
, respectively.
Proposition 2.5. Let P, , e, 1 be a polygroup (x, y) P
2
. Then,
(1) [x, y]
r
= [x
1
, y
1
]
l
;
(2) P
= P
r
= P
l
;
(3) x P
x
1
P
.
Corollary 2.6. If P, , e, 1 is a polygroup, then P
is a subpolygroup of P.
From now on we call P
the derived subpolygroup of P.

Proposition 2.7. Let P, , e, 1 be a polygroup. Then, P
= {e} if and only if P

be an abelian group.
Denition 2.8. A polygroup P is called perfect if and only if P
= P.
Denition 2.9. A polygroup P is called solvable if and only if P
(n)
=
P
, for some
n N, where P
(1)
= P
, P
(n+1)
= (P
(n)
)
and
P
is heart of polygroup P.
Proposition 2.10. Every non-trivial perfect group is not solvable.
In the following, we show that the above proposition is not true for the class of
polygroups.
37
Example 2.11. Suppose that P = {e, a, b, c}. Consider the commutative polygroup
P, , e, 1, where is dened on P as follows:
e a b c
e e a b c
a a P a, b, c a, b, c
b b a, b, c P a, b, c
c c a, b, c a, b, c P
We can easily see that P is a perfect and solvable polygroup. Notice that P
= P =
P
.
Example 2.12. Suppose that P = {e, a, b, c}. Consider the non-commutative poly-
group P, , e, 1, where is dened on P as follows:
e a b c
e e a b c
a a a P c
b b e, a, b b b, c
c c a, c c P
In this case, we can see that P
= P =
P
.
Example 2.13. (Double coset algebra) Suppose that H is a subgroup of a group
G. Dene a system
G//H = {HxH|x G}, , H, I,
where (HxH)
I
= Hx
1
H and (HxH) (HyH) = {HxhyH|h H}. The algebra
of double cosets G//H is a polygroup.
Theorem 2.14. Let (G, ) be a group and H be a subgroup of G. We set HG
H =
{HgH|g G
}. Then,
(1) HG
H (G//H)
;
(2) If G
H = G then (G//H) is a perfect polygroup;

(3) If HG
H = (G//H) then G
H = G.
References
[1] H. Aghabozorgi, B. Davvaz and M. Jafarpour, Solvable polygroups and derived
subpolygroups, Comm. Algebra, 41(8)(2013) 3098-3107.
38
[2] H. Aghabozorgi, B. Davvaz and M. Jafarpour, Nilpotent groups derived from
hypergroups. J. Algebra 382 (2013) 177-184.
[3] P. Corsini, Prolegomena of Hypergroup Theory, Aviani Editore, Tricesimo, 1993.
[4] P. Corsini and V. Leoreanu, Applications of Hyperstructure Theory, Kluwer Aca-
demical Publications, Dordrecht, 2003.
[5] B. Davvaz, Polygroup Theory and Related Systems, World Scientic, 2013.
39
The 6
th
Some solved and unsolved problems in loop theory
Karim Ahmadidelir
Department of Mathematics, College of Basic Sciences, Tabriz Branch, Islamic Azad
University, Tabriz, Iran
kdelir@gmail.com, k ahmadi@iaut.ac.ir
Abstract
In this talk, we consider some solved and unsolved problems
in the theory of loops and quasigroups and disscuss about
recent progresses and advances or improvements of them.
Some of them are long-standing and well-known problems
that newly have been solved and developed the theory and
some of them are the existing theorems in group theory that
have been generalized to some special kinds and classes of
loops. On the other hand, there have been achievements and
improvements in some of unsolved problems in recent years
that opened new horizons in the theory.
1 Introduction
A set Q with one binary operation is a quasigroup if the equation xy = z has a unique
solution in Q whenever two of the three elements x, y, z Q are specied. Loop is
a quasigroup with a neutral element 1 satisfying 1x = x1 = x for every x. Moufang
loops are loops in which any of the (equivalent) Moufang identities ((xy)x)z =
x(y(xz)), x(y(zy)) = ((xy)z)y, (xy)(zx) = x((yz)x), (xy)(zx) = (x(yz))x holds.
Moufang loops are certainly the most studied loops. They arise naturally in al-
gebra (as the multiplicative loop of octonions), and in projective geometry (Moufang
planes), for example. Although Moufang loops are generally nonassociative, they
retain many properties of groups that we know and love. For instance: (i) every x
2010 Mathematics Subject Classication. 20N05.
Key words and phrases. Theory of loops and quasigroups, Moufang loops, Bol loops, Bruck
loops, A-loops.
40
is accompanied by its two-sided inverse x
1
such that xx
1
= x
1
x = 1, (ii) any
two elements generate a subgroup (this property is called diassociativity), (iii) in
nite Moufang loops, the order of an element divides the order of the loop, and it
has been shown recently in [4] that the order of a subloop divides the order of the
loop, (iv) every nite Moufang loop of odd order is solvable.
On the other hand, many essential tools of group theory are not available for
Moufang loops. The lack of associativity makes presentations very awkward and
hard to calculate, and permutation representations in the usual sense impossible.
The other most studied classes of loops are: Bol loops, Bruck loops, Osborn loops,
RS-loops, A-loops. In this talk, we consider some solved and unsolved problems
about these special classes of loops and disscuss about recent progresses and advances
or improvements of them.
2 Basic concepts
Let Q be a loop with neutral element 1. We dene:
Left multiplcation operator by: L
x
: Q Q; y x y;
Right multiplcation operator by: R
x
: Q Q; y y x,
(L
x
and R
x
are bijections of Q)
Commutator of x and y by: = [x, y] : xy = (yx) [x, y];
Associator of x, y and z by: = [x, y, z] : (xy)z = x(yz) [x, y, z];
Commutant of a subset S of Q by: {x Q | xs = sx, s S};
Center of Q by: Z(Q) = {x Q | [x, y] = [x, y, z] = [y, x, z] = 1};
Multiplication group of Q by: Mlt(Q) = L
x
, R
x
| x Q;
Inner mapping group of Q by: Inn(Q) = {f Mlt(Q) | f(1) = 1};
A subloop S Q is normal if f(S) = S for every f Inn(Q);
The nucleus Q by: {x | x(yz) = (xy)z, y(xz) = (yx)z, y(zx) = (yz)x, y, z
Q;
A loop Q is solvable if there is a series 1 = Q
0
Q
1
Q
m
= Q such that
Q
i+1
Q
i
is an abelian group for every i;
p-loops by: Loops of order p
k
, p a prime;
41
A nite Moufang loop Q is a p-loop if and only if every element of Q has order
that is a power of p;
A loop Q is (centrally) nilpotent if the sequence Q,
Q
Z(Q)
,
Q
Z(Q)
Z(
Q
Z(Q)
)
, . . . eventually
yields the trivial loop;
Let Q be a centrally nilpotent p-loop. The Frattini subloop (Q) of Q is the
intersection of all maximal subloops of Q;
An isotopism of loops Q
1
, Q
2
is a triple (, , ) of bijections Q
1
Q
2
such
that (x)(y) = (xy) holds for every x, y Q
1
;
G-loop: all isotopes of a loop Q are isomorphic to Q;
Right Bol loops: the loops are given by the right Bol identity x((yz)y) =
((xy)z)y (Left Bol loops are dened analogously);
Bruck loop or Kloop: a Bol loop satisfying the automorphic inverse property,
(ab)
1
= a
1
b
1
for all a, b in Q.
We refer the reader to [1] and [6] for a systematic introduction to the theory of
loops.
3 Some open problems about Moufang loops
Problem: Let p and q be distinct odd primes. If q is not congruent to 1 modulo p,
are all Moufang loops of order p
2
q
3
groups? What about pq
4
? (Proposed by Andrew
Rajah at Loops 99, Prague 1999)
Comments: The former has been solved by Rajah and Chee (2011) where they
showed that for distinct odd primes p
1
< < p
m
< q < r
1
< < r
n
, all Moufang
loops of order p
2
1
p
2
m
q
3
r
2
1
r
2
n
are groups if and only if q is not congruent to 1
modulo p
i
for each i.
Phillips problem: (Odd order Moufang loop with trivial nucleus) Is there a Mo-
ufang loop of odd order with trivial nucleus? (Proposed by Andrew Rajah at Loops
03, Prague 2003)
Problem: (Presentations for nite simple Moufang loops) Find presentations for
all nonassociative nite simple Moufang loops in the variety of Moufang loops. (Pro-
posed by P. Vojtechovsk y at Loops 03, Prague 2003)
Comments: It is shown in (Vojtechovsk y, 2003) that every nonassociative nite
simple Moufang loop is generated by 3 elements, with explicit formulas for the
generators.
42
Conjecture: (The restricted Burnside problem for Moufang loops) Let M be a
nite Moufang loop of exponent n with m generators. Then there exists a function
f(n, m) such that |M| < f(n, m). (Proposed by Alexander Grishkov at Loops 11,
Tret 2011)
Comments: In the case when n is a prime dierent from 3 the conjecture was
proved by Grishkov. If p = 3 and M is commutative, it was proved by Bruck. The
general case for p = 3 was proved by G. Nagy. The case n = p
m
holds by the
Grishkov-Zelmanov Theorem.
Conjecture: (The Sanov and M. Hall theorems for Moufang loops) Let L be a
nitely generated Moufang loop of exponent 4 or 6. Then L is nite. (Proposed by
Alexander Grishkov at Loops 11, Tret 2011)
Conjecture: Let L be a nite Moufang loop and (L) Frattini subloop of L. Then
(L) is a normal nilpotent subloop of L. (Proposed by Alexander Grishkov at Loops
11, Trest 2011)
Conjecture: (Torsion in free Moufang loops) Let MF
n
be the free Moufang loop
with n generators. MF
3
is torsion free but MF
n
with n 4 is not. (Proposed by
Alexander Grishkov at Loops 03, Prague 2003)
Problem: (Minimal presentations for loops M(G, 2)) Find a minimal presentation
for the Moufang loop M(G, 2) with respect to a presentation for G. (Proposed by P.
Vojtechovsk y at Loops 03, Prague 2003)
Comments: Chein showed in (Chein, 1974) that M(G, 2) is a Moufang loop that is
nonassociative if and only if G is nonabelian. Vojtechovsk y (2003) found a minimal
presentation for M(G, 2) when G is a 2generated group.
4 Some solved and Open problems about Bol loops
Remark 4.1. We have the following implications:
Right Bol loops = Right and left Bol loops = Moufang loops = groups.
Problem: (Existence of a nite simple Bol loop) Is there a nite simple Bol loop
that is not Moufang? (Proposed at: Loops 99, Prague 1999, Solved by: Gbor P.
Nagy, 2007)
Solution: A simple Bol loop that is not Moufang will be called proper. There are
several families of proper simple Bol loops. A smallest proper simple Bol loop is of
order 24 [Nagy 2008]. There is also a proper simple Bol loop of exponent 2 [Nagy
2009], and a proper simple Bol loop of odd order [Nagy 2008].
Comments: The above constructions solved two additional open problems:
Problem: Is there a nite simple Bruck loop that is not Moufang? Yes, since any
proper simple Bol loop of exponent 2 is Bruck.
43
Problem: Is every Bol loop of odd order solvable? No, as witnessed by any proper
simple Bol loop of odd order.
Problem: (Left Bol loop with trivial right nucleus) Is there a nite non-Moufang
left Bol loop with trivial right nucleus? (Proposed at Milehigh conference on quasi-
groups, loops, and nonassociative systems, Denver 2005, Solved by: Gbor P. Nagy,
2007)
Solution: There is a nite simple left Bol loop of exponent 2 of order 96 with
trivial right nucleus. Also, using an exact factorization of the Mathieu group M
24
,
it is possible to construct a non-Moufang simple Bol loop which is a Gloop.
Problem: (Nilpotency degree of the left multiplication group of a left Bol loop)
For a left Bol loop Q, nd some relation between the nilpotency degree of the left
multiplication group of Q and the structure of Q. (Proposed at Milehigh conference
on quasigroups, loops, and nonassociative systems, Denver 2005)
A loop is universally exible if every one of its loop isotopes is exible, that is,
satises (xy)x = x(yx). A loop is middle Bol if every one of its loop isotopes has
the antiautomorphic inverse property, that is, satises (xy)
1
= y
1
x
1
.
Problem: (Universally exible loop that is not middle Bol) Is there a nite, uni-
versally exible loop that is not middle Bol? (Proposed by Michael Kinyon at Loops
03, Prague 2003)
Problem: (Finite simple Bol loop with nontrivial conjugacy classes) Is there a
nite simple nonassociative Bol loop with nontrivial conjugacy classes? (Proposed
by Kenneth W. Johnson and Jonathan D. H. Smith at the 2nd Mile High Conference
on Nonassociative Mathematics, Denver 2009)
5 Other problems
Much more problems about special kinds of loops have been solved or modied
recently and published in various journals those will be presented and discussed in
this talk, such as: a problem about Enumerating Nilpotent Loops up to Isotopy, by L.
Clavier (2012); a problem about dierences and similarities between Bruck loops and
nite groups: Do nite Bruck loops behave like groups?, by B. Baumeister (2012);
a problem about On RS-loops by P. Sclifos (2011); a problem about Necessary
conditions for the existence of the nite Osborn loop with trivial nucleus by T.G.
Jaiyeola, J.O. Adeniran and A.R.T. Solari, (2011); a problem about Universality of
Osborn loops by M. Kinyon (2005); a problem about Associativity of automorphic
loops of order p
2
by P. Csorgo (2013).
44
References
[1] R.H. Bruck, A survey of binary systems, Springer-Verlag, 1958.
[2] O. Chein, A. Rajah, Possible orders of nonassociative Moufang loops, Comment.
Math. Univ. Carolin., 41, (2000) 237-244.
[3] S. M. Gagola III, Halls theorem for Moufang loops, J. Algebra, 323, N12 (2010)
3252-3262.
[4] A.N. Grishkov, A.V. Zavarnitsine, Lagranges theorem for Moufang loops, Math.
Proc. Camb. Phil. Soc., 139, N1 (2005) 4157.
[5] A.N. Grishkov, A.V. Zavarnitsine, Sylows theorem for Moufang loops, J. Algebra,
321, No. 7, (2009) 18131825.
[6] H.O. Pugfelder, Quasigroups and loops: Introduction, Heldermann Verlag,
Berlin, 1990.
45
The 6
th
Inequality for the number of generators of the
cnilpotent multiplier
Mahboubeh Alizadeh Sanati
1
and Zahra Mahdipour
2
1
Department of Mathematics, Faculty of Sciences, Golestan University, Gorgan, Iran
m.alizadeh@gu.ac.ir
2
zahramahdipour@yahoo.com
Abstract
In this paper, we are going to prove that an inequality for
minimal number generators of cnilpotent multiplier, to the
following form
d
_
N
c
M(G))
_
>
n
2
4
n,
where, n is the minimal number of generators of G.
1 Introduction
I. Schur [5], in 1904, using projective representation theory of groups, introduced the
notion of multiplier of a nite group. It was known later that the Schur multiplier
had a relation with homology and cohomology of groups. In fact, if G is a nite
group, then
M(G)

= H
2
(G, C
) and M(G)

= H
2
(G, Z),
where M(G) is Schur multiplier of G, H
2
(G, C
) is the second cohomology of G with

coecient in C
(for more details see [2]). Let

1 R F G 1 ,
Speaker
2010 Mathematics Subject Classication. Primary 20E10; Secondary 20F18.
Key words and phrases. cnilpotent multiplier, The number of generators of the cnilpotent
multiplier.
46
be a free presentation for G, in which F is free group, Then
M(G)

= (R
)/[R, F],
this quotient group is independent from the choice of the free presentation of G.
Denition 1.1. Let F
be free group on a countably innite set {x

1
, x
2
, . . .} and
V be an arbitrary subset of F. Suppose that v = x
i
1
l
1
. . . x
ir
lr
V where l
j
= 1,
1 j r and y
1
, . . . , y
t
be distinct elements in x
l
1
, , x
lr
. Consider t arbitrary
distinct elements g
1
, , g
t
G. By uniformly placement g
i
instead of x
i
j
, obtaine
some element of G that is said to be the value of the word v at (g
1
, . . . , g
t
). The
subgroup of G generated by all values in G of words in V is called the verbal subgroup
of G determined by V (G),
V (G) = v (g
1
, g
2
, . . . , g
n
) | g
i
G, 1 i n, n N, v V .
Also the class of groups with respect to V , i.e V = {G|V (G) = 1}, is called the
variety, (see [4] for more details).
R. Baer [4], in 1945 generalized the notion of Schur multiplier to Baer-invariant
as follows
VM(G) =
R
V (F)
[RV
F]
,
where V (F) is the verbal subgroup of F with respect to V, and
[RV
F] =< v(f
1
, . . . , f
i1
, f
i
r, f
i+1
, . . . , f
n
)v(f
1
, . . . , f
i
, . . . , f
n
)
1
|
r R , f
i
F, v V , 1 i n , n N > .
It can be proved that the Baer-invariant of a group G is independent of the
choice of the presentation of G and it is always an abelian group [3]. In particular,
if V = [x, y] and V is the variety of abelian groups, A
b
, then the Baer-invariant of
G will be (R
)/[R, F], the Schur-multiplier of G.

In special case, for any c N, when V = [x
1
, , x
c+1
], V is the variety of
nilpotent groups of the class at most c 1, N
c
, then the Baer-invariant of G with
respect to [x
1
, , x
c+1
] which is called the c-nilpotent multiplier of G will be
N
c
M(G) = R
c+1
(F)/[R,
c
F],
where
c+1
(F) is the (c + 1)-st term of the lower central series of F and [R,
1
F] =
[R, F], [R,
c
F] = [[R,
c1
F], F], inductively.
47
2 Main results
Theorem 2.1. Suppose that G be a p-group and d, be the minimal number of
generators of G and G =
g
1
, ..., g
d
. G is generated by k relations, thus k >

d
2
4
.
Theorem 2.2. Let

R =
R
R
R
p
, where

R is K[F]- or K(G)-rightmodul. Also
(rR
R
p
)
f
= r
f
R
R
p
or (rR
R
p
)
g
= r
f
R
R
p
, for each g = Rf G and r R.
Let r
is minimal number of generators of

R. Thus k r
.
By theorems we can conclude that r
>
d
2
4
. ([1])
Proposition 2.3. (I. Schur [5]) Let G be a group, F be a free group of rank n and
G F/R. Also, the following relations hold
D = F/[R,
c
F] and H = R/[R,
c
F].
Then H = S N
c
M(G), such that D/S is V-covering of G, where V is the variety
of nilpotent groups of the class at most c 1.
Proof. H = S N
c
M(G). Set K = D/S and T = H/S. So
(i) T Z
n
(K) because
[R, F][R,
c
F]
[R,
c
F]

F
R
G,
also
T = H/S = N
c
M(G)S/S
c+1
(D)S/S =
c+1
(K),
thus T
c+1
(K) Z
n
(K).
(ii) K/T D/H G.
(iii) T N
c
M(G).
Hence K is V-covering of G, where V is the variety of nilpotent groups of the
class at most c 1.
Theorem 2.4. Let G be a nite group. Then
d
_
N
c
M(G)
_
>
d(G)
2
4
d(G).
48
Proof. Suppose that G be a group, generated by elements g
1
, , g
n
and relations
r
1
, , r
k
. If F be free group by free generators f
1
, , f
n
, then G F/R, where
R = r
f
i
i = 1, , k, f F. Abelian group H =
R
_
R,
c
F
is generated by elements
r
i
_
R,
c
F
, (i = 1, , k).
By proposition 2.3, we can write H = N
c
M(G) S, where S is free abelian group
of rank n. Assume that d, be minimal number generators. Hence d + n k or
d k n, therefore n k. Now, consider G be a pgroup and n = d(G) be
minimal number generators of G. So N
c
M(G) is a pgroup, also and we have
R
R
p
_
R,
c
F

H
H
p

N
c
M(G)
_
N
c
M(G)
_
p

S
S
p
,
Thus, for number generators, we can write
d
_
R
R
p
[R,
c
F]
_
= d(
N
c
M(G)
_
N
c
M(G)
_
p
) +d(
S
S
p
) = d
_
N
c
M(G)
_
+n.
We consider r
, be minimal number generators

R
R
p
R
as G-module. So by theorem
2.1 and by theorem 2.2 we have r
>
n
2
4
. Also, we have r
d
_
R
R
p
_
R,
c
F
_
and so
we prove as follows for n 4
d
_
N
c
M(G))
_
r
n >
n
2
4
n 0.
References
[1] B. Huppert, Endliche Gruppen I. Springer-Verlag, Berlin-Heidelberg-New York.
1967.
[2] G. Karpilovsky, The Schur Multiplier, London Math. Soc. Monographs, New
Series no. 2, 1987.
[3] C. R. Leedham-Green and S. McKay, Baer-invariant, isologism, varietal laws
and homology. Acta Math. 137 (1976), 99 -150.
[4] H. Neumann, Varieties of Groups, Springer-Verlag, Berlin, Heidelberg, New
York, 1967.
[5] I. Schur,

Uber die darstellung der endlichen gruppen durch gebrochene lineare
substitutionen, J. F ur Math. 127 (1904), 20-50.
49
The 6
th
Characterization of
2
D
n
(2) by the set of orders of
maximal abelian subgroups
Bahareh Asadian
1
and Neda Ahanjideh
2
Department of Mathematics, Faculty of Mathematical Sciences, Shahrekord University,
Shahrekord, Iran
1
asadian.bahare@stu.sku.ac.ir
2
ahanjideh.neda@sci.sku.ac.ir
Abstract
Let G be a nite group and M(G) be the set of orders of
maximal abelian subgroups of G. Let n 15. In this talk,
we prove that if M(G) = M(
2
D
n
(2)), then G

=
2
D
n
(2).
1 Introduction
Throughout this paper, p is a prime number, q = p
k
and G is a nite group. We
denote by (G) the set of prime divisors of the order of G. The prime graph
GK(G) of G is the graph with vertex set (G), where two distinct primes r and s
are joined by an edge (we write (r, s) GK(G)) if G contains an element of order
rs. An independent set in a graph is a set of pairwise non-adjacent vertices.
(G) ((r, G)) denotes the independent set in GK(G) (containing a prime r) with
a maximal number of vertices. Let t(G) = |(G)| and t(r, G) = |(r, G)|. We use
a | n when a is a divisor of n and use |n|
a
= a
e
, when a
e
|| n, i.e., a
e
| n but
a
e+1
n. If a is a natural number, r is an odd prime number and gcd(r, a) = 1,
then by e(r, a) we denote the minimal natural number n with a
n
1 (mod r).
The prime r with e(r, a) = m is called a primitive prime divisor of a
m
1. We
denote by r
m
(a) some primitive prime divisor of a
m
1. If a is odd, then let
Speaker
2010 Mathematics Subject Classication. Primary 20D06; Secondary 20D20.
Key words and phrases. Maximal abelian subgroup, prime graph, maximal independent set.
50
e(2, a) = 1 if a 1 (mod 4) and let e(2, a) = 2 if a 1 (mod 4). By Fermats
little theorem, e(r, a) | r 1. Also, if a
n
1 (mod r), then e(r, a) | n. Put M(G) =
{|H| : H is a maximal abelian subgroup of G}. By a(G) and a
r
(G), we denote the
maximum number in M(G) and the order of the largest abelian subgroup of r-Sylow
subgroup of G, respectively. A nite group G is called characterizable by the set of
orders of maximal abelian subgroups, if each nite group H with M(G) = M(H) is
isomorphic to G. For instance, alternating group A
n
, where n and n 2 are primes
or n 10, is characterizable by the set of orders of its maximal abelian subgroups
(see [6]). In this paper, we prove that:
Main Theorem. Let G be a nite group and let n 15. If M(G) = M(
2
D
n
(2)),
then G

=
2
D
n
(2).
2 Main results
In the following, we have brought some useful lemmas which will be used during the
proof of the main theorem:
Lemma 2.1. [6] Let G and K be two nite groups such that M(G) = M(K). Then
the prime graph of G and the prime graph of K are same.
Lemma 2.2. [3, Theorem 1] Let G be a nite group with t(G) 3 and t(2, G) 2.
Then the following hold:
1. There exists a nite non-abelian simple group S such that S

G = G/K
Aut(S) for the maximal normal soluble subgroup K of G.
2. For every independent subset of (G) with || 3 at most one prime in
divides the product |K|.|
G/S|. In particular, t(S) t(G) 1.

3. One of the following holds:
(a) every prime r (G) non-adjacent to 2 in GK(G) does not divide the
product |K|.|
G/S|; in particular, t(2, S) t(2, G);

(b) there exists a prime r (K) non-adjacent to 2 in GK(G); in which case
t(G) = 3, t(2, G) = 2, and S

= A
7
or A
1
(q) for some odd q.
For a nite integer n, we dene the following function which will be used in some
following lemmas:
(n) =
_
n if n is odd;
n
2
otherwise.
51
Lemma 2.3. [4] Let G = D
n
(q) be a nite simple group of Lie type over a eld
of characteristic p. Suppose r and s are odd prime and r, s (D
n
(q))\{p}. Put
k = e(r, q), l = e(s, q), and 1 (k) (l). Then r and s are non-adjacent if and
only if 2.(k)+2.(l) > 2n(1(1)
k+1
) and l/k is not an odd integer. Moreover,
if = +, the chain of equalities n = l = 2(l) = 2(k) = 2k is not true as well.
Lemma 2.4. [4, Proposition 3.1] Let G = D
n
(q) , r (G) and r = p. Then
(r, p) GK(G) if and only if (e(r, q)) > n 2.
Proof of the main theorem. According to our assumption, M(G) = M(
2
D
n
(2))
and hence, Lemma 2.1 shows that GK(G) = GK(
2
D
n
(2)). Thus {2, r
2n
} (2,
2
D
n
(2)) =
(2, G), considering Lemma 2.4. Since t(G) 3 and t(2, G) = t(2,
2
D
n
(2)) 2,
Lemma 2.2(1) guarantees the existence of maximal solvable subgroup K of G and
a nite non-abelian simple group S such that S G = G/K Aut(S) and
t(S) t(G) 1. In [2], the authors show that S

=
2
D
n
(2). In the following,
we are going to show that K = 1. Let
= {r
2n
(2), r
2(n1)
(2), r
2(n2)
(2)}.
By Lemma 2.3, is an independent set and hence, by Lemma 2.2(2), there exists
t {r
2(n1)
(2), r
2(n2)
(2)} (
2
D
n
(2))
such that t (K). Let S
1
Syl
t
(
2
D
n
(2)). Since r
2n
(2) (2,
2
D
n
(2)), Lemma
2.2(3) implies that r
2n
(2) (
2
D
n
(2)) and r
2n
(2) (K). Let S
2
Syl
r
2n
(2)
(
2
D
n
(2)).
Obviously, S
1
and S
2
act co-primely on K. We claim that |K|
2
= 1. If not, then there
exist S
1
and S
2
-invariant 2-Sylow subgroups P
1
and P
2
of K. Therefore, Z(P
1
)S
1
and Z(P
2
)S
2
are subgroups of G. Applying Lemma 2.4 shows that (2, r
2n
(2))
GK(G) = GK(
2
D
n
(2)) and hence, r
2n
(2) | 2
m
1, where |Z(P
1
)| = |Z(P
2
)| = 2
m
.
So, 2n | m and hence, there exists a natural number l such that m = 2nl. If
|C
Z(P
2
)
(S
1
)| = 2
e
, then there is M(G) = M(
2
D
n
(2)) such that t2
e
| . Consid-
ering the elements of M(
2
D
n
(2)) shows that if t = r
2(n1)
(2), then 2
e
= 1 and if t =
r
2(n2)
(2), then 2
e
2
2
. Thus 2(nu) | 2nle = 2(nu)l+2ule, where u {1, 2}.
This forces 2(n u) < 2ul and hence, m n(n 2)/2. Therefore, 2
n(n2)/2
2
m
.
Since Z(p
2
) is an abelian subgroup of G, |Z(P
2
)| = p
m
a(G) = a(
2
D
n
(2)). But [5,
Table 2] shows that a(
2
D
n
(2)) = 2
(n1)(n2)
2
+2
, so
(n1)(n2)
2
+2 n(n2)/2, which
is a contradiction. We claim that |K| = 1. If not, then there is r (K) {2}.
Since M(G) = M(
2
D
n
(2)), a(
2
D
n
(2)) = a(G) is a power of 2. Thus there exists
an abelian 2-subgroup P of G such that |P| = a(G). We proved |K|
2
= 1, so P
acts co-primely on K and hence, we can see that K has a P-invariant r-Sylow sub-
group R. Let |Z(R)| = r
. Without loss of generality, we can assume that Z(R)

52
is an r-elementary abelian group. Also, P is abelian with |P| = a(G) and hence,
C
PZ(R)
(Z(R)) is abelian. Therefore, |C
PZ(R)
(Z(R))| = r
.p
< |P|. Also,

N
PZ(R)
(Z(R))
C
PZ(R)
(Z(R))
Aut(Z(R)) = GL
(r).
But considering the 2-Sylow subgroups of GL
(r) leads us to see that a

2
(GL
(r)) <
r
, so
|P|
p
< r
, which is a contradiction. This forces |K| = 1, as desired. This

implies that
2
D
n
(2) G Aut(
2
D
n
(2)). But Aut(
2
D
n
(2))

= PSO
2n
(2). Thus
either G

= PSO
2n
(2) or G

=
2
D
n
(2). If G

= PSO
2n
(2), then we can see that
2(2
n1
+ 1) M(G) = M(
2
D
n
(2)). This forces (2, r
2(n1)
(2)) GK(
2
D
n
(2)),
which is a contradiction with Lemma 2.4. Thus G

=
2
D
n
(2), so theorem follows.
References
[1] G.Y. Chen, A characterization of alternating groups by the set of orders of their
maximal abelian subgroups , Siberian Math. J. 47 (2006), no. 3, 300306.
[2] B. Khosravi, H. Moradi, Quasirecognition by prime graph of some orthogonal
groups over the binary elds, J. Algebra Appl. DOI: 10.1142/S0219498812500569.
[3] A.V. Vasil
,
ev, I.B. Gorshkov, On recognition of simple groups with connected
prime graph, Siberian Math. J. 50 (2009), no. 2, 233238.
[4] A.V. Vasil
,
ev, E.P. Vdovin, An adjacency criterian for the prime graph of a nite
simple group, Algebra and Logic. 44 (2005), no. 6, 381406.
[5] E.P. Vdovin, Maximal orders of abelian subgroups in nite Chevalley groups,
Mathematicheskie zametki. 69 (2001), no. 4, 524549.
53
The 6
th
A characterization of Sz(8) by nse
Soleyman Asgary
1
and Neda Ahanjideh
2
Department of pure Mathematics, Faculty of Mathematical Sciences, Shahrekord
University, Shahrekord, Iran
1
soleyman.asgary@yahoo.com,
2
Abstract
Let G be a group and
e
(G) be the set of element orders of G.
Suppose that k
e
(G) and m
k
is the number of elements of
order k in G. Set nse(G) := {m
k
: k
e
(G)}. In this paper,
we prove that if G is a group with nse(Sz(8)) = nse(G), then
G

= Sz(8).
1 Introduction
Denote by (G) the set of prime divisors of the order of G and the set of element
orders of G is denoted by
e
(G). A nite group G is called a simple K
n
-group, if G is
a simple group with |(G)| = n. For a group G and i
e
(G), set m
i
(G) = |{g G :
the order of g is i}|. In fact, m
i
(G) is the number of elements of order i in G and
nse(G) := {m
i
(G) : i
e
(G)}. For a nite group H and p (H), let n
p
(H) denote
the number of Sylow p-subgroups of H. We say that the group G is characterizable
by the set of nse if every group H with nse(G) = nse(H) is isomorphic to G. In [4],
it has been shown that the nite simple group A
5
is characterizable by its nse. In
this paper, we show that the nite simple group Sz(8), which is a simple K
4
-group
of order 2
6
.5.7.13 is characterizable by nse. In fact, the main result of this paper is
the following theorem:
Main theorem. If G is a group such that nse(G) = nse(Sz(8)), then G

= Sz(8).
Lemma 1.1. [1] Let G be a nite group and m be a positive integer dividing |G|.
If L
m
(G) = {g G | g
m
= 1}, then m | |L
m
(G)|.
Speaker
2010 Mathematics Subject Classication. Primary 20D05; Secondary 20D06, 20D20.
Key words and phrases. Set of the numbers of elements of the same order, element order, simple
Kn-groups.
54
Lemma 1.2. [4] Let G be a group containing more than two elements. If the
maximal number s of elements of the same order in G is nite, then G is nite and
|G| s(s
2
1).
Lemma 1.3. [3] Let G be a nite solvable group and |G| = mn, where m = p
1
1
...p
r
r
and (m, n) = 1. Let = {p
1
, ..., p
r
} and h
m
be the number of Hall -subgroups of
G. Then h
m
= q
1
1
...q
s
s
satises the following conditions for all i {1, 2, ...s}:
(1) q
i
i
1 (mod p
j
) for some p
j
;
(2) the order of some chief factor of G is divided by q
i
i
.
Lemma 1.4. [5] Let G be a simple K
4
-group. Then G is isomorphic to one of the
following groups:
(1) A
7
, A
8
, A
9
, A
10
;
(2) M
11
, M
12
, J
2
;
(3) one of the following simple groups:
(a) PSL(2, r), where r is a prime and satises r
2
1 = 2
a
.3
b
.v
c
with a, b, c 1
and v > 3 is a prime;
(b) PSL(2, 2
m
), where m 2 satises 2
m
1 = u and 2
m
+1 = 3t
b
, with u, t
are primes, t > 3 and b 1;
(c) PSL(2, 3
m
), where m 2 satises either 3
m
+ 1 = 4t and 3
m
1 = 2u
c
or 3
m
+ 1 = 4t
b
and 3
m
1 = 2u, with u, t are odd primes and b, c 1;
(4) one of the following 28 simple groups:
PSL(2, 16), PSL(2, 25), PSL(2, 49), PSL(2, 81), PSL(3, 4), PSL(3, 5), PSL(3, 7),
PSL(3, 8), PSL(3, 17), PSL(4, 3), PSp(4, 4), PSp(4, 5), PSp(4, 7), PSp(4, 9),
PSp(6, 2), O
+
8
(2), G
2
(3), PSU(3, 4), PSU(3, 5), PSU(3, 7), PSU(3, 8), PSU(3, 9),
PSU(4, 3), PSU(5, 2), Sz(8), Sz(32),
3
D
4
(2),
2
F
4
(2)
.
Lemma 1.5. Let G be a nite simple K
4
-group such that |G| | 2
6
.5.7.13, then
G

= Sz(8).
Proof. The proof is easy by Lemma 1.7.
Remark 1.6. Let G be a group with nse(G) = nse(Sz(8)). By Lemma 2.4, we can
see that G is nite. For n
e
(G), it is known that m
n
= k(n), where k is the
number of cyclic subgroups of order n in G and if n > 2, then (n) is even, so m
n
55
is even. Thus if m
n
nse(G) is odd, then n = 2. If n
e
(G), then by Lemma 1.10
and the above notation, we have:
_
_
(n) | m
n
n |
d|n
m
d
. (1)
2 Main results
Theorem 2.1. If G is a group such that nse(G) = nse(Sz(8)), then G

= Sz(8).
Proof. By Remark 1.23, G is a nite group and by [2], we can see that
nse(G) = nse(Sz(8)) = {1, 455, 3640, 5824, 12480, 6720}. (2)
We are going to prove that (G) {2, 5, 7, 13}. Since 455 nse(G), by Remark
1.23, 2 (G) and m
2
= 455. Furthermore, if n
e
(G) {4, 5, 7, 13}, then we
obtain
(n, m
n
(G)) {(4, 3640), (5, 5824), (7, 12480), (13, 6720)},
by (1). Let 2 = p (G). Then by (1), p | (1 + m
p
) and (p 1) | m
p
, so checking
the elements of nse(G) in (2) implies that p {5, 7, 11, 13, 3641, 6721, 12481}. If
11 (G), then by (1), m
11
{3640, 6720}. If 11
r

e
(G), then (11
r
) = 10.11
r1
|
m
11
r . So we can see that r = 1 and hence, exp(P
11
) = 11, which shows that
|P
11
||(1 + m
11
). Therefore |P
11
| = 11. Let m
11
= 3640. It is easy to see that
2.11
e
(G). This shows that the Sylow 11-subgroup P
11
of G acts xed point
freely on the set of the elements of order 2, so |P
11
| | m
2
= 455, which is impossible.
Thus 11 (G). If m
11
= 6720, then similar to the above we can get a contradiction.
Therefore 11 (G). Similarly we can see that 3641, 6721, 12481
e
(G).
1) If 2
i

e
(G), then (2
i
) = 2
i1
| m
2
i and hence, checking the elements of (2)
shows that 1 i 6. Since 2 (G) and exp(P
2
) = 2
i
= 2, 4, 8, 16, 32, 64, Lemma
1.10 leads us to see that |P
2
||2
12
.
2) If 5
j

e
(G), then (5
j
) = 4.5
j1
| m
5
j and hence, checking the elements of
nse(G) in (2) shows that j = 1 and m
5
= 5824. So |P
5
||(1+m
5
) and hence, |P
5
| | 5
2
.
3) If 7
k
, 13
l

e
(G), then similar to the above, we can see that l = k = 1 and hence,
|P
7
| = 7 and |P
13
| = 13.
In the following cases, we are going to prove that (G) = {2, 5, 7, 13}.
Case a. Let (G) = {2}. Since 2
7

e
(G),
e
(G) = {1, 2, ..., 2
6
}. On the other
hand, |G| = 2
m
= 29120+3640k
1
+5824k
2
+12480k
3
+6720k
4
, where k
1
, k
2
, k
3
, k
4
, m
are nonnegative integer numbers. Hence, |
e
(G)| = 7 and 0

4
i=1
k
i
1. But
this equation has no solution. Therefore this case is impossible.
56
Case b. Let (G) = {2, 5}. By (2), |P
5
| | 5
2
and exp(P
5
) = 5. If |P
5
| = 5, then
n
5
(G) = m
5
(G)/(5) = 5824/4 = 1456. Thus 7 (G), which is a contradiction. If
|P
5
| = 25, then |G| = 2
m
.5
2
= 29120 + 3640k
1
+ 5824k
2
+ 12480k
3
+ 6720k
4
, where
k
1
, k
2
, k
3
, k
4
, m are nonnegative integer numbers. Using a computer calculation we
can see that the equation has no solution in N.
If (G) = {2, 7}, {2, 13}, {5, 7}, {5, 13}, {7, 13}, then applying the argument given
for Case b leads us to get a contradiction.
Case c. Let (G) = {2, 5, 7}. By (3), |P
7
| = 7 and so n
7
(G) = m
7
(G)/(7) =
12480/6 = 2080. Thus 13 (G), which is a contradiction. If (G) = {2, 5, 13}
or {2, 7, 13}, then similar to the above, we can get a contradiction. Thus (G) =
{2, 5, 7, 13}.
By (3), we know that |P
7
| = 7. We can see that 5.7, 5.13
e
(G). Therefore
|P
5
| = 5. We can see that 2.7
e
(G), so |P
2
| | m
7
and hence, |P
2
| | 2
6
. Also
the Sylow 7-subgroup of G is cyclic, so n
7
= m
7
/(7) = 12480/6 = 2080 and
hence, 2080 | |G|. This forces 2
5
5 13 | |G|. On the other hand, 7 | |G| and
hence, 2
5
.5.7.13 | |G| and |G| | 2
6
.5.7.13. Therefore, |G| = 2
6
.5.7.13 or |G| =
2
5
.5.7.13, considering the order of the Sylow subgroups of G obtained above. Since
|G| >
mnse(G)
m, we deduce by (2) that |G| > 14560 = 2
5
.5.7.13. Thus |G| =
2
6
.5.7.13 = |Sz(8)|. By Lemma 1.12, it is easy to see that G is a non-solvable group.
Therefore, G has a normal series 1 N MG such that N is a maximal solvable
normal subgroup of G. Considering the order of G shows that M/N is not simple
K
3
-group. Thus M/N is a simple K
4
-group satisfying Lemma 1.16. Thus by Lemma
1.16, M/N

= Sz(8). Let A/N := C
G/N
(M/N). We can see that G/A

= Sz(8) or
G/A

= Aut(Sz(8)). But 3 |G|, so G/A

= Sz(8). On the other hand, |G| = |Sz(8)|,
so A = 1 and G

= Sz(8), as desired.
References
[1] G. Frobenius, Verallgemeinerung des Sylowschen Satze, Berliner Sitz,
(1985) 981-993.
[2] J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker and R.A. Wilson,
Atlas of nite groups, Clarendon Press, New York, 1985.
[3] M. Hall, The theory of groups, Macmilan, 1959.
[4] R. Shen, C.G. Shao, Q.H. Jiang, W.J. Shi and V. Mazurov, A new char-
acterization of A
5
, Monatsh Math. 160 (2010), 337-341.
[5] W.J. Shi, On simple K
4
-group, Chin. Sci. Bul. 36 (1991), 1281-1283.
57
The 6
th
Symmetry classes of polynomials with respect to
product of groups
Esmaeil Babaei
1
and Yousef Zamani
1
1
Faculty of Sciences, Sahand University of Technology, Tabriz, Iran
e
babaei@sut.ac.ir, zamani@sut.ac.ir
Abstract
Let G
i
be subgroups of S
m
i
, 1 i k respectively. We
consider G = G
1
G
k
as subgroup of S
m
, where m =
m
1
+ + m
k
. In this paper, we give a formula for the
dimension of Symmetry classes of polynomials with respect
to G and its irreducible character, then invastagete exsitence
of an o-basis of these classes.
1 Introduction
The relative symmetric polynomials as a generalization of symmetric polynomials
are introduced in [1]. In [3, 4], the authors studied the space of relative symmetric
polynomials (symmetry class of polynomials) with respect to the irreducible charac-
ters of the some groups. We rst give a review of this notion (for more details, see
[1]).
Let H
d
[x
1
, . . . , x
m
] be the complex space of homogeneous polynomials of degree d
with independent commuting variables x
1
, . . . , x
m
. Let
+
m,d
be the set of all m-
tuples of non-negative integers = (
1
, . . . ,
m
), such that
m
i=1
i
= d. For any

+
m,d
, let X
be the monomial x
1
1
x
2
2
. . . x
m
m
. Then the set {X
|
+
m,d
} is
a basis of H
d
[x
1
, . . . , x
m
]. An inner product on H
d
[x
1
, . . . , x
m
] is dened by
X
, X
=
,
.
Speaker
2010 Mathematics Subject Classication. Primary 05E05; Secondary 15A69.
Key words and phrases. Symmetry class of polynomials, permutaion groups, Irreducible char-
acters.
58
Suppose G is a subgroup of the full symmetric group S
m
. G acts on H
d
[x
1
, . . . , x
m
]
by
(q)(x
1
, . . . , x
m
) = q(x
1
(1)
, . . . , x
1
(m)
),
and this action is extended linearly to the group algebra CG. Let be an irreducible
complex character of G. Consider the idempotent operator
T(G, ) =
(1)
|G|
G
(),
in the group algebra CG. The image of H
d
[x
1
, . . . , x
m
] under the map T(G, ) is
called the symmetry class of polynomials of degree d with respect to G and and it is
denoted by H
d
(G, ). If G = S
m
and = 1
Sm
, where 1
Sm
is the principal character
of S
m
, we obtain the space of ordinary symmetric homogeneous polynomials of
degree d, and if = , where is alternating character of S
m
, we obtain the space of
anti-symmetric homogeneous polynomials of degree d. For any q H
d
[x
1
, . . . , x
m
],
q
= T(G, )(q)
is called a symmetrized polynomial with respect to G and . For
+
m,d
, we denote
the symmetrized monomial (X
by X
,
. So
H
d
(G, ) = X
,
|
+
m,d
.
The group G also acts on
+
m,d
by
= (
(1)
, . . . ,
(m)
).
Let
+
be a set of representatives of orbits of
+
m,d
under the action G.
For any
+
m,d
, we have
X
,
2
= (1)
[, 1]
G
|G : G
|
, (1)
where G
is the stabilizer subgroup of under the action of G. Hence, X

,
= 0 if
and only if [, 1]
G
= 0.
Let
+
be the set of all
+
m,d
with [, 1]
G
= 0 and suppose
+
=
+

+
. We have
dimH
d
(G, ) = (1)
+
[, 1]
G
. (2)
An orthogonal basis of H
d
(G, ) of the form {X
,
| S}, where S is a subset of
+
m,d
is called an o-basis of H
d
(G, ). If is linear, then the set {X
,
|

+
} is
59
an o-basis of H
d
(G, ). If is not linear, then H
d
(G, ) may have no o-basis.
In this paper, we consider G = G
1
G
k
, where G
i
are permutation geroups and
give a formula for the dimension of H
d
(G, ) so invastagete exsitence of an o-basis
of these classes. A similar result has been obtained for symmetry classes of tensors
in [2].
2 Main results
By a partition of m we mean a non-increasing nite sequence of positive integers
whose sum is m. If is a partition of m we denote m. We know that there is a
standard one-to- one correspondence between the partitions of m and the complex
irreducible characters of S
m
. If is a partition of m, we denote the corresponding
irreducible character by
, so the set of all irreducible complex characters of S

m
is Irr(S
m
) = {
| m}. A partition = (
1
, . . . ,
k
) is usually represented by
a collection of m boxes arranged in k rows such that the number of boxes of row
i is equal to
i
, i = 1, . . . , k. This collection is called Young diagram (or Ferrers
diagram) associated with and denoted by []. A Young tableau of shape or
-tableau, t
, is an array t obtained by replacing the boxes of the Ferrers diagram

of with the numbers 1, . . . , m, bijectively. For any 1 i k, suppose
i
= {t :
i1
j=1
j
< t
i
j=1
j
}.
The corresponding Young subgroup is dened by
S
= S
1
S
k
,
where S
i
is the symmetric group on
i
.
In general, S
and S
1
S
k
are isomorphic.
Now let G
i
be subgroup of S
i
, 1 i k respectively, and suppose m =
1
+ +
k
,
without any losses, we can consider = (
1
, ,
k
) m. Let G = G
1
G
k
,
so G S
, specially we can consider G as a subgroup of full symmetric group S

m
.
If is an irreducible character of G, then =
k
i=1
i
, where
i
is an irreducible
character of G
i
, 1 i k.
Let
+
i
,
i
be the set of all
i
-tuples,
i
, of non-negative integers such that
j
i
j
=
i
, and suppose
+
i
,
i
is a set of representatives of orbits of
+
i
,
i
under the action
G
i
. We denote
+
i
,
i
by the set of all
i

+
i
,
i
with [, 1]
(G
i
)
i
= 0 and suppose
i
,
i
=
+
i
,
i

+
i
,
i
. Summing up, we have the following result.
60
Theorem 2.1. We have,
+
=
=(
1
,...,
k
)
+
k,d
k
i=1
i
,
i
.
By considering previous notions, we have a formula for dimenson of H
d
(G, ) as
follow,
Theorem 2.2. we have
dimH
d
(G, ) =
(
1
,...,
k
)
+
k,d
k
i=1
dimH
i
(G
i
,
i
).
Corollary 2.3. Let G = G
1
G
2
and =
1

2
where
i
Irr(G
i
), i = 1, 2,
then
dimH
d
(G, ) =
d
i=0
dimH
i
(G
1
,
1
) dimH
di
(G
2
,
2
).
Proof. Since
+
2,d
= {(i, d i), 0 i d}, then result is obtained by Theorem
3.4.
Let D
+
k,d
be the set of all (
1
, . . . ,
k
)
+
k,d
such that H
i
(G
i
,
i
) = 0 for any
1 i k.
Theorem 2.4. Let G = G
1
G
k
, and =
k
i=1
i
Irr(G), then we have
H
d
(G, ) =
(
1
,...,
k
)D
+
k,d
H
1
(G
1
,
1
) H
k
(G
k
,
k
)
Theorem 2.5. H
d
(G, ) has an o-basis if and only if for any D
+
k,d
and for any
1 i k, H
i
(G
i
,
i
) has an o-basis.
References
[1] M. Shahryari, Relative symmetric polynomials, Linear Algebra Appl, 433, (2010)
14101421.
[2] M. Shahryari and Y. Zamani, Symmetry classes of tensors associated with Young
subgroups, Asian-Eur. J. Math, 04, (2011), 179185.
61
[3] Y. Zamani and E. Babaei, The dimensions of cyclic symmetry classes of polyno-
mials, J. Algebra Appl. 13 (2014), no. 2, 33183321.
[4] Y. Zamani and E. Babaei, Symmetry classes of polynomials associated with the
dicyclic group, Asian-Eur. J. Math. 6 (2013), no. 2.
62
The 6
th
(Strongly) Gorenstein homological dimension of groups
Abdolnaser Bahlekeh
Department of Mathematics, Faculty of Sciences, Gonbad Kavous University, Gonbad
Kavous, Iran
n.bahlekeh@gmail.com
Abstract
Inspired by the theory of Gorenstein homological algebra,
which goes back to the Auslander-Bridger theory of Goren-
stein modules, we assign some numerical invariants to any
group . Precisely, we consider the Gorenstein at and
strongly Gorenstein at dimension of the trivial Z-module
Z that will be called Gorenstein homological and strongly
Gorenstein homological dimension of , respectively. It is
shown that these invariants have enough potential in reect-
ing the properties of the underlying group. We also provide
a version of Serres theorem on cohomological dimension of
groups for these invariants.
1 Introduction
For a two-sided noetherian ring R, Auslander and Bridger [2] introduced the G-
dimension, G-dim
R
M, for every nitely generated R-module M, which is a rene-
ment of projective dimension.
Several decades later, Enochs and Jenda [4] introduced the notion of Gorenstein
projective dimension as an extension of G-dimension to modules that are not nec-
essarily nitely generated over any associative ring, and the Gorenstein injective
dimension as a dual notion of Gorenstein projective dimension. To complete the
analogy with the classical homological dimension, Enochs, Jenda and Torrecillas [5]
2010 Mathematics Subject Classication. Primary 20J05; Secondary 20J06 , 16D40
Key words and phrases. Gorenstein homological dimension of groups, strongly Gorenstein
homological dimension of groups, Gorenstein projective modules, group rings.
63
introduced the Gorenstein at dimension. Recall that a (left) R-module M is said
to be Gorenstein projective, if M is a syzygy of a complete projective resolution,
i.e., if there exists an acyclic complex of projective (left) R-modules;
P
: P
n+1
n+1
P
n
n
P
n1
,
which remains acyclic when applying the functor Hom
R
(, P) for any projective
R-module P, such that M = Im
0
. This denition can be dualized and allows one
to dene the class of Gorenstein injective modules. A (left) R-module M is called
Gorenstein at, if there exists an exact sequence of at (left) R-modules;
F
: F
n+1
n+1
F
n
n
F
n1
,
such that I
R
F
is exact for any right injective R-module I and M = Im

0
.
The notion of strongly Gorenstein at modules is introduced and studied by
Ding et al. in [3]. A left R-module M is said to be strongly Gorenstein at if there
exists an exact sequence of projective R-modules;
P
: P
n+1
n+1
P
n
n
P
n1
,
with M = Im
0
and such that the functor Hom
R
(, F), whereas F is a at R-
module, leaves the sequence exact. Since every projective module is at, one may
deduce that every strongly Gorenstein at module is Gorenstein projective. On
the other hand, there are examples of the strongly Gorenstein at modules which
is not projective (at), and (Gorenstein) at module. It is proved in [3] that over
coherent rings, strongly Gorenstein at modules lie strictly between projective and
Gorenstein at modules.
The Gorenstein projective, Gorenstein at and strongly Gorenstein at dimen-
sions are dened in terms of Gorenstein projective, Gorenstein at and strongly
Gorenstein at resolutions, respectively, and denoted by Gpd
R
(), Gfd
R
() and
SGfd
R
(), respectively.
Let be an arbitrary group. The Gorenstein projective dimension of modules
over the group ring Z, has been studied extensively in [1]. Among other results,
they have proved that if the Gorenstein projective dimension of the trivial Z-
module Z is nite, then every module over Z has nite projective dimension. In
fact, for any Z-module M, one has the inequality Gpd
Z
M Gcd + 1, where
Gcd := Gpd
Z
Z; see [1]. It is known that the Gorenstein cohomological dimen-
sion of a group , Gcd, plays a central role in the cohomology of groups. So,
it is natural to investigate other Gorenstein homological invariants in this context.
In this direction, this note aims to study Gorenstien at and strongly Gorenstein
64
at dimension of modules over group rings. In particular, we consider Gorenstien
at and strongly Gorenstein at dimension of the trivial Z-module Z, which are
called Gorenstein homological and strongly Gorenstein homological dimension of ,
respectively. It turns out that these invariants, which will be denoted by Ghd and
SGhd, respectively, have enough potential in reecting the properties of the un-
derlying group. Among others, we have shown that for a given group , Ghd = 0
if and only if SGhd = 0 if and only if is a nite group. We also deduce a version
of Serres theorem on cohomological dimension of group for these invariants from
more general context.
2 Main results
Proposition 2.1. Let be a group and
be a subgroup of of nite index. Let

M be a Z-module which is at over Z
. Then M is a Gorenstein at Z-module.

Example 2.2. Let be a nite group and
be its trivial subgroup. It is known

that the Z-module Q, with trivial action, is at over Z
. So the above proposition

yields that Q is a Gorenstein at Z-module.
Theorem 2.3. Let
be a subgroup of of nite index and M be a Z-module.

Then M is Gorenstein at if and only if it is Gorenstein at as a Z
-module.
Proposition 2.4. Let be a group such that Z be a coherent ring. Let
be a
subgroup of of nite index. Then for a given Z-module M, Gfd
Z
M = Gfd
Z
M.
In particular, Ghd = Ghd
.
Theorem 2.5. For any group , the following are equivalent:
(1) is a nite group.
(2) Ghd = 0.
(3) SGhd = 0.
Theorem 2.6. Let
be a subgroup of of nite index and M be a Z-module.

Then SGfd
Z
M = SGfd
Z
M.
As a direct consequence of the above theorem, we include the sequel result which
provides a version of Serres theorem for SGhd.
Corollary 2.7. Let be a group and
be a subgroup of of nite index. Then

SGhd
= SGhd.
65
Lemma 2.8. Let be a nite group and M be a nitely generated Z-module.
Then the following are equivalent:
(1) Gpd
Z
M = 0.
(2) Gfd
Z
M = 0.
(3) SGfd
Z
M = 0.
Proposition 2.9. Let be a group of nite Gorenstein cohomological dimension.
Then for any Z-module M, the equality Gpd
Z
M = SGfd
Z
M holds true.
References
[1] J. Asadollahi, A. Bahlekeh and Sh. Salarian, On the hierarchy of cohomological
dimensions of groups, J. Pure Appl. Algebra, 213 (2009), 1795-1803.
[2] M. Auslander and M. Bridger, Stable module theory, Mem. Amer. Math. Soc.,
94 (1969).
[3] N. Ding, Y. Li and L. Mao, Strongly Gorenstein at modules, J. Aust. Math.
Soc., 86 (3) 2009, 323-338.
[4] E. Enochs and O. M. G. Jenda, Gorenstein injective and projective modules,
Math. Z., 220 (1995), 611-633.
[5] E. E. Enochs, O. M. G. Jenda, and B. Torrecillas, Gorenstein at modules,
Nanjing Daxue Xuebao Shuxue Bannian Kan, 10 (1993), 1-9.
66
The 6
th
OD-Characterization of the simple group G
2
(p), where
p < 100
Masoumeh Bibak
1
, Masoumeh Sajjadi
2
and Gholamreza Rezaeezadeh
3
1,2
Department of Mathematics, Payame Noor University, Iran
m.bibak62@gmail.com, masa.irsh@gmail.com
3
Department of Mathematics, Faculty of Mathematical Sciences, Shahrekord University,
Shahrekord, Iran
rezaeezadeh@sci.sku.ac.ir
Abstract
Let G be a nite group and D(G) be the degree pattern
of G. The group G is called k-fold OD-characterizable if
there exist exactly knon-isomorphic groups H satisfying con-
ditions (1) |G| = |H| and (2) D(G) = D(H). Moreover,
a one-fold OD-characterizable group is simply called OD-
characterizable group. In this paper, as the main result, we
prove that G
2
(p), where p < 100 and p = 67, 73, 79, 97 is
OD-characterizable.
1 Introduction
For a nite group G, we denote by (G) the set of orders of its elements and by
(G) the set of prime divisors of |G|. We associate to (G) a simple graph called
the prime graph of G, denoted by (G). The vertex set of this graph is (G) where
two distinct vertices p and q are adjacent by an edge if pq (G), in which case, we
write p q. Obviously, (G) is uniquely determined by (G), while the spectrum
itself is in turn reconstructed from the set (G) of maximal elements of (G) with
respect to divisibility. Let t(G) be the number of connected components of (G)
Speaker
2010 Mathematics Subject Classication. Primary 20D10; Secondary 20E26 , 20F17, 20J99.
Key words and phrases. Prime graph, Degree pattern, OD-characterizable.
67
and
1
,
2
,...,
t(G)
be the connected components of (G). If 2 (G) we always
suppose that 2
1
.
The degree deg(p) of a vertex p (G) is the number of edges incident on
p. If (G) = {p
1
, p
2
, ..., p
k
} with p
1
< p
2
< ... < p
k
, then we dene D(G) :=
(deg(p
1
), deg(p
2
), ..., deg(p
k
)), which is called the degree pattern of G, and leads a
following denition.
Denition 1.1. A nite group Gis called k-fold OD-characterizable if there exist ex-
actly k non-isomorphic groups H satisfying conditions |G| = |H| and D(G) = D(H).
In particular, a 1-fold OD-characterizable group is simply called OD-characterizable.
The degree pattern of a nite group G associated with its prime graph has
been introduced by M. R. Darafsheh and et. all in 2005 and it is proved that the
following simple groups are uniquely determined by their order and degree patterns:
All sporadic simple groups, the alternating A
p
with p and p 2 primes and some
simple groups of Lie type. In [4] the characterization by order and degree pattern
of L
2
(q), where q 4 is an odd prime power is proved. The authors in [2] it is
proved that the automorphism groups of simple K
3
-groups except A
6
and U
4
(2) are
OD-characterizable (we recall that a nite group possessing exactly n prime divisors
is called K
n
-group). Also in [3], it is proved that all nite simple K
4
-groups except
A
10
are OD-characterizable.
In this talk, we consider the simple group G
2
(p), where p < 100 and p =
67, 73, 79, 97 and prove that this group is characterizable by order and degree pat-
terns.
Throughout this note, all groups are nite and by simple groups we mean non-
abelian simple groups. All further unexplained notations are standard and refer to
[5].
2 Main results
Theorem 2.1. Let G be a nite group such that |G|=|G
2
(p)| and D(G)=D(G
2
(p)),
where p < 100 and p = 67, 73, 79, 97. Then G

= G
2
(p).
As a consequence of theorem 2.1, we have the following corollaries:
Corollary 2.2. Let G be a nite group and let p be a prime number where p < 100
and p = 67, 73, 79, 97. If |G|=|G
2
(p)| and (G) = (G
2
(p)), then G

= G
2
(p).
Remark 2.3. Shi and Bi in [3] put forward the following conjecture:
Conjecture 2.4. Let G be a nite group and M be a nite simple group. Then
G

= M if and only if
68
(i) |G| = |M|;
(ii) (G) = (M).
This conjecture is valid for all nite simple groups. As a consequence of theorem
2.1, by a new proof the validity of this conjecture is obtained for the groups under
study.
Corollary 2.5. Let G be a nite group and let p be a prime number where p < 100
and p = 67, 73, 79, 97. If |G|=|G
2
(p)| and (G) = (G
2
(p)), then G

= G
2
(p).
References
[1] J. H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker and R.A. Wilson, Atlas of
nite groups, Clarendon Press (Oxford), London - New York, 1985.
[2] W. J. Shi and X. J. Bi, A characteristic property for each nite projective special
linear group, Lecture Note in Math 1456: 171-180.
[3] L.C. Zhang and W.J. Shi, OD-characterization of all simple groups whose orders
are less than 10
8
, Front. Math. China 3(3): 461-474 2008.
[4] L. C. Zhang and W.J. Shi, OD-Characterization of the projective special linear
groups L
2
(q), Algebra Colloq. 19(3): 509-524 (2012).
[5] H. Xu. Yan, G. Chen and L. He, OD-Characterization of the automorphism
groups of simple K
3
-group, Journal of Inequalities and Applications. 95 2013.
69
The 6
th
Combinatorial conditions on groups
Asadollah Faramarzi Salles
1
and Hassan Khosravi
2
1
Department of Mathematics and Computer Science, Damghan University, Damghan,
Iran
faramarzi@du.ac.ir
2
Department of Mathematics, Gonbad-e Kavous University , Gonbad-e Kavous, Iran
hassan khosravi@yahoo.com
Abstract
Let B
n
and A
n
be the varieties of groups dened by the
laws (xy)
n
(yx)
n
= 1 and x
n
y(yx
n
)
1
= 1, respectively.
Let B
n
and (A
n
)
be the classes of groups in which for any

innite subset X, Y there exist x X and y Y such that
(xy)
n
(yx)
n
= 1 and x
n
y(yx
n
)
1
= 1, respectively. In this
paper we prove that B
n
= B
n
F and whit certain condition

A
n
= A
n
F, where F is the class of nite groups.

1 Introduction
Let V be a variety of groups dened by the law w(x
1
, . . . , x
n
) = 1. A group G
is said to be a V
-group if for any innite subsets X

1
, . . . , X
n
of G there exist
x
1
X
1
, . . . , x
n
X
n
such that w(x
1
, . . . , x
n
) = 1. Clearly V
F V
, where F
is the class of all nite groups. It is known that for many varieties V and for many
words w the equality V
F = V
holds (see, for instance,[1], [5]). However, it is

still an open question whether this is true for all varieties V and for all words w.
Let n be a positive integer and A
n
and B
n
be the varieties of groups generated
by the laws (xy)
n
(yx)
n
= 1 and x
n
y(yx
n
)
1
= 1, respectively. It is easy to see
thatA
n
= B
n
for all n N.
Speaker
Key words and phrases. Variety of groups, innite groups, class of groups, combinatorial
conditions.
70
2 Main results
In this section we give a positive answer to the question.
Lemma 2.1 ([1]). Let G be an innite B
n
-group. Then C
G
(a
n
) is innite for all
a G.
Lemma 2.2. Let G be an innite B
n
-group, x an element of G. If C
G
(x) is innite,
then [y, x
n
] = 1, for all y G.
Theorem 2.3. Let G be an innite group in B
n
. Then G B
n
.
Proof. Let x be an element of G. We can assume that C
G
(x) nite, by Lemma 2.2.
It follows from lemma 2.1 that T = C
G
(x
n
) is innite, and then x
T
and yT are
innite subsets of G. Since G B
n
, there exist distinct elements t
1
and t
2
of T such
that [(x
n
)
t
1
, yt
2
] = 1 and therefore [x
n
, y] = 1.
Lemma 2.4 ([1]). Let G be an innite A
n
-group. If A is an innite abelian subgroup
of G, then A
n
Z(G).
Lemma 2.5. Let G be an innite A
n
-group with some elements of innite order.
Then G is an A
n
-group.
Lemma 2.6. Let G be an innite locally nite A
n
-group. If G has an element g
with nite centralizer C
G
(g), then G is an A
n
-group.
Let A
n
denote the variety of groups generated by the law (xy)
n
y
n
x
n
= 1.
Now we have the following results.
Lemma 2.7. Let G be a group in A
(A
n
)
. Then G is in B
n
.
Corollary 2.8. Let n {3, 6}
{2
k
: k N} and G be a group in A
(A
n
)
.
Then G is in A
n
.
References
[1] A. Abdollahi and B. Taeri, Some conditions on innite subsets of innite groups,
Bull. Malaysian Math. Soc. (Second Series) 22 (1999) 87-93.
[2] J. L. Alperin. A classication of n-abelian groups, Canad. J. Math. 21 (1969),
1238-1244.
71
[3] C. Delizia and C. Nicotera, Groups with conditions on innite subsets, In Ischia
group theory 2006: Proc. conf. in honor of Akbar Rhemtulla (World Scientic
Publishing, 2007), 46-55.
[4] G. Endimioni, On a combinatorial problems in varieties of groups, Comm. Alge-
bra, 23 (1995), 5297-5307.
[5] A. Faramarzi Salles and H. Khosravi, A combinatorial property of Burnside
variety of groups of nite exponent, J. Algebra and Its Applications Vol. 8, No.
6 (2009) 845-853
72
The 6
th
On the number of elements of a given order
M. Farrokhi D. G.
1
and F. Saeedi
2
1
m.farrokhi.d.g@gmail.com
2
Department of Mathematics, Mashhad Branch, Islamic Azad University, Mashhad, Iran
saeedi@mshdiau.ac.ir
Abstract
We study all nite groups in which the number of elements
of each order is almost the same.
1 Introduction
Counting the number of elements of a given order had been an old problem in the
theory of nite groups. The celebrated theorem of Frobenius (see Theorem 1.5) is
the most strongest result in this area, which is also strengthened by many authors
in special cases, see [1, 4] for example.
Let w
d
(G) be the number of all elements of order d in a nite group G. Freud
and Palfy [2] studied the quantities w
d
(G) and showed that the set of all w
d
(G)
when d ranges over all natural numbers and G ranges over all nite groups coincides
with the set of all natural numbers. Clearly, (d) divides w
d
(G) for all nite groups
G and natural numbers d. Freud and Palfy showed that w
d
(G) can take any odd
value when d = 2 and take all values divisible by (d) whenever d = 6 or 4
d. Also,
they give partial results for other values of d, namely d = 3.
In this talk we shall present the structure of those nite groups G such that
almost all the numbers w
d
(G) are the same.
Denition 1.1. The Spectrum of a group G is the set of all orders of elements of G
and it is denoted by w(G). The number of elements of a given order d is denoted by
Speaker
2010 Mathematics Subject Classication. Primary 20D60; Secondary 20E99.
Key words and phrases. Finite group, spectrum, order.
73
w
d
. Also, the set of all frequencies of elements of each order is denoted by w
(G),
that is, w
(G) = {w
d
: d w(G)}.
The following results will be used in the proof of our main theorems.
Lemma 1.2. Let G be a nite group and d w(G). Then (d) divides w
d
.
Corollary 1.3. Let G be a nite group and d w(G) \ {1}. If w
d
is odd, then
d = 2.
Lemma 1.4. Let G be a nite group of order k. Then |G| =
k
w
d
.
Theorem 1.5 (Frobenius, [3]). Let G be a nite group whose order is divisible by
a number n. Then
n
w
d
is divisible by n.
2 Main results
Clearly, the only nite groups G with |w
(G)| = 1 are the trivial group and the

cyclic group of order 2. In what follows, we obtain the classication of all nite
groups with |w
(G)| = 2 or 3.
Theorem 2.1. Let G be a nite group. Then |w
(G)| = 2 if and only if G is

isomorphic with one of the following groups:
(1) Z
4
,
(2) Q
8
,
(3) a group of exponent p dierent from Z
2
,
(4) H Z
2
, where H is a group of exponent p > 2.
Theorem 2.2. Let G be a nite group. If |w
(G)| = 3, then
(1) G is a p-gorup,
(2) G is a Frobenius group whose kernel is a p-group of exponent p and comple-
ments are cyclic q-groups of order q,
(3) G = O
pqp
(G) is a 3-step group, O
pq
(G) = O
p
(G) Z
q
is a Frobenius group,
G/O
p
(G)

= Z
q
Z
p
is a Frobenius group, exp(P) = p and Q

= Z
q
,
(4) G/Z(G) is a Frobenius group, Z(G)

= Z
2
and either G

= Z
2
(Z
k
p
Z
2
) or
G

= Z
k
2
Z
p
for some odd primes p and q.
74
References
[1] Y. Berkovich, On the number of elements of given order in a nite p-group, Israel
J. Math. 73(1) (1991), 107112.
[2] R. Freud and P. P. Palfy, On the possible number of elements of given order in
a nite group, Israel J. Math. 93 (1996), 345358.
[3] G. Frobenius,

Uber einen Fundamentalsatz der Gruppentheorie, Sitz. Ber.
Konigl. Preuss. Akad. Wiss. Berlin, 1903, 987991.
[4] M. Herzog, Counting group elements of order p modulo p
2
, Proc. Amer. Math.
Soc. 66(2) (1977), 247250.
75
The 6
th
On the lower autocentral series of groups
Ali Gholamian
1,2
and Mohammad Mehdi Nasrabadi
1
1
Department of Mathematics,University of Birjand, Birjand, Iran
mnasrabadi@birjand.ac.ir
2
Department of Mathematics, Birjand Education, Birjand, Iran
ali.ghfath@gmail.com
Abstract
The concept of the lower autocentral series of groups was
introduced and studied by Moghaddam(2009). Using this
concept, we introduce the notion of A-nilpotent groups and
investigate their properties. Also we prove an analogue of
Robinson Theorem for the lower autocentral series of groups
and next we present sucient conditions under which a
group can be nite or nite exponent.
1 Introduction
Let G be a group and A = Aut(G) denote the group of automorphisms of G. As in
[2], if g G and A, then the element [g, ] = g
1
(g) is an autocommutator
of g and . Now following [3] one may dene the autocommutator of weight m+1
(m 2) inductively as:
[g,
1
,
2
, ...,
m
] = [[g,
1
, ...,
m1
],
m
],
for all
1
,
2
, ...,
m
A.
Now put K
0
(G) = G and for any natural number m
K
m
(G) = [G, A, ..., A
. .
mtimes
] = [g,
1
,
2
, ...,
m
]|g G,
1
, ...,
m
A,
Speaker
2010 Mathematics Subject Classication. 20D45, 20D25, 20E36.
Key words and phrases. Automorphism, lower autocentral series, Abelian groups.
76
which is called the m
th
-autocommutator subgroup of G. Hence, we obtain a descend-
ing chain of autocommutator subgroups of G as follows,
G = K
0
(G) K
1
(G) K
2
(G) ... K
m
(G) ...,
which is called the lower autocentral series of G.
In [3] some properties of autocommutator subgroups of a nite abelian group are
studied. Now, we introduce the new notion of A-nilpotent groups.
Denition 1.1. A group G is called as A-nilpotent, if the lower autocentral series
ends in the identity subgroup after a nite number of steps.
If G is an A-nilpotent group, then the length of the lower autocentral series of
G is called the A-class of G.
If a group G is A-nilpotent, then A is the stability group of the lower autocentral
series of G. In [1], Hall proved that the stability group is nilpotent. Hence, a group
with non-nilpotent automorphism group can not be A-nilpotent.
Throughout this paper, we adopt additive notation for all abelian groups.
Example 1.2. Let n be a natural number and G = Z
2
n. Then K
m
(G) = 2
m
G, for
any natural number m. Hence, G is an A-nilpotent group.
Example 1.3. Let G = D
8
, dihedral group of order 8. Then K
1
(G) = Z
4
, K
2
(G) =
Z
2
and K
3
(G) is trivial. Hence, G is an A-nilpotent group.
A-nilpotent groups are nilpotent, but the converse is not true in general.
Example 1.4. Let G = Q
8
, generalized quaternion group of order 8 or G = Z
9
.
Then G is a nilpotent group, but is not A-nilpotent. Since, K
m
(G) = G, for any
natural number m.
Remark 1.5. The set of elements L(G) = {g G | [g, ] = 1, A} is called
the autocentre of G. Clearly, it is a characteristic subgroup of G. Now as in [3] the
upper autocentral series of G is dened in following way:
e = L
0
(G) L
1
(G) = L(G) L
2
(G) ... L
m
(G) ..., where
Lm(G)
L
m1
(G)
=
L(
G
L
m1
(G)
). In [3], a group G is said to be autonilpotent group, if the upper auto-
central series ends in the group G after a nite number of steps. It is easy to check
that any autonilpotent group is A-nilpotent group but the converse is not true in
general. The dihedral group of order 8, D
8
, is A-nilpotent, but is not autonilpotent.
Robinson [4, 5.2.5] showed that how the rst lower central factor G
ab
=
G
G
exerts a very strong inuence on subsequent lower central factors of a group G. An

analogue of Robinson Theorem for lower autocentral factors shall be stated. Some
sucient conditions under which a group can be nite or nite exponent shall be
described.
77
2 Main results
In this paper the oor function of x , the largest integer less than or equal to x, is
written by the symbol x.
Lemma 2.1. i) Let H and T be two arbitrary groups. Then for any natural number
m, K
m
(H) K
m
(T) K
m
(H T).
ii) Let H and T be nite groups such that (|H|, |T|) = 1. Then for any natural
number m, K
m
(H) K
m
(T) = K
m
(H T).
Corollary 2.2. If H or T is not A-nilpotent group, then so is not H T.
Lemma 2.3. For all natural numbers n
1
> n
2
, if Aut(Z
2
n
1 Z
2
n
2 ), then for
some k, r {0, 1, 2, ..., 2
n
1
1} and k
, r
{0, 1, 2, ..., 2
n
2
1},
((a, b)) = ((2k + 1)a + 2
n
1
n
2
rb, k
a + (2r
+ 1)b)
for all (a, b) Z
2
n
1 Z
2
n
2 .
Theorem 2.4. Let n
1
, n
2
, m be natural numbers and G = Z
2
n
1 Z
2
n
2 . Thus
i) if n
1
= n
2
, then
K
m
(G) = G.
ii) If n
1
n
2
= 1, then
K
m
(G) = 2
m+1
2

Z
2
n
1 2
m
2

Z
2
n
2 .
iii) If n
1
n
2
2, then
K
m
(G) = 2
m
Z
2
n
1 2
m1
Z
2
n
2 .
Corollary 2.5. For all natural numbers n
1
and n
2
,
i) if n
1
= n
2
, then
K
m
(Z
2
n
1 Z
2
n
2 ) = 0 for any natural number m,
hence G is not A-nilpotent.
ii) If n
1
> n
2
then
K
2n
1
1
(Z
2
n
1 Z
2
n
2 ) = 0,
hence G is A-nilpotent.
In following theorem we prove an analogue to the work of Robinson for lower
autocentral factors of a given group.
78
Remark 2.6. Note that in the under theorem F
i
=
K
i
(G)
K
i+1
(G)
and Aut(G) act trivially
on each other. Hence the non abelian tensor product F
i
Aut(G) is isomorphic to
their abelian tensor product.
Theorem 2.7. Let G be a group and F
i
=
K
i
(G)
K
i+1
(G)
for i 0. Then the map
F
i
Aut(G) F
i+1
gK
i+1
(G) [g, ]K
i+2
(G)
is a well-dened epimorphism.
Corollary 2.8. If G is an A-nilpotent group such that
G
K
1
(G)
and Aut(G) are nite,
then so is G.
Theorem 2.9. If G is a group such that Aut(G) is nite and
G
K
1
(G)
has exponent
n. Then, for any natural number m,
Km(G)
K
m+1
(G)
has exponent dividing n.
Corollary 2.10. If G is an A-nilpotent group of A-class c such that Aut(G) is nite
and
G
K
1
(G)
has exponent m. Then G has nite exponent dividing m
c
.
The following example shows that the corollaries 2.8 and 2.10 may fail to hold
if G is not A-nilpotent, even if G is nilpotent.
Example 2.11. Let G = Z. Then, Aut(G) Z
2
and one can easily check that
K
m
(G) = 2
m
G, for any non-negative integer m. Hence, Aut(G) and
G
K
1
(G)
are
nite, but G is not nite.
References
[1] P, Hall, Some sucient conditions for a group to be nilpotent, Illinois J. Math.
(1958) , no 2, 787-801.
[2] P. Hegarty, The absolute centre of a group, J. Algebra 169, (1994), no. 3 929-935.
[3] M. R. R. Moghaddam, Some properties of autocommutator groups, The rst
Two-Days Group Theory Seminar in Iran, University of Isfahan, 12-13 March
2009,Isfahan.
[4] D. J. S. Robinson, A Course in the Theory of Groups, Graduate Texts in Math-
ematics, 80. Springer-Verlag, New York-Berlin, 1982.
79
The 6
th
On a conjecture about automorphisms of nite p-groups
S. M. Ghoraishi
Department of Mathematics, Faculty of Mathematics and Computer Sciences, Shahid
Chamran University, Ahvaz, Iran
m.ghoraishi@scu.ac.ir
Abstract
A longstanding conjecture asserts every nite nonabelian p-
group has a noninner automorphism of order p. In this talk
the verication of the conjecture is reduced to the case of
p-groups G satisfying Z
2
(G) C
G
(Z
2
(G)) = (G), where
Z
2
(G) is the preimage of
1
(Z
2
(G)/Z(G)) in G. This im-
proves Deaconescu and Silberbergs reduction of the conjec-
ture.
1 Introduction
Let p be a prime and G be a nite nonabelian p-group. A longstanding conjecture
asserts that G has a noninner automorphism of order p [5, Problem 4.13]. This
conjecture, is still open and has faced no counterexamples yet. In fact, the statement
of the conjecture is a sharpened version of a well-known and nontrivial property of
nite p-groups that with the exception of groups of order p, they always have a
noninner automorphism of p-power order [2].
The conjecture has been established for p-groups of class 2 and 3, for p-groups
of coclass 2, for regular p-groups, for p-groups G in which G/Z(G) is powerful, for
p-groups G in which (G, Z(G)) is a Camina pair and p = 2, for 2-groups with a
cyclic commutator subgroup, and for p-groups of order p
m
and exponent p
m2
. It
is worth noting that most of the noninner automorphisms given in these results
leave either (G) or Z(G) elementwise xed. Also, Deaconescu and Silberberg have
proved if C
G
(Z((G))) = (G), then G has a noninner automorphism of order p
Key words and phrases. Finite p-groups, automorphisms, noninner automorphisms.
80
leaving (G) elementwise xed [2]. Hence, they have reduced the verication of the
conjecture to the degenerate case in which
C
G
(Z((G))) = (G). ()
The main motivation of this talk is to reduce the verication of the conjecture
further.
2 Main results
We need the following preliminary lemmas.
Lemma 2.1. Let G be a nite p-group, M be a maximal subgroup of G and g
G\ M. Let u Z(M) such that (gu)
p
= g
p
. Then the map given by g gu and
m m, for all m M, can be extended to an automorphism of order |u| that acts
trivially on M.
Let Z
2
(G) = Z(G) =
1
(Z
2
(G) = Z(G)), where for a nite p-group H,
1
(H) =
h H | h
p
= 1.
Lemma 2.2. If G is a nite p-group, then [Z
2
(G), (G)] = 1.
Our rst main result is the following.
Theorem 2.3. Let p be a prime and G be a nite nonabelian p-group. If G fails to
fulll the condition
Z
2
(G) C
G
(Z
2
(G)) = (G), ()
then G has a noninner automorphism of order p leaving the Frattini subgroup of G
elementwise xed.
Proof. Assume that G has no noninner automorphism of order p leaving the Frattini
subgroup of G elementwise xed. Then by [2, Theorem], we may assume that
C
G
(Z((G))) = (G). Now Lemma 2.2, implies that Z
2
(G) Z((G)). Thus
Z
2
(G) C
G
(Z
2
(G)). Let M be a maximal subgroup of G and g G \ M. Let
u be an element of order p in Z(G) M. Then by Lemma 2.1 the map given
by g gu and m m, for all m M, can be extended to an automorphism of
order p that leaves M elementwise xed. Thus for some x
M
G, =
x
M
, the
inner automorphism induced by x
M
. Therefore x
M
Z
2
(G) and M = C
G
(x
M
). By
Lemma 2.2, (G) C
G
(Z
2
(G)). Hence
(G) C
G
(Z
2
(G))
MM(G)
C
G
(x
M
) =
MM(G)
M = (G),
and the result follows.
81
Theorem 3.5 reduces the verication of the conjecture to the case of nite p-
groups satisfying (). Let G
p
and G
p
denote the sets of all nite p-groups with
the properties () and (), respectively.
Then, we have the following theorem.
Theorem 2.4. For every prime p, G
p
G
p
and G
p
\ G
p
contains innitely many
p-groups.
To prove Theorem 2.4, we use the following observation.
Lemma 2.5. If G
1
belongs to G
p
\ G
p
, then so does G
1
G
2
, for all G
2
G
p
.
Proof. The result follows immediately from the following elementary facts. Let G
1
and G
2
be two nite p-groups. Let H
1
G
1
and H
2
G
2
. Set G = G
1
G
2
and
H = H
1
H
2
. Then (G) = (G
1
) (G
2
) and C
G
(H) = C
G
1
(H
1
) C
G
2
(H
2
).
Proof of Theorem 2.4. Let G G
p
. Then by Lemma 2.2, Z
2
(G) Z((G)).
Therefore
(G) = C
G
(Z
2
(G)) C
G
(Z((G))) (G).
This proves the rst part of the theorem. For the second part, by Lemma 2.5 it
suces to show that for every prime p, G
p
\ G
p
= . First, assume that p > 3 and
let G be a group with the following power-commutator presentation.
G = Pcg
1
, g
2
, g
3
, g
4
, g
5
|g
p
1
= g
p
2
= g
p
3
= g
p
4
= g
p
5
= 1,
g
3
= [g
2
, g
1
], g
4
= [g
3
, g
1
], g
5
= [g
4
, g
1
],
[g
5
, g
1
] = 1, [g
3
, g
2
] = g
5
, [g
4
, g
2
] = 1, [g
5
, g
2
] = 1
[g
4
, g
3
] = 1, [g
5
, g
3
] = 1, [g
5
, g
4
] = 1,
Then it follows that G G
p
\ G
p
= . Next, if p 3, then one may nd a group
G G
p
\ G
p
in GAP small groups library.
We refer the interested reader to [4], [1] and the bibliography therein.
References
[1] A. Abdollahi, S. M. Ghoraishi, Y. Guerboussa , M. Reguiat and B. Wilkens,
Noninner automorphisms of order p for nite p-groups of coclass 2, to appear in
J. Group Theory.
[2] M. Deaconescu and G. Silberberg, Noninner automorphisms of order p of nite
p-groups, J. Algebra 250 (2002), 283287.
82
[3] W. Gasch utz, Nichtabelsche p-Gruppen besitzen aussere p-Automorphismen, J.
Algebra 4 (1966), 12.
[4] S. M. Ghoraishi, On noninner automorphisms of nite nonabelian p-groups Bull.
Austral. Math. Soc. available on CJO2013. doi:10.1017/S0004972713000403.
[5] V. D. Mazurov and E. I. Khukhro (ed.), Unsolved problems in group theory, The
Kourovka Notebook, No. 16, Russian Academy of Sciences, Siberian Division,
Institue of Mathematics, Novosibirisk, 2006.
83
The 6
th
Embeddings of borel subgroup of the Ree groups of
type
2
F
4
(q
2
)
Maryam Ghorbany
Department of Mathematics, Iran University of Science and Technology, Emam, Behshahr,
Mazandaran, Iran
m ghorbani@iust.ac.ir
Abstract
By a quasi-permutation matrix we mean a square ma-
trix over the complex eld C with non-negative integral
trace.Thus every permutation matrix over C is a quasi-
permutation matrix.For a given nite group G , let c(G)
denotes the minimal degree of a faithful representation of
G by quasi-permutation matrices over the complex numbers
and let r(G) denote the minimal degree of a faithful rational
valued complex character of G. The purpose of this paper
is to calculate c(G) and r(G) for the Borel Subgroup of the
Ree groups
2
F
4
(q
2
).
1 Introduction
If F is a subeld of the complex numbers C, then a square matrix over F with
non-negative integral trace is called a quasi-permutation matrix over F. Thus every
permutation matrix over C is a quasi-permutation matrix. For a given nite group
G, let c(G) be the minimal degree of a faithful representation of G by complex
quasi-permutation matrices.
It is easy to see that for a nite group G the following inequalities hold
r(G) c(G) q(G).
2010 Mathematics Subject Classication. 20C15
Key words and phrases. Character table, Quasi-permutation representation, Borel subgroup,
Parabolic subgroup, Ree group.
84
Finding the above quantities have been carried out in some papers, for example in
[2], [3], [4], [5] and [6] we found these for the groups GL(2, q), SU(3, q
2
) ,PSU(3, q
2
)
, SP(4, q) , G
2
(2
n
) and K
2
2
(q) respectively.
2 Notation and preliminary results
Let
2
F
4
(q
2
) be the simple Ree group with q
2
= 2
2n+1
and n a positive integer.
Let V be a Euclidean vector space with scalar product (., .), let e
1
, e
2
, e
3
, e
4
be an
orthonormal basis of V and let be the set consisting of the 48 vectors
e
i
, e
i
+e
j
,
1
2
(e
i
+e
j
+e
k
+e
l
),
where i, j, k, l 1, 2, 3, 4, |i|, |j|, |k|, |l| are dierent and e
i
= e
i
for all i.
The set is a root system of type F
4
and the set := r
1
, r
2
, r
3
, r
4
with the simple
roots
r
1
:= e
2
e
3
, r
2
:= e
3
e
4
, r
3
:= e
4
, r
4
:=
1
2
(e
1
e
2
e
3
e
4
)
is a basis of .
In the theory of algebraic groups, a Borel subgroup of an algebraic group G
is a maximal Zariski closed and connected solvable algebraic subgroup. All Borel
subgroups of a given group are conjugate. Any Borel group is connected and equal
to its own normalizer, and contains a unique Cartan subgroup. The intersection of
B with a maximal compact subgroup K of G is t torus of K are one of the two
key ingredients in understanding the structure of simple (more generally, reductive)
algebraic groups, in Jacques Tits
,
theory of groups with a (B, N) pair. Herer the
group B is a Borel subgroup and N is the normalizer of a maximal torus contained
in B.See [7]
Now we give algorithms for calculation of r(G) and c(G) .
Denition 2.1. Let be a character of G such that, for all g G, (g) Q and
(g) 0. Then we say that is a non-negative rational valued character.
Let
i
for 0 i r be Galois conjugacy classes of irreducible complex characters
of G. For 0 i r let
i
be a representative of the class
i
, with
o
= 1
G
. Write
i
=
i
and m
i
= m
Q
(
i
) and K
i
= ker
i
. We know that K
i
= ker
i
. For
I {0, 1, 2, , r} , put K
I
=
iI
K
i
. By denition of r(G) and c(G) and using
above notations we have: r(G) = min{(1) : =
r
i=1
n
i
i
, n
i
0, K
I
= 1 for I =
85
{i, i = 0, n
i
> 0}}
c(G) = min{(1) : =
r
i=0
n
i
i
, n
i
0, K
I
= 1 for I = {i, i = 0, n
i
> 0}}
where n
0
= min{(g)|g G} in the case of c(G).
In [1] we dened d(), m() and c() [See Denition 3.4]. Here we can redene
it as follows:
Denition 2.2. Let be a complex charater of G, such that ker = 1 and =
1
+ +
n
for some
i
Irr(G). Then dene
(1)d() =
n
i=1
|
i
(
i
)|
i
(1),
(2) m() =
_
_
_
0 if = 1
G
,
| min{
n
i=1
i
(
i
)
i
(g) : g G}| otherwise,
(3) c() =
n
i=1
i
(
i
)
i
+m()1
G
.
So
r(G) = min{d() : ker = 1},
and
c(G) = min{c()(1) : ker = 1}.
We can see all the following statements in [1] .
Corollary 2.3. Let Irr(G) ,then
()
is a rational valued character

of G . Moreover c() is a non-negative rational valued character of G and c() =
d() +m().
Lemma 2.4. Let Irr(G), = 1
G
. Then c()(1) d() + 1 (1) + 1 .
Lemma 2.5. Let Irr(G). Then
(1) c()(1) d() (1) ;
(2) c()(1) 2d() . Equality occurs if and only if Z()/ker is of even order .
3 Quasi-permutation representations
In this section we will calculate r(G) and c(G) for Borel subgroup of the Ree groups
2
F
4
(q
2
) .
86
Theorem 3.1. Let G be a Borel subgroup B of the Ree groups
2
F
4
(q
2
), then
1) r(B) =
2
2
|(B
51
(k))|q
9
(q
2
1) 2) c(B) =
2
2
|(B
51
(k))|q
11
Proof. In order to calculate r(G) and c(G) , we need to determine d(), m() and
c()(1) for all characters that are faithful or
Ker = 1 ,so, since the degrees of

faithful characters are minimal , therefore, we consider only the faithful characters
, and by Lemmas 2.3 and 2.4 and table A
6
of [7]we will prove ......
References
[1] H. Behravesh, Quasi-Permutation representations of p-groups of class 2, J. Lon-
don Math. Soc. 55 (1997), 251260.
[2] M.R. Darafsheh , M. Ghorbany , A. Daneshkhah and H. Behravesh Quasi-
permutation representation of the group GL(2, q), Journal of Algebra 243 (2001),
142167.
[3] M.R. Darafsheh and M.Ghorbany, Quasi-permutation representations of the
groups SU(3, q
2
) and PSU(3, q
2
), Southest Asian Bulletin of Mathemetics 26
(2002), 295406.
[4] M.R. Darafsheh and M. Ghorbany, Special representations of the group SP(4, q)
with minimal degrees, Acta Math. Hungar. 102 (2004), 287296.
[5] M.Ghorbany, Special representations of the group G
2
(2
n
) with minimal degrees,
Southest Asian Bulletin of Mathemetics 30 (2006) 663670.
[6] M.Ghorbany, Quasi-permutation representations for the group K
2
2
(q), Italian
Journal of Pure and Applied Mathematics N. 24 (2008), 157168.
[7] F. Himstedt and S.C Huang, Character tables of Borel subgroup of the Ree groups
2
F
4
(q
2
), LMS J. Comput. Math. 12 (2009), 153.
87
The 6
th
The commutativity degree of a polygroup
Azam Hokmabadi
1
, Fahimeh Mohammadzadeh
2
and Elaheh
Mohammadzadeh
3
,
Department of Mathematics, Faculty Of Science,Payame Noor University, P.O. Box
19395-3697, Tehran ,Iran
1
ahokmabadi@pnu.ac.ir,
2
fa36407@yahoo.com,
3
mohammadzadeh.e@pnurazavi.ac.ir
Abstract
In this paper, we dene the commutativity degree of a poly-
group and then calculate the commutativity degree of the
direct product of polygroups. We also give a lower bound
for commutativity degree of a polygroup under some condi-
tion.
1 Introduction
The commutativity degree of a group is dened to be the probability that two el-
ements in the group commute, denoted by P(G). In the past twenty years and
particularly during the last decade there has been growing interest in the use of
probability in nite group (see[1]). Erdios and Turan [2] introduced this idea in
1968, which explored this concept for symmetric group.
The concept of polygroup is introduced by S.D. Comer as a special hypergroup.
He pointed out that polygroups have application in color schemes and also developed
the algebraic theory for polygroups([3, 4]).
In this paper, we dene the commutativity degree of a poly group and then
calculate the commutativity degree of the direct product of polygroups. We also
give a lower bound for commutativity degree of a polygroup under some condition.
Speaker
2010 Mathematics Subject Classication. Primary 20N20; Secondary 20P05.
Key words and phrases. Polygroup, Commutativity degree.
88
2 Main Results
A poly group is a system P, ., e,
1
, where e P,
1
is a unitary operation on P, .
maps P P into the non-empty subset of P, and the following axioms hold for all
x, y, z in P:
(i) (x.y).z = x.(y.z);
(ii) e.x = x.e = x;
(iii) x y.z implies y x.z
1
and z y
1
.x.
Note that if A and B are non-empty subsets of P, then we have A.B =
aA,bB
a.b.
The following elementary facts about polygroups follow easily from the axioms:
e x.x
1
x
1
.x, e
1
= e, (x
1
)
1
= x, and (x.y)
1
= y
1
.x
1
where A
1
=
{a
1
|a A}. For more details see [5]
Denition 2.1. A non-empty subset K of a polygroup P is said to be a subpoly-
group of P if K itself forms a polygroup, under the hyperoperation in P.
Denition 2.2. The subpolygroup N of P is normal in P if and only if a
1
Na N
for all a P.
For a subpolygroup K of P and x P, denote the right coset of K by Kx and
let P/K is the set of all right cosets of K in P. If K P then xK = Kx and the
set of all cosets of K in P is a partition of P(see [5]).
Let P be a polygroup. The relation
is dened as the smallest equivalence

relation on P such that the quotient P/
, the set of all equivalence classes, is a

group. In this case
is called the fundamental equivalence relation on P and P/
is called the fundamental group. The unite of P/
is
(e) and is denoted by . It

is easy to see that P (see [5]).
Now we dene the commutativity degree of a polygroup. Hereafter, we suppose
that the polygroup P is nite.
Denition 2.3. We dene the commutativity degree of a polygroup P , denoted
by d(P), in the following way,
d(P) =
|{(x, y) P P; x.y. = y.x.}|
|P|
2
.
A polygroup P is called commutative if x.y = y.x for all x, y P. Therefore
d(P) = 1, if P is a commutative polygroup.
89
Let H and K be two poly groups. One can check that P = HK is a polygroup
with the operation (x, y).(z, t) = {(r, s); r x.z, s y.t} (see [5]).
Theorem 2.4. Let H and K be two poly groups and P = H K. Then
d(P) = d(H)d(K).
Proof. By Theorem 4.3.3 in [5] for all h H, k K we have
(h, k) = (
1
(h),
2
(k))
where
1
and
2
are the fundamental equivalence relations on H and K, respectively.
Using this identity and Denition 2.3, one can obtain the assertion.
Lemma 2.5. Let P be polygroup and H be a normal subpolygroup of P. If
(e) =
{e} then |Hx| = |H|, for all x P.
Proof. Using the identity
(e) = {e} one can prove that a

1
= a
2
if and only if
(a
1
) =
(a
2
). This fact implies that the map h h.x is a bijection from H to
Hx and so the result follows.
The following corollary is a useful consequence of Lemma 2.5.
Corollary 2.6. Let P be polygroup such that
(e) = {e}. Then |P/H| = |P|/|H|,

for any normal subpolygroup H of P.
Theorem 2.7. Let P be polygroup such that
(e) = {e} and H be a normal

subpolygroup of P. Then
d(H)
|P/H|
2
d(P).
Proof. Let x P and C
P
(x) = {y P; x.y. = y.x.} be the centralizer of x in P.
Then by Denition 2.3 and Corollary 2.6 we have
d(P) =
xP
|C
P
(x)|
|P|
2

xH
|C
H
(x)|
|P|
2
=
d(H)
|P/H|
2
.
Denition 2.8. Let P be a polygrpoup. Then the center of P is dened to be
Z(P) = {x|x.y. = y.x., y P}.
It is easy to see that Z(P) P and Z(P).
The following theorem gives a lower bound for the commutativity degree of a
polygroup under some condition.
90
Theorem 2.9. Let P be polygroup such that
(e) = {e}. If |P/Z(P)| = l, then

d(P)
2l l
l
2
.
Proof. Put Z = Z(P). Since Z P and Z, thus |P| = l|Z|, by Corollary 2.6.
Then we have
d(P)|P|
2
= |{(x, y); x.y. = y.x.}|
|{(x, y); x Z or y Z}|
= |{(x, y); x Z, y P}| +|{(x, y); x P, y Z}| |{(x, y); x, y Z}|
= |P Z| +|Z P| |Z Z|
= (2l 1)|Z|
2
.
This implies that d(P) 2l 1/l
2
.
References
[1] J.D. Dixon . Probabilistic group theory. Carleton University (September 27,
2004) http://www.math.carleton.ca/ jdixon/Prgrpth.pdf.
[2] P. Erdos and P. Turan, (1968). On some problems of a statistical group-theory
iv, Acta Mathematica Academiae Scientiarum Hungaricae Tomus, 19 (1968),
413-435.
[3] S.D. Comer, Hyperstructures associated with character algebra and color
schemes, New Frontiers in Hyperstructures, Hadronic Press, (1996) 49-66.
[4] S.D. Comer, Extension of polygroups by polygroups and their representations
using colour schemes, Lecture notes in Meth., No 1004, Universal Algebra and
Lattice Theory (1982), 91-103.
[5] B.Davvaz, Polygroup theory and related systems, World scientic, 2013.
91
The 6
th
Finite p-groups whose order of their Schur multiplier is
given(t=6)
S. Hadi Jafari
s.hadi
Jafari@yahoo.com
Abstract
We classify nite p-groups by the order of their Schur mul-
tiplier.
1 Introduction
Study on the Schur multiplier of groups which has inuence in other scopes of group
theory returns to 1904. To achieve the order of it, there are obtained several bounds.
For instance when G is a nite p-group of order p
n
, Green [3] has shown that the
order of M(G), the Schur multiplier of G is at most p
1
2
n(n1)
. One of the interesting
subjects is to classify p-groups when the order of their Schur multiplier is determined.
More exactly, if |M(G)| = p
1
2
n(n1)t
, for some integer t 0, the characterization
of p-groups for 0 t 5 is given ([1], [2], [1], [5]). We will continue that when
t = 6. Another concept which is studied independently from 1987 is the non-abelian
tensor square of groups was introduced by R. Brown et al. Both of these concepts
eect on each other and we will use these eects to prove our results.
2 Main results
Lemma 2.1. If Z is a central subgroup of a group G contained in G
, then the
following sequence is exact:
Z G GG G/Z G/Z 1 ()
2010 Mathematics Subject Classication. Primary 20D99; Secondary 19C09.
Key words and phrases. Schur multiplier, Non-abelian tensor square.
92
Lemma 2.2. Let G be a d-generator group of order p
n
, the derived factor
G
G
of
order p
m
with exponent p
e
and the central factor
G
Z(G)
be a -generator group, then
|M(G)| p
d(me)/2+(1)(nm)max{0,2}
.
Assume that G is a d-generator p-group of order p
n
with
|M(G)| = p
1
2
n(n1)t
(1)
We also assume that
G
Z(G)
is a -generator group, |G
| = p
c
and the Frattini sub-
group (G), is of order p
a
and so a = n d. Ellis [2] proved that |M(G)|
p
{
1
2
d(2n2cd1)+2(1)c}
. So
2(t c) a
2
a (2)
The classication of p-groups when 0 t 5 is given as follows.
Theorem 2.3. Let G be a p-group of order p
n
. Then
(i) (Ya. G. Berkovich [1]) t = 0 if and only if G is elementary abelian;
(ii) (Ya. G. Berkovich [1]) t = 1 if and only if G

= C
p
2 or G

= E
1
p
3
;
(iii) (X. Zhou [5]) t = 2 if and only if G

= C
p
C
p
2, G

= D
8
or E
1
p
3
C
p
;
(iv) (G. Ellis [2]) t = 3 if and only if G

= C
p
3, (C
p
)
2
C
p
2, G

= D
8
C
2
, E
1
p
3

C
(2)
p
, Q
8
or E
2
p
3
;
(v) (F. Saeedi et al. [1]) t = 4 if and only if G

= (C
p
2)
2
, (C
p
)
3
C
p
2, G

=
Q
8
C
2
, D
8
C
(2)
2
, T
1
, T
4
, E
1
p
3
C
(3)
p
, E
2
p
3
C
p
, X
1
, X
4
, X
5
, X
6
or Y
3
;
(vi) (F. Saeedi et al. [1]) t = 5 if and only if G

= C
p
C
p
3, (C
p
)
4
C
p
2,
G

= Q
8
C
(2)
2
, D
8
C
(3)
2
, T
4
C
2
, T
2
, D
8
D
8
, D
8
Q
8
, D
16
, E
1
p
3

C
(4)
p
, E
2
p
3
C
(2)
p
, E
1
p
5
, E
2
p
5
, X
4
C
p
, X
2
, X
7
, X
8
or X
9
.
Our main result is the following Theorem:
Theorem 2.4. Let G be a p-group of order p
n
. Then t = 6 if and only if G

= (C
p
)
5
C
p
2, C
p
(C
p
2)
2
, C
p
4, T
12
,
5
(21
4
)b, Q
8
C
(3)
2
, D
8
C
(4)
2
, T
4
(C
2
)
2
, D
8
D
8
C
2
, D
8
Q
8
C
2
, E
1
p
3
C
(5)
p
, E
2
p
3
C
(3)
p
, E
1
p
5
C
p
, E
2
p
5
C
p
, X
4
(C
p
)
2
, X
3
, T
3
, E
1
p
3
C
p
2, X
1
C
p
, T
1
C
2
, Q
16
, QD
16
, T
10
, T
11
, Y
4
, Y
3
C
p
or X
6
C
p
.
where D
n
, Q
n
, and QD
n
are Dihedral, Quaternion and QuasiDihedral groups of
order n, respectively. Also the groups T
,
i
s, X
,
i
s and Y
3
are described in table I.
93
Proof. Suppose t = 6. Then (2) implies that (c, a) = (0, 0), (0, 1), (0, 2),
(0, 3), (0, 4), (1, 1), (1, 2), (1, 3), (2, 2), (2, 3) or (3, 3).
It is readily veried the abelian cases. So assume that G is non-abelian. We use
the notations of James Classication of p-groups of order at most p
6
, p is odd.
Suppose (c, a) = (1, 1). If Z(G) is cyclic, then G is generalized extra special,
|G| = p
6
and G = T
12
for p = 2 and G =
5
(21
4
)b when p = 2. If Z(G) is non-cyclic,
then G

= M C
p
where M is a maximal subgroup of G and t(M) = t(G) 1. So
the desired groups obtain.
Suppose (c, a) = (1, 2). Then G
ab
= C
p
2 (C
p
)
n3
and Lemma 2.2 implies that
2n 4 6, hence n = 4, 5. If n = 4, then G

= X
1
=
2
(31) for odd prime p and for
p = 2, G = T
3
. If n = 5 then it follows that G

= Y
1
=
2
(2111)c or Y
2
=
2
(2111)d.
If p = 2 then G = T
1
C
2
by GAP.
The case (c, a) = (1, 3) contradicts our condition. Suppose (c, a) = (2, 2). Then
d = or + 1.
Case 1) If d = then by Lemma 2.2, n 7. If n = 7 then d = 5 and G is of
exponent p. The exact sequence (*) implies that (1) can not hold. If n = 6 then G
belongs to one of families
12
,
13
,
15
or
22
and there is no group in any case.
Let n = 5. Then G may be in the families
4
or
7
. At the rst family put
Z = Z(G) and see that |(Z G) (GZ)| p
2
and |GG| p
11
, a contradiction.
In other groups of this family the same result holds and exceptionally the order of
non-abelian tensor square of group
4
(1
5
) is equal to p
14
.
In family
7
, put Z = Z(G) and see that Z G = 1 except
7
(1
5
). When
G =
7
(1
5
), |M(G)| = p
4
. If n = 4 then G belongs to
3
and there is no group
which satises (1).
Case 2) Suppose d = + 1, then by Lemma 2.2, n 6. Thus G belongs to one
of families
3
,
4
,
7
. If d = 4 and n = 6, then by Lemma 2.2, G can belong to
4
or
7
. If G

= H C
p
then the order of H H should be p
14
and H

=
4
(1
5
),
so G

=
4
(1
5
) C
p
. If d = 3 and n = 5, G should belongs to family
3
. When G
has the direct product form, only the group
3
(1
4
) C
p
satises our condition and
there isnt any other group. If p = 2 then G = Q
16
, QD
16
, T
10
or T
11
by GAP.
In other cases one can similarly show that there is no group to satises our
condition.
94
TABLE I
Name Relations/Structure Description
T
1
a
4
= b
2
= c
2
= 1, [a, c] = b, [a, b] = [b, c] = 1
T
2
a
4
= b
4
= 1, [a, b] = a
2
T
3
a
8
= b
2
= 1, [a, b] = a
4
T
4
a
4
= b
2
= c
2
= 1, [b, c] = a
2
, [a, b] = [a, c] = 1
T
5
a
4
= b
2
= c
2
= 1, [a, c] = [b, c] = 1, (ba)
2
= (ab)
2
, ba
2
= a
2
b
T
6
a
4
= b
4
= c
2
= 1, ba = ab
1
, [b, c] = [a, c] = 1
T
7
a
4
= b
2
= c
4
= 1, ca
1
= a
1
c, [c, b] = 1, bc
1
a
1
= a
1
cb
1
, bca
1
= a
1
c
1
b
1
, a
1
b = ab
1
a
2
T
8
b
2
= c
2
= 1, [b, c] = 1, ca
1
= a
1
c, a
2
ba
1
= ab
T
9
b
2
= c
2
= 1, [b, c] = 1, ca
1
= a
1
c, a
2
ba
1
= ab
T
10
a
2
= b
2
= c
2
= 1, [a, b] = 1, [a, c, b] = 1, [b, c, a] = 1, [b, c, b] = 1
T
11
a
4
= b
4
= c
2
= 1, [a, b] = 1, [a, c] = a
2
, [b, c] = b
2
T
12
b
2
= c
2
= d
2
= e
2
= 1, [b, c] = 1, [d, c] = [e, b] = a
2
, [a, b] = a, c] = [a, d] = [a, e] = [b, c] = [b, d] = [c, e] = [d, e] = 1
X
1
a
p
2
= b
p
= c
p
= 1, [a, c] = b, [a, b] = [b, c] = 1
X
2
a
p
2
= b
p
2
= 1, [a, b] = a
p
X
3
a
p
3
= b
p
= 1, [a, b] = a
p
2
X
4
a
p
2
= b
p
= c
p
= 1, [b, c] = a
p
, [a, b] = [a, c] = 1
X
5
a
9
= b
3
= c
3
= 1, [a, b] = 1, [a, c] = b, c
1
bc = a
3
b
X
6
a
p
= b
p
= c
p
= d
p
= 1, [c, d] = b, [b, d] = a, [a, b] = [a, d] = [b, c] = [a, c] = 1
X
7
a
p
2
= b
p
= c
p
= 1, [a, c] = b, [b, c] = 1, [a, b] = a
p
X
8
a
p
2
= b
p
= 1, c
p
= a
p
, [a, c] = b, [b, c] = 1, [a, b] = a
p
X
9
a
p
2
= b
p
= 1, c
p
= a
p
, [a, c] = b, [b, c] = 1, [a, b] = a
p
( = 0, 1 and non residue mod p )
Y
1
Cp ((C
p
2
Cp) Cp)
Y
2
C
p
2
((Cp Cp) Cp)
Y
3
C
(4)
p
Cp
Y
4
(Cp ((Cp Cp) Cp)) Cp
Y
5
Cp (C
p
2
C
p
2
)
Y
6
(C
p
2
C
p
2
) Cp
Y
7
C
p
2
(C
p
2
Cp)
Y
8
Cp (C
p
3
Cp)
Y
9
(C
p
3
Cp) Cp
References
[1] Ya. G. Berkovich, On the order of the commutator subgroups and the Schur
multiplier of a nite p-group, J. Algebra 144 (1991), 269-272.
[2] G. Ellis, On the Schur multipliers of p-groups, Comm. Algebra 27 (9) (1999),
4173-4177. (1999), 191196.
[3] E. Khamseh, F. Saeedi and M. R. R. Moghaddam , Characterization of nite
p-groups by their Schur multiplier, Journal of Algebra and its applications 12 (5)
(2013), 1250035(9 pages).
[4] G. Karpilovsky, The Schur Multiplier, LMS Monogrphs New Series 2. New York:
Oxford University Press, 1987.
[5] X. Zhou, On the order of Schur multipliers of nite p-groups, Comm. Algebra 22
(1) (1994), 18.
95
The 6
th
Investigating equality of edge and vertex connectivity
number in prime graph of alternative groups
Maryam Jahandideh
1
, Hamid Kazemi Esfeh
2
and Nabieh Farhami
3
1
Department of Mathematics, Mahshahr Branch, Islamic Azad University, Mahshahr, Iran
m.jahandideh.kh@gmail.com
2,3
Faculty of Chemical Engineering, Mahshahr Branch, Islamic Azad University,
Mahshahr, Iran
h.kazemi.esfeh@gmail.com, farhaminabieh@yahoo.com
Abstract
Let G be a nite group. We dene the prime graph (G) as
follows: The vertices are the primes numbers dividing the
order of G and two vertices p, q are joined by an edge if
there is an element in G of order pq. Suppose that G is a
nite graph, the edge connectivity number is the minimum
of edges (G) whose deletion from G disconnects G and
vertex connectivity number is the minimum of vertices k(G)
whose deletion from G the disconnects G. In this paper,
we will prove that the edge and vertex connectivity number
of (A
n
) where A
n
is the alternative group of degree n are
equal to each other or equal to the degree of the biggest
prime number of
1
(A
n
). We use the classication of nite
simple groups.
1 Introduction
Let A
n
be an alternative group and (A
n
) the set of prime numbers dividing the
order of A
n
. We dene the prime graph (A
n
) as follows: The vertices are elements
Speaker
2010 Mathematics Subject Classication. 05C12.
Key words and phrases. Symmetric group ,Alternative group , Prime graph, Edge and vertex
connectivity number.
96
of (A
n
), and two distinct vertices p, q are joined by an edge. We write p q,
if there is an element of order pq of A
n
. Note that p q if and only if there is
a cycle subgroup of A
n
of order pq . All the studies and researches conducted on
the connected components of (A
n
) can be found in reference [1 4].We denote
the connected components of (A
n
) by
1
,
2
, . . . ,
t
, where t is the number of
connected components of (A
n
)[5] .Since the order of A
n
is even , we take
1
to be
the component containing 2. Let d(p, q) be the distance between two vertices p, q
in A
n
[8]. We can dene the edge and vertex connectivity number in A
n
as follows:
The edge connectivity number is the minimum of edges (A
n
)) whose deletion
from (A
n
) disconnects (A
n
) and vertex connectivity number is the minimum of
verticesk ((A
n
)) whose deletion from (A
n
) the disconnects (A
n
). The purpose
of this paper is to prove:
Theorem 1.1. Let A
n
be an alternative group. If p
1
(A
n
), d(2, p) = 2, then
((A
n
)) = k((A
n
)) = 1(in
1
(A
n
)).
Theorem 1.2. Let A
n
be an alternative group. q is the biggest prime number in
1
(A
n
)(q = 3), then ((A
n
)) = k((A
n
)) = degree(q).(in
1
(A
n
))
2 PRELIMINARIES
The following lemmas are fundamental to prove the theorems.
Lemma 2.1. Let p, q are odd prime factors of n! and p +q > n, then S
n
(where S
n
is the symmetric group) dosnt have element of order pq.
Proof. We prove this by contradiction. We assume S
n
has a permutation like of
order pq.We know that every permutation in S
n
is a cycle or a nite product of
separate cycles [9 10]. We consider the two following cases:
Case1. If be a cycle. So , = (a
1
a
2
. . . a
k
),
pq
= 1, then the length of is equal
pq. We know pq p + q > n. It is not possibility because the length of is bigger
than n.
Case 2. If be nite product of separate cycles.
Thus, there exists i and j then: p
o(
i
), q
o(
j
).
i
and
j
don t separate because
p +q > n. Therefore S
n
doesnt have an element of order pq.
Lemma 2.2. Let A
n
be an alternative group. p is the prime factor
of n! p > 3 and p + 4 > n, then A
n
doesnt have element of order 2p.
Proof. We assume that A
n
has a permutation like of order 2p. cant be a cycle
of order 2p , because the number of transpositions is odd. Thus is nite product
of separate cycles.
97
Thus there exists i = j2
o(
i
), p
o(
j
). It is not possible, because p + 4 > n.
Now,A
n
doesnt have two separate cycle of order p and 2.
3 THE MAIN RESULTS
Proof of Theorm 1.1. According to assumption of theorem, we have d(2, p) = 2, so
that there exists a prime number as q that 2 q p and p +4 > n. Now, we show
that q is equal to 3.We have (p +q) < n and (p +4) > n, then q = 3. We prove that
degree p is equal one. If degree of p is not one, there exists another prime number
as r bigger than 3 such that p r, (p +r) < n.
5 r (5 +p) (r +p) < n (p + 4) < (p + 5) p +r < n d(2, p) = 1.
Thus we delete the edge between two vertices p and 3. The rst connected compo-
nents of (A
n
) is disconnected or (((A
n
)) = 1). Deleting vertex (3) of (A
n
), the
rst connected component of (A
n
) is disconnected and
k((A
n
)) = 1 .
Proof of Theorm 1.2. At rst, we suppose that q is the biggest prime number in
1
(A
n
) and degree of q is equal to m. Thus m edges pass from q, we dene this edge
as the following:
q 2(e
1
), q 3(e
2
), . . . , q p
m
(e
m
) where (2 < 3 < . . . < p
m
).
All of the prime numbers of this set {2, 3, . . . , p
m
} join to q. Thus these prime
numbers are joined by an edge to all prime numbers of
1
(A
n
). Now, we show that
((A
n
)) = k((A
n
)) = m. We know that degree (q) = m, thus by deleting m edges
passing from q, this graph is disconnected. Now, we prove that m is the smallest.
For proof, we use of contradiction, that is((A
n
)) = t, t < m. In this prime graph,
all of the degrees of vertices are bigger than m; so that we can delete these t edges
from dierent vertices (a vertex may be repetitious). These t edges are dened by:
p
1
q
1
(f
1
), p
2
q
2
(f
2
), . . . , p
t
q
t
(f
t
). For proof, we consider the following three
dierent cases:
1. The elements of two set {p
1
, . . . , p
t
}, {q
1
, . . . , q
t
} have been selected of this set
{2, 3, 5, . . . , p
m
}. We have t < m, so there exist
p
i
{2, 3, . . . , p
m
} {p
1
, . . . , p
t
}, p
j
{2, 3, . . . , p
m
} {q
1
, . . . , q
t
}
that p
i
p
j
and no edge delete of this two vertices. Because (p
i
+q) < n, (p
j
+q) < n.
Therefore this prime graph is connected.
2. The elements of two set {p
1
, . . . , p
t
}, {q
1
, . . . , q
t
} have been selected of this set
{2, 3, 5, . . . , p
m
}. If all elements of the two sets {p
1
, . . . , p
t
}, {q
1
, . . . , q
t
} are selected
98
from this set {p
m+1
, . . . , q}, all of the vertices are connected to the vertices 2 and
3. There is an edge between the two vertices 2 and 3 too. Thus this prime graph is
connected.
3. If all of prime numbers of this set {p
1
, . . . , p
t
} are selected from the elements of
the two sets {2, . . . , p
m
}, {p
m+1
, . . . , q}. We have:
p
i
q
1
p
i
{2, . . . , p
m
} {p
1
, . . . , p
t
}
.
.
.
p
i
q
t
In this case, prime graph is connected again. Thus the edge number connectivity
cant be smaller than m and ((A
n
)) = m. Now, we show that k((A
n
)) =
m. Degree (q) is m, so vertex q connects to m vertices. If we delete m vertices
from the prime graph, vertex q is alone and the prime graph is disconnected. For
proof, we use contradiction. Assume that, k((A
n
)) = t and t < m, hence by
deleting t verticesp
1
, . . . , p
t
this graph be disconnected. If vertices {p
1
, . . . , p
t
} are
selected from the elements of the set {2, 3, . . . , p
m
}, there exists a vertex p
i
that p
i

{2, 3, . . . , p
m
}{p
1
, . . . , p
t
}. Because vertex p
i
is not deleted and it is connected to all
remainder vertices, thus the remainder graph is connected. If vertices {p
1
, . . . , p
t
}
are selected from the elements of the set {p
m+1
, . . . , q}, in this case vertex 2 is
connected to all other vertices, thus the remainder graph is connected.
Now, if vertices {p
1
, . . . , p
t
} are selected from the elements of the sets
{2, 3, . . . , p
m
} and {p
m+1
, . . . , q}.
Thus there exists p
i
{2, 3, . . . , p
m
} {p
1
, . . . , p
t
} that connects to all remainder
vertices and the remainder graph is connected and k((A
n
)) = m.
Acknowledgements
Authors gratefully acknowledge the nancial support provided by Islamic Azad Uni-
versity of Mahshahr, Iran to perform research project entitled: Investigating equal-
ity of edge and vertex connectivity number prime graph of alternative groups.
References
[1] J. H. Conway, Atlas of nite groups : maximal subgroups and ordinary characters
for simple groups, Clarendon Press; New York, 1985.
[2] D. J. S. Robinson, A course in the theory of groups, Springer-Verlag, New York,
1982.
99
[3] J. J. Rotman, An introduction to the theory of groups, 4th ed., Springer-Verlag,
New York, 1995.
[4] J. S. Williams, Prime graph components of nite groups, Journal of Algebra,
69 (1981) 487513.
[5] N. Iiyori, H. Yamaki, Prime Graph Components of the Simple Groups of Lie
Type over the Field of Even Characteristic, Journal of Algebra, 155 (1993)
335343.
100
The 6
th
A note on the tensor and exterior center of a pair of Lie
algebras
Farangis Johari
1
, Peyman Niroomand
2
and Mohsen Parvizi
3
1
farangisjohary@yahoo.com
2
School of Mathematics and Computer Science, Damghan University, Damghan, Iran
niroomand@du.ac.ir
3
parvizi@math.um.ac.ir
Abstract
In this talk using the notions of tensor and exterior central-
izers for a pair of Lie algebras, we collect some facts con-
cerning these notions for a pair of Lie algebras and study
the relations between them and capability of pairs.
1 Introduction and Motivation
Lemma 1.1. Let L be a Lie algebra, N be an ideal of L and l L. Then
C
l
(N) = {n N|0 = l n L N}
is a subalgebra of L which is called the (l, N)-tensor centralizer of l L, in fact it
is an ideal of C
L
(l).
Denition 1.2. Let L be a Lie algebra, N be an ideal of L and l L. Then
(i)

E(N, l) = {n N|l (x +n) = l x, x N},
Speaker
Key words and phrases. Tensor and exterior centralizers of pair Lie algebras, Tensor center
of pair Lie algebras, Exterior center of pair Lie algebras, Capability, Relative Schur multiplier,
Non-abelian tensor product.
101
(ii) E
(N, l) = {n N|l (n +x) = l x, x N}.

Lemma 1.3. Let L be a Lie algebra, N be an ideal and l L. Then

E(N, l) and
E
(N, l) are subalgebras of L. Also we have

(i)

E(N, l) = C
l
(N).
(ii) E
(N, l) =
E(N, l).
Corollary 1.4. Let L be a Lie algebra with ideal N. Then
Z
(L)
(N) =
lL
E
(N, l) =
lL
E(N, l) =
lL
C
l
(N).
Proposition 1.5. Let L be a Lie algebra with ideal N, K be an ideal of L contained
in N and l L. Then the following sequences are exact
(i) 0 C
l
(N) K C
l
(N) C
l+K
(N/K),
(ii) 0 Z
L
(N) K Z
L
(N) Z
L/K
(N/K).
Corollary 1.6. Let L be a Lie algebra with ideal N, K be an ideal of L con-
tained in N and l L. According to Lemma 2, K C
l
(N) if and only if
C
l
(N)/K = C
l+K
(N/K). In particular, we have K C
l
(N) for all l L if
and only if Z
L
(N)/K = Z
L/K
(N/K).
C
l
(N) = {n N|0 = l n L N}
is a subalgebra of L. It is called the (l, N)-tensor centralizer of l L. It is also an
ideal of C
L
(l).
Denition 1.8. Let L be a Lie algebra, N be an ideal of L and l L. Then
(i)

E(N, l) = {n N|l (x +n) = l x, x N},
(ii) E
(N, l) = {n N|l (n +x) = l x, x N}.


E(N, l) and
E
(N, l) are subalgebras of L. Also we have

(i)

E(N, l) = C
l
(N).
(ii) E
(N, l) =
E(N, l).
102
Corollary 1.10. Let L be a Lie algebra with ideal N. Then
Z
(L)
(N) =
lL
E
(N, l) =
lL
E(N, l) =
lL
C
l
(N).
Proposition 1.11. Let L be a Lie algebra with ideal N and K be an ideal contained
in N and l L. Then the following sequences are exact
(i) 0 C
l
(N) K C
l
(N) C
l+K
(N/K),
(ii) 0 Z
L
(N) K Z
L
(N) Z
L/K
(N/K).
Corollary 1.12. Let L be a Lie algebra with ideal N and K be an ideal contained in
N and l L. By Lemma 2, K C
l
(N) if and only if C
l
(N)/K = C
l+K
(N/K). In
particular, we have K C
l
(N) for all l L if and only if Z
L
(N)/K = Z
L/K
(N/K).
Corollary 1.13. Z
L
(N) is the smallest subalgebra of L contained in N such that
the pair (L/Z
L
(N), N/Z
L
(N)) is capable.
Proposition 1.14. Let L be a Lie algebra with ideal N and l L. Then C
N
(l)/C
l
(N)
is isomorphic to a subalgebra of M(L, N).
Corollary 1.15. Let L be a Lie algebra with ideal N and l L such that C
N
(l) =
C
l
(N). Then M(L, N) = 0
Let T be dened as
T =
lZ(L)
C
l
(N).
It is easy to see that T is an ideal of L contained in N. In particular if L is an
abelian Lie algebra, then T = Z
L
(N).
Lemma 1.16. Let T =
lZ(L)
C
l
(N). Then [N, L] T.
Proposition 1.17. Let L be a Lie algebra with ideal N such that C
L
(x) = C
x
(N)
for all x out of Z(L). Then [N, L] Z(L) is a subalgebra of Z
L
(N). In particular if
(L, N) is a capable pair then [N, L] Z(L) = 0.
Corollary 1.18. let (L, N) be a nilpotent capable pair. Then there is no element
x in Z(L) such that C
L
(x) = C
x
(N).
Corollary 1.19. Let T = Z
L
(N) then (L, N) is a nilpotent pair of class at most 2.
Furthermore if M(L, N) = M(L/T, N/T) then (L, N) is an abelian pair.
Recall that the pair (L, N) of Lie algebra is called unicentral if Z
L
(N) = Z(L)
N.
103
Corollary 1.20. Let L be a Lie algebra with ideal N. Then T = N if and only if
(L, N) is an unicentral pair.
Theorem 1.21. Assume that (L, N) be a pair of Lie algebras with M(L, N) of nite
dimension and L/Z
L
(N) is d-generator. Then
dim(Z(L) N)/Z
L
(N) d(dimM(L, N)).
Corollary 1.22. With the assumptions of Theorem 1.21, a pair (L, N) with trivial
M(L, N) has C
x
(N) = C
N
(x) for all x L. In particular (Z(L) N) = Z
L
(N).
Corollary 1.23. Let L be a nite dimensional Lie algebra with ideal N and [N, L]
Z
L
(N) and L/Z
L
(N) is d-generator. Then
dimL d(dimM(L, N) + dim[N, L]) + dimZ
L
(N).
Proposition 1.24. Let (L, N) be a capable pair of Lie algebra introduced in The-
orem 1.21. Then dimZ(L) N d(L/T)(dimM(L, N)).
References
[1] U. Haagerup, Solution of the similarity problem for cylic representations of
C
-algebras, Ann. of Math. (2) 118 (1983), no. 2, 215240.

[2] A.A. Jamshidian,

Cebyshev inequality, Linear Multilinear Algebra,
arXiv:1154.1464v2 (to appear).
[3] Z. Rezaei, A.A. Jamshidian and Gh. Babaei Tehrani, Cyclic nilpotent groups,
Proc. Amer. Math. Soc. 145 (2008), no. 11, 33183321.
[4] G. Karpilovsky, The Schur multiplier, LMS Monogrphs New Series 2, Oxford
Univ. Press, 1987.
[5] J. Mi
lovc, Lie symmetries of systems of second-order linear ordinary dierential

equations, Nonlinear analysis, 239267, Springer Optim. Appl., 65, Springer,
New York, 2011.
104
The 6
th
Capability of nite nilpotent groups of class 2 with
cyclic Frattini subgroups
Azam Kaheni
1
, Rasoul Hatamian
2
and Saeed Kayvanfar
3
1
Department of Mathematics, University of Birjand, Birjand, Iran
azamkaheni@birjand.ac.ir
2
hatamianr@yahoo.com
3
skayvanf@math.um.ac.ir
Abstract
A group is called capable if it is a central factor group. Let
N denote the set of all nite groups of nilpotency class 2
whose derived subgroups be cyclic and coincide with their
Frattini subgroups. This talk is organized to provide the
explicit structures of capable groups in N.
1 Introduction
A group G is said to be capable if it is isomorphic to the group of inner automor-
phisms of some group K. Baer [1] characterized the capable groups that are direct
sums of cyclic groups. The capability of very specic classes, such as metacyclic
groups, extra special p-groups, nilpotent products of cyclic p-groups of class less
than or equal to p is also investigated. Moreover, some numerical necessary and
sucient conditions for capability of p-groups of class 2 and prime exponent are
known.
Speaker
2010 Mathematics Subject Classication. Primary 20D15; Secondary 19C09
Key words and phrases. Capable groups, Extra special p-groups, Nilpotent groups, Schur
multiplier.
105
Now, let N denote the set of all nite groups of nilpotency class 2 whose derived
subgroups be cyclic and coincide with their Frattini subgroups. In this talk, we will
determine the exact structures of capable groups in N. Since, a nilpotent group is
capable if and only if each of its Sylow subgroups is capable, we reduce the problem
to a restricted subclass. In other words, we shall rst focus on p-groups with at least
two generators, then conclude the main result for nite nilpotent groups in N. Fi-
nite capable two generated p-groups of class 2 had been listed by Bacon, Kappe and
Magidin. Notice that the commutator subgroup of a nite two generated p-group
of class 2 is always cyclic. But a nite p-group of class 2 with cyclic commutator
subgroup may not be two generated such as extra special p-groups. For this reason,
Yadav [4] interested in studying nite capable p-groups of class 2 with cyclic com-
mutator subgroups. He proved this problem for a group G for which Z(G) (G).
Accordingly, our result for p-groups gives an answer to Yadavs problem [4] and the
main result also is the generalization of the work in [3].
2 Preliminaries
For a group G, recall from [2] that the epicenter of G is denoted by Z
(G) and
dened to be the intersection of all (Z(E)), where (E, ) is a central extension of
G. A relation between Z
(G) and the notion of capability is provided by Beyl et al.

[2] as follows.
Theorem 2.1. Z
(G) is the smallest central subgroup of G whose factor group is

capable. In particular, G is capable if and only if the epicenter of G is trivial.
Obviously, the class of all capable groups is neither subgroup closed nor under
homomorphic image. But this class is closed under direct product (see [2, Proposi-
tion 6.1]), and therefore Z
iI
G
i
)
iI
Z
(G
i
), for each family {G
i
} of groups.
One should also note that the inclusion is proper in general. Beyl et al. [2] gave a
sucient condition forcing equality as follows.
Proposition 2.2. Let G =
iI
G
i
. Assume that for i = j the maps
i
1 :
Z
(G
i
) G
j
/G
j
G
i
/G
i
G
j
/G
j
are zero, where
i
is the natural map Z
(G
i
)
G
i
G
i
/G
i
. Then Z
(G) =
iI
Z
(G
i
).
This certainly indicates that a nite nilpotent group is capable if and only if its
Sylow subgroups are capable.
The exact structures of capable extra special p-groups are given by Beyl et al.
[2] as follows.
106
Theorem 2.3. An extra special p-group is capable if and only if it is either D
8
or
E
1
, where D
8
is the dihedral group of order 8 and E
1
is the extra special p-group of
order p
3
and exponent p (p > 2).
Beyl et al.[2] proved a necessary condition for a group to be capable as follows.
Lemma 2.4. [2, Proposition 1.2] If G is capable and the commutator factor group
G/G
of G is of nite exponent, then also Z(G) is bounded and the exponent of

Z(G) divides that of G/G
.
3 Main results
In view of Proposition 3.4, one can obtain some interesting results about nilpotent
capable groups. For example, it is easy to conclude that there is no nilpotent capable
group of square free order. Moreover, if the order of a nilpotent capable group G is
as p
1
1
p
2
2
. . . p
t
t
, then
i
should be greater than 1, for each 1 i t. In this section,
the capability of some nilpotent groups of class 2 has been studied. Actually, the
explicit structures of nilpotent capable groups in N are determined.
Lemma 3.1. Let G be a p-group of nilpotency class 2. If G
= (G), then there

exists a subgroup H of G such that G = HZ(G) and H
= Z(H).
Let G be a nite p-group such that (G) Z(G). It is easy to see that the
derived subgroup of G is an elementary abelian group. Now under some conditions,
it can be deduced that the exponent of Z(G) is also p.
Lemma 3.2. If G is a capable p-group such that (G) G
, then Z(G) is an
elementary abelian p-group.
Invoking Theorem 2.3 and Lemma 3.2 we have the following corollary.
Corollary 3.3. Let G be a nite capable p-group of nilpotency class 2. If G
= (G)
is a cyclic group, then G is of order p
3
or Z(G) is not cyclic.
The following theorem shorten the proof of the next theorem.
Theorem 3.4. Let G be a nite p-group of nilpotency class 2 and G
= (G) be a
cyclic group. Then G is capable if and only if G

= E
1
K or G

= D
8
K, where
K is an elementary abelian p-subgroup of Z(G).
Certainly, the exact structure of a capable p-group of order p
n
which its derived
factor group is elementary abelian of rank p
n1
, is given by the above theorem. So,
the work of Niroomand and Parvizi [3] is generalized.
107
We are now ready to prove the main theorem as follows.
Suppose that G belongs to N. Then G

= H
1
. . . H
t
, in which H
i
s are Sylow
p
i
-subgroups of G. Let H
j
be an abelian p
j
-subgroup for each 1 j r, and the
nilpotency class of other H
i
s be 2. Let G
l
= Z
(s
l
)
p
l
, where s
l
is a natural number
grater than 1, and 1 l r. Also, let G
m
= E
pm
K
pm
, in which K
pm
is an
elementary abelian p
m
-subgroup of Z(H
m
) and E
pm
is an extra special p
m
-group of
order p
3
m
and exponent p
m
(p
m
> 2) for each r < m t.
Theorem 3.5. Suppose that G belongs to N. Consider H
i
s and G
i
s the groups
introduced as above.
(i) If 2 | / |G| or the Sylow 2-subgroup of G is abelian, then G is capable if and only
if G

=
t
i=1
G
i
.
(ii) If the Sylow 2-subgroup of G is non-abelian, then G is capable if and only if
G

= D
8
K
2
(
t
i=1
i=i
0
G
i
), where i
0
is the index of Sylow 2-subgroup of nilpotency
class 2 and K
2
is an elementary abelian 2-subgroup of Z(H
i
0
)
.
References
[1] R. Baer, Groups with preassigned central and central quotient group,Trans.
Amer. Math. Soc. 44 (1938), 387 412.
[2] F.R. Beyl, U. Felgner, P. Schmid, On groups occurring as center factor groups,
J. Algebra 61 (1979), 161 177.
[3] P. Niroomand, M. Parvizi, A remark on the capability of nite p-groups, J. Adv.
Res. Pure Math. 5 (2013), 91 94.
[4] M. Yadav, On nite capable p-groups of class 2 with cyclic commutator subgroups,
arXiv:1001.3779v1, 2010.
108
The 6
th
Support enumerators for some permutation groups
Reza Kahkeshani
1
and Masoomeh Yazdany Moghaddam
1
1
Department of Pure Mathematics, Faculty of Mathematical Sciences, Kashan University,
Kashann, Iran
kahkeshanireza@kashanu.ac.ir, yazdany.mo@gmail.com
Abstract
By dening a distance on a permutation group G, we can
consider it as a code such that the codewords are the ele-
ments of G. The support enumerator Q
G
(x, y) is one of the
polynomials related to G. In this paper, we determine the
polynomial Q
G
(x, y) for the dihedral group, some alternat-
ing groups and some projective special linear groups.
1 Introduction
Let G be a permutation group acting on = {1, ..., n} and let be the permutation
character of G (i.e., (g) denotes the number of xed points of g). A Hamming
distance on G is dened by d
H
(g, h) = n (gh
1
), for any g, h G. So, we
can consider the permutation group G as a code such that the codewords are the
elements of G.
Denition 1.1. The distance enumerator of G is the polynomial
G
(x) =
gG
x
d
H
(1,g)
=
gG
x
n(g)
.
Denition 1.2. The cycle index of G is the polynomial
Z(G; x
1
, ..., x
n
) =
1
|G|
gG
i1
x
c
i
(g)
i
,
Speaker
Key words and phrases. Cycle index, Distance enumerator, Permutation group, Support enu-
merator.
109
where c
i
(g) is the number of cycles of g of lenght i. For simplicity, Z(G; x
1
, ..., x
n
)
is sometimes shown by Z(G). Moreover,
P
G
(x) =
1
|G|
gG
x
(G)
=
1
|G|
n
i=0
m
i
x
i
,
where m
i
= |{g G|(g) = i}|.
Denition 1.3. The homogeneous support enumenerator of G is dened by
Q
G
(x, y) =
1
|G|
gG
x
(g)
y
n(g)
.
Obviously, we have the following relations:
1.
G
(x) = |G|x
n
P
G
(
1
x
),
2. Q
G
(x, y) = Z(G; x, y
2
, ..., y
n
),
_
i>1
ic
i
(g) = n (g)
_
,
3. P
G
(x) = Q
G
(x, 1),
4.
G
(y) = |G|Q
G
(1, y).
2 Some Identities
Let G and H be two groups acting on sets and , respectively, where || = n and
|| = m.
Proposition 2.1. [3]
Z(GH) = Z(G)Z(H).
Z(G H) = Z
_
H; Z(G; x
1
, x
2
, ...), Z(G; x
2
, x
4
, ...), ...
_
.
P
GH
(x) = P
G
(x)P
H
(x).
P
GH
(x) = P
H
_
P
G
(x)
_
.
Q
GH
(x, y) = Q
G
(x, y)Q
H
(x, y),
where GH is in the intransitive action on
.
110
Q
GH
(x, y) = Q
G
(x, y) Q
H
(x, y),
where GH is in the product action on and x
a
y
b
x
c
y
d
= x
ac
y
bc+ad+bd
.
Q
GH
(x, y) = Q
H
_
Q
G
(x, y), y
n
_
.
3 results
In this section, the support enumerator of some groups are determined.
1. Q
Zn
(x, y) =
1
n
_
x
n
+ (n 1)y
n
_
(see [1]).
2. Q
Sn
(x, y) =
1
n!
n
k=0
_
n
k
_
d(n k)x
k
y
nk
, where d(i) is the number of derange-
ments of a set of size i (see [1]).
3. Q
ZmSn
=
1
m
n
n!
mn
i=0
f(i)x
i
y
mni
, where
f(i) =
_
n
k=0
m
nk
(m1)
k
i
m
_
n
k
__
k
i/m
_
d(n k), if m | i,
0, if m i,
(see [1]).
4.
Q
D
2n
(x, y) =
_
1
2
(y
n
+xy
n1
), if n is odd,
1
4
(3y
n
+x
2
y
n2
), if n is even.
Using a computer program in GAP [4], we determine the support enumerators for
some alternating groups and projective special linear groups. See tables 1 and 2.
References
[1] R. F. Bailey, J. P. Dixon, Distance enumerators for permutation groups, Comm.
Algebra 35 (2007) 30453051.
[2] N. Boston, W. Dabrowski, T. Foguel, P. J. Gies, J. Leavitt, D. T. Ose, D. A.
Jackson, The proportion of xed-points-free elements of a transitive permutation
group, Comm. Algebra 21 (1993) 32593275.
111
Table 1: Support Enumerators of A
n
s
n Q
An
(x, y)
4
1
4
(x
4
+ 8xy
3
+ 3y
4
)
5
1
5
(x
5
+ 20x
2
y
3
+ 15xy
4
+ 24y
5
)
6
1
6
(x
6
+ 40x
3
y
3
+ 45x
2
y
4
+ 144xy
5
+ 130y
6
)
7
1
7
(x
7
+ 70x
4
y
3
+ 105x
3
y
4
+ 504x
2
y
5
+ 910xy
6
+ 930y
7
)
8
1
8
(x
8
+ 112x
5
y
3
+ 210x
4
y
4
+ 1344x
3
y
5
+3640x
2
y
6
+ 7440xy
7
+ 7413y
8
)
9
1
9
(x
9
+ 168x
6
y
3
+ 378x
5
y
4
+ 3024x
4
y
5
+10920x
3
y
6
+ 33480x
2
y
7
+ 66717xy
8
+ 66752y
9
)
10
1
10
(x
10
+ 240x
7
y
3
+ 630x
6
y
4
+ 6048x
5
y
5
+ 27300x
4
y
6
+11600x
3
y
7
+ 333585x
2
y
8
+ 667520xy
9
+ 667476y
10
)
Table 2: Support Enumerators of PSL(2,q)s
q Q
PSL(2,q)
(x, y)
2
1
3
(x
3
+ 3xy
2
+ 2y
3
)
3
1
4
(x
4
+ 8xy
3
+ 3y
4
)
4
1
5
(x
5
+x
2
y
3
+ 15xy
4
+ 24y
5
)
5
1
6
(x
6
+ 15x
2
y
4
+ 24xy
5
+ 20y
6
)
7
1
8
(x
8
+ 56x
2
y
6
+ 48xy
7
+ 63y
8
)
8
1
9
(x
9
+ 216x
2
y
7
+ 63xy
8
+ 224y
9
)
9
1
10
(x
10
+ 135x
2
y
8
+ 80xy
9
+ 144y
10
)
11
1
12
(x
12
+ 264x
2
y
10
+ 120xy
11
+ 275y
12
)
[3] P. J. Cameron, Combinatorics: topics, techniques, algorithms, Cambridge Uni-
versity Press, 1994.
[4] The GAP Group, GAPGroups, Algorithms and Programming, Version 4.4,
available at http://www.gap-system.org, 2004.
112
The 6
th
On semigroups generated by vector spaces
Ali Reza Khoddami
Department of Pure Mathematics, Shahrood University of Technology, Shahrood, Iran
khoddami.alireza@shahroodut.ac.ir
Abstract
For an arbitrary vector space S over C and 0 = S
we equip S with a multiplication converting S into a semi-

group, denoted by S
. The semigroup structure of S
are
investigated and in particular, the endomorphisms and au-
tomorphisms of S
are characterized.
1 Introduction
A semigroup is an algebraic structure consisting of a set together with an associa-
tive binary operation. A semigroup with an identity element is called a monoid.
A monoid in which every element has an inverse is called a group. A semigroup
homomorphism between two semigroups T and T
is a function : T T
such
that the equation (ab) = (a)(b) is hold for all elements a, b T. A semigroup
homomorphism from T into itself is called an endomorphism. For semigroup T, a
bijective endomorphism of T is called a semigroup automorphism. The set of all
semigroup automorphisms of T is denoted by AutT. In the case where T is an
algebra, Hom(T) is the set of all algebra endomorphisms of T.
In this paper let S be a non-zero vector space on C and let be a non-zero linear
functional on S. For each a, b S dene a b = (a)b. One can simply verify
that converts S into an associative algebra. We denote (S, ) by S
that is a
semigroup. Note that S
is not a monoid in general. Indeed S
is a monoid if and
only if dimS = 1. Also if dimS > 1 then Z(S
) = {0}, where Z(S
) is the center of
S
. It follows that S
is not abelian semigroup. Indeed S
is abelian if and only if

2010 Mathematics Subject Classication. Primary 20M15; Secondary 16B99, 15A03.
Key words and phrases. Semigroup, semigroup homomorphism, semigroup automorphism,
algebraic homomorphism, algebraic automorphism.
113
dimS = 1. Some basic properties of S
such as Arens regularity, nweak amenabil-

ity, minimal idempotents and ideal structure are investigated in [1] in the case where
S is a Banach Space. The number of roots of a polynomial equation with coecients
in S
is investigated in [2] in the case where S is a vector space. In this note our
purpose is to characterize the semigroup endomorphisms and automorphisms of S
.
In particular we characterize the algebraic endomorphisms and automorphisms of
S
. It is worthwhile mentioning that the study of the semigroup endomorphisms

and semigroup automorphisms of S
is very interesting. The following examples are

some dierent endomorphisms of S
that are worthy of consideration.

1. : S
, (a) = e, where e is a constant element of S
satisfying,
(e) = 1.
2. : S
, (a) = a
n
, for all n N(note that S
is not abelian and also

is not linear).
3. : S
, (a) = (a)e, where e is a constant element of S
, satisfying,
(e) = 1.
4. : S
, (a) = a + (a), where is a linear operator from S into

ker = {s S|(s) = 0}.
2 Main results
Theorem 2.1. Let S be a non-zero vector space and let 0 = S
be a non-zero
linear functional. If : S
is a semigroup endomorphism then one of the

following statements is hold.
1. = 0.
2. (a) = e, (a S
), where e is a constant element of S
satisfying, (e) = 1.
3. (0) = 0, = on ker and (
a
(a)
) =
(a)
(a)
on (ker)
C
. In particular
(a) = 1 implies (a) = 1.
114
Corollary 2.2. Let S be a non-zero vector space and let 0 = S
be a non-zero
linear functional. If
: S
is a semigroup automorphism then (0) = 0.

Theorem 2.3. Let S be a non-zero vector space, let 0 = S
be a non-zero linear
functional, and let : S
be a non-zero linear map. Then the following

statements are equivalent.
1. is a semigroup endomorphism.
2. = .
3. there exists a linear operator : S ker satisfying, (a) = a +(a), (a
S).
Theorem 2.4. Let S be a non-zero vector space and let 0 = S
be a non-zero
linear functional. Then the linear map : S
is a semigroup automorphism
if and only if (a) = a +(a)c, where c is a constant element of ker.
References
[1] A. R. Khoddami and H. R. Ebrahimi Vishki, The higher duals of a Banach
algebra induced by a bounded linear functional, Bull. Math. Anal. Appl., 3 (2011),
118122.
[2] A. R. Khoddami, Polynomial equations with coecients in an associative algebra,
Preprint.
115
The 6
th
Engel degree and Isoclinism classes of nite groups
Hassan Khosravi
1
and Mahdi Araskhan
2
1
Department of Mathematics, Faculty of Sciences, Gonbad-e Kavous University, Gonbad,
Iran
hassan khosravy@yahoo.com
2
Department of Mathematics, Faculty of Sciences, Azad University, Yazd, Iran
mehdiaraskhan@yahoo.com
Abstract
The aim of this article is to give the concept of Engel degree
of a nite group G, denote by E(G). We shall state some
results concerning the new concept which all mostly new
and similar to some result about d(G), the commutativity
degree of a nite group G. In particular, we prove that if G
and H are both isoclinic groups then E(G) = E(H).
1 Introduction
Let G be any group and n be a non-negative integer. For any two elements a and
b of G, we dene inductively [a,
n
b] the n-Engel commutator of the pair (a, b), as
follows:
[a,
0
b] := a, [a,
1
b] := [a, b] = a
1
b
1
ab and [a,
n
b] = [[a,
n1
b], b]
for all n > 0.
An element g of G is called left Engel whenever for each a G there exists an
integer n = n(a, g) such that [a,
n
g] = 1. We denote by L(G), the set of all Left
Engel elements of G. The corresponding subset to L(G) which can be similarly
dened is R(G) the set of all right Engel elements of G. An element g of G is called
Speaker
Key words and phrases. Engel degree, nite group, isoclinism classes.
116
right Engel whenever for each x G there exists an integer n = n(x, g) such that
[g,
n
x] = 1. For any group G the statements G = L(G) and G = R(G) are clearly
equivalent, and a group with this property is called Engel group. M. Zorn [4] has
shown that Engel condition in nite group equivalent with nilpotency condition.
Therefore if G is a locally nite group then L(G) equals the Hirsch-Plotkin radical
and R(G) is a subgroup of L(G). In particular, if G satises the maximal condition,
then R(G) coincide with the hypercenter, which equals Z
m
(G) for some nite m(see
[3] Baers Theorem p. 360). We dene
E(G) =
1
|G|
2
|{(x, y) GG| n N, [x,
n
y] = 1}|
Obviously, G is an Engel group if and only if E(G) = 1. By Zorns Theorem we
can introduce E(G) as Engel degree or equivalently nilpotency degree for a group
G. Moghadam et. al. [1] introduce n-nilpotency degree of a group G as follow
d
(n)
(G) =
1
|G|
n+1
|{(x
1
, ..., x
n+1
) G
n+1
| [x
1
, ..., x
n+1
] = 1}|.
It is clear that in this denition d
(n)
(G) is dependent on n, so E(G) is a more
perfect denition for probability of nilpotency of elements of a group G. T. Peng [2]
dene the class of E-groups as the class of those groups G in which E
G
(x) := {g
G| [g,
n
x] = 1 for some n N} is a subgroup for every x G; and, for any prime p,
the class E
p
of those groups in which E
G
(x) is a subgroup for every p-element x of
G. Also he has shown that G is an E-group i it is an E
p
-group for every prime p.
In this paper we are interested in nding some results as above for E(G). In fact
we prove that
Theorem 1.1. Let G be a non-Engel nite E-group. Then
1. E(G)
2
3
.
2. If E(G) =
2
3
then
G
L(G)
= Z
2
.
2 Main results
Lemma 2.1. Let G and H be nite groups. Then E(GH) = E(G) E(H).
Proof. Let E
G
(x) = {y G| n N, [y,
n
x] = 1}, for an arbitrary group G and x
117
in G. Then we have
E(GH) =
1
|GH|
2
|{((x, y), (x
, y
)) (GH)
2
|
n N, ([x,
n
x
], [y,
n
y
]) = 1}|
=
1
|G|
2
|H|
2
(x,y)GH
|E
(GH)
(x, y)|
=
1
|G|
2
|H|
2
(x,y)GH
|E
G
(x)||E
H
(y)|
=
1
|G|
2
xG
|E
G
(x)|
1
|H|
2
yH
|E
H
(y)|
= E(G)E(H)
Theorem 2.2. Let G be a nite E-group and N be a normal subgroup of G such
that N R(G). Then E(G) = E(
G
N
). In particular E(G) = E(
G
Z(G)
), that Z
(G)
is the hypercenter of group G.
In the end of this Section we prove that
Theorem 2.3. Let G and H be two isoclinic nite groups. Then E(G) = E(H).
References
[1] M. R. R. Moghaddam, K. Chiti, A. R. Salemkar, n-Isoclinism classes and n-
nilpotency degree of nite group, Algebra Colloquium 12(2)(2005) 255-261.
[2] T. A. Peng, Finite soluble groups with an Engel condition, J. Aljebra 14 (1969),
319-330.
[3] D. J. S. Robinson, A course in the theory of groups, Springer-Verlag,, New York,
1982.
[4] M. Zorn, Nilpotency of nite groups, Bull. Amer. Math. Soc. 42 (1936) 485-486.
118
The 6
th
Burnside condition on some intersection subgroups
Hanieh Mirebrahimi
1
and Fatemeh Ghanei
2
1
Department of Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran
h
mirebrahimi@um.ac.ir
2
Department of Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran
fatemeh.ghanei91@gmail.com
Abstract
In this paper, rst we present some preliminaries about
graphs, core graphs, and combinatorial algebraic topology.
Using these tools, and specially using immersions and cov-
ering maps, we establish our main theorem. Indeed, we can
prove the Burnside condition for the intersection of those
subgroups of free groups satisfying the Burnside condition.
1 Introduction
All our conceptions come from [1], [2] and [3]. A graph X consists of two sets E and
V (edges and vertices), with three functions
1
: E E and s, t : E V such
that (e
1
)
1
= e, e
1
= e, s(e
1
) = t(e) and t(e
1
) = s(e). We say that the edge
e E has initial vertex s(e) and terminal vertex t(e). The edge e
1
is the reverse
of e.
A map of graphs f : X Y is a function which maps edges to edges and vertices
to vertices. Also we have f(e
1
) = f(e)
1
, f(s(e)) = s(f(e)) and f(t(e)) = t(f(e)).
A path p in X of length n = |p|, with initial vertex u and terminal vertex v, is an
n-tuple of edges of X of the form p = e
1
...e
n
such that for i = 1, ..., n 1, we have
t(e
i
) = s(e
i+1
) and s(e
1
) = u and t(e
n
) = v. For n = 0, given any vertex v, there
Speaker
2010 Mathematics Subject Classication. Primary 05E15 05E18; Secondary 55Q05.
Key words and phrases. Graphs, fundamental group, immersion and covering theory, Burnside
condition.
119
is a unique path
v
of length 0 whose initial and terminal vertices coincide and are
equal to v. A path p is called a circuit if its initial and terminal vertices coincide.
If p and q are paths in X and the terminal vertex of p equals the initial vertex
of q, they may be concatenated to form a path pq with |pq| = |p| +|q|, whose initial
vertex is that of p and whose terminal vertex is that of q.
A round-trip is a path of the form ee
1
. A reduced path is a path in X containing
no round-trip. An elementary reduction is insertion or deletion a round-trip in a
path. Two paths p and q are homotopic (written p q) i there is a nite sequence
of elementary reductions taking one path to the other. Homotopic paths must have
the same start and terminal vertices and also, homotopy is an equivalence relation
on the set of paths in X. Moreover, any path in X is homotopic to a unique reduced
path in X.
Let v be a x vertex in X,
1
(X, v) is dened to be the set of all homotopy
classes of closed paths with initial and terminal vertex v. Then
1
(X, v) together
with the product [p][q] := [pq] forms a group with identity [
v
] and inverse element
[w]
1
= [w
1
].
For a x vertex v in X, the star of v in X is dened as follows:
St(v, X) = {e E : s(e) = v}.
A map f : X Y yields, for each vertex v X, a function f
v
: St(v, X)
St(f(v), Y ). If for each vertex v X, f
v
is injective, we call f an immersion. If
each f
v
is bijective, we call f a covering.
The theory of coverings of graphs is almost completely analogous to the topolog-
ical theory of coverings. Immersions have some of the properties of coverings. One
of them which is more important, and we also need it more, is the following one:
For a given nite set of elements {
1
, ...,
n
}
1
(X, u), there is a connected
graph Y and an immersion f : Y X such that f
(
1
(Y )) = S, in which S is the
subgroup of
1
(X, u) generated by {
1
, ...,
n
}.
If G is a group, a G-graph X is a graph with an action of G on the left on X by
maps of graphs, such that for all g G and every edge e, ge = e
1
. In this case, the
quotient graph X/G, and the quotient map of graphs X X/G can be dened. It
is easy to see that, in general X X/G is locally surjective.
It is said that G acts freely on X when, whenever v is a vertex of X, g G,
and gv = v, then g = 1, the identity element of G. In this case, X X/G is an
immersion, and hence is a covering.
A ttranslation of a map of graphs f : X Y is a map g : X X which is an
isomorphism of graphs and for which fg = f. The set of all translations of f forms
a group G(f) which acts on X. If f is an immersion, and X is connected, then G(f)
acts freely on X.
120
The universal cover f :

X X, of a connected graph X, is a covering with (

X
is connected and
1
(

X) trivial. In this case, G(f)

=
1
(X) which acts freely, by
covering translations, on

X, and f is isomorphic to the quotient map

X

X.
Theorem 1.1. [4] Let
be a pullback diagram of graphs, where f
1
and f
2
are immersions. Let v
1
and v
2
be
vertices in Z
1
and Z
2
that f
1
(v
1
) = f
2
(v
2
) = w. Let v
3
be corresponding vertex in
Z
3
. Dene f
3
= f
1
g
1
= f
2
g
2
: Z
3
X, and S
i
= f
i
(
1
(Z
i
, v
i
)), for i = 1, 2, 3. Then
S
3
= S
1
S
2
.
Theorem 1.2. [4] Let f : X Y be an immersion of graphs. Suppose that Y has
only one vertex and X has only nitely many vertices. Then there exists a graph
X containing X such that

X X consists only of edges, and there exists a map
f :

X Y extending f such that

f is a covering.
2 Main results
In this section, we deduce our main result. before it, we recall some notes from [4]
which are essential in the proof of the main theorem. First, we note to the core
graphs whose roles are more important.
A cyclically reduced circuit in a graph X is a circuit p = e
1
...e
n
, which is reduced
as a path and for which e
1
= e
1
n
. A graph X is said to be a core-graph if X is
connected, has at least one edge and every edge belongs to at least one cyclically
reduced circuit.
If X is a connected graph with non-trivial fundamental group, an essential edge
of X is an edge belonging to some cyclically reduced circuit. The core of X consists
of all essential edges of X and all initial vertices of essential edges.
If X is a connected graph with non-trivial fundamental group and

X is the core
of X, then

X is a core-graph. If v is a vertex of

X, then the inclusion
1
(

X, v)
1
(X, v) is an isomorphism.
Another notion, we are dealing with, is the Burnside condition for subgroups. If
S is a subgroup of a group G, we say that S G satises the Burnside condition
when, for every g G, there exists some positive integer n such that g
n
S.
121
Lemma 2.1. [4] (a) Let f : X Y be a nite-sheeted covering of connected
graphs, v a vertex of X. Then f
(
1
(X, v))
1
(Y, f(v)) satises the Burnside
condition.
(b) Let f : X Y be an immersion of connected graphs. Suppose that Y
is a core-graph; v a vertex of X, f
(
1
(X, v))
1
(Y, f(v)) satises the Burnside
condition. Then f is a covering.
Finally, using all the above notes, we establish the following theorem, which is
our main result in this paper.
Theorem 2.2. Let S
1
and S
2
be nitely generated subgroups of a free group F.
Suppose that S
1
S
2
satises the Burnside condition both in S
1
and S
2
. Then
S
1
S
2
satises the Burnside condition in the join S
1
S
2
, the subgroup generated
by A B.
References
[1] B. Everitt, The geometry and topology of groups, Notes from lectures given at
the Universidad Autonama, Madrid, and the University of York (2003).
[2] B. Everitt, Galois theory, graphs and free groups, arXiv:0606326, (2006).
[3] B. Everitt, Graphs, free groups and the Hanna Neuman conjecture, Journal of
Group Theory 11 (2008), no. 6, 885899.
[4] John R. Stallings, Topology of nite graphs, Invent. math. 71 (1983), 551565.
122
The 6
th
Some properties of centralizer and autocommutator
subgroup in auto-Engel groups
Mohammad Reza R. Moghaddam
1
and M. Badrkhani Asl
2
1
Department of Mathematics, Mashhad Branch, Islamic Azad University, and
Khayyam Higher Education Institute, Mashhad, Iran
rezam@ferdowsi.um.ac.ir
2
malimail2005@yahoo.com
Abstract
In 1994, Hegarty introduced the notion of autocentral au-
tomorphism, L(G) and autocommutator subgroup of G,
K(G), and proved that if G/L(G) is nite, then K(G)
is nite. Also if K(G) and Aut(G) are both nite, he
showed that so is G/L(G), but did not construct an up-
per bound for G/L(G). In the present article, we show
that if K(G) is nite and Aut(G) is nitely generated, then
|G/L(G)| |K(G)|
d
, where d is the minimal number of gen-
erators of the automorphisms group of G. In 2012, Endimion
and Moravec considering polycyclic groups and proved that
the niteness of L(G) implies that G/K(G) is also nite.
In this article we show that a similar result hold for the
second autocentral and autocommutator subgroups, where
introduced by the rst author et. al in 2011.
Speaker
Key words and phrases. Polycyclic groups, auto-Engel, autocentral and auocommutator sub-
groups.
123
1 Introduction
In 1904, I. Schur showed that the niteness of the central factor group of a given
group implies that the derived subgroup is also nite. B. H. Neumann in 1951 proved
that the converse of Schurs result holds, for nitely generated groups. In 2005, K.
Podoski and B. Szegedy proved that for a group G, if [
2
(G) :
2
(G) Z(G)] = n,
then [G : Z(G)] n
2 log
n
2
. One notes that the converse of Schurs theorem is not
true in general. For the counterexample, consider the innte extra special p-group,
for any odd prime number p. Niroomand in 2010 generalized Neumanns theorem
as follows: If
2
(G) is nite and G/Z(G) is nitely generated, then [G : Z(G)]
|
2
(G)|
d(G/Z(G))
, where d(X) is the minimal number of generators of a group X.
Also if the set of commutator elements S of a group G is nite and G/Z(G) is
nitely generated, then B. Sury in 2010 proved that
2
(G) is nite and also he gave
an upper bound for the central factor group [G : Z(G)] |S|
d(G/Z(G))
. D. Gumber
et.al , by assuming G/Z(G) = x
1
Z(G), . . . , x
n
Z(G) such that [x
i
, G] is nite, for
all 1 i n, then they showed that [G : Z(G)]

n
i=1
|[x
i
, G]| and |
2
(G)| < .
If is an automorphism of a group G and x G, then [x, ] = x
1
(x) is the
autocommutator of x and . So one may dene
L(G) =
x G|[x, ] = x
1
(x) = 1, for all Aut(G)
,
and
K(G) = [x, ]|x G, Aut(G),
which are called the autocenter and autocommutator subgroups of G, respectively.
Clearly both subgroups are characteristic so that L(G) is contained in the center of
G and K(G) contains the derived subgroup (see also [3]). In [2], P. Hegarty proved
that if G/L(G) is nite, then so is K(G). Also he showed that G/L(G) is nite,
whenever both K(G) and Aut(G) are nite. In this section, we construct an upper
bound for the autocentral factor group of G, assuming its autocommutator subgroup
is nite and the automorphism group is nitely generated. For any automorphism
of the group G, we may dene
C
G
() = {x G|[x, ] = 1},
[G, ] = [x, ]|x G,
which are the centralizer of in G and the commutator subgroup of , which is a
subgroup of [G, Aut(G)] = K(G). Clearly, they are both normal subgroups of G so
that C
G
() contains the autocenter of G. The n
th
-autocommutator subgroup and
n
th
-autocenter of G can be dened, respectively as follows:
K
n
(G) = [x,
1
, ...,
n
] = [[
1
, ...,
n1
],
n
]|x G,
i
Aut(G),
124
L
n
(G) = {x G|[x,
1
, ...,
n
] = 1, for all
i
Aut(G)}.
So we obtain the following series
G = K
0
(G) K(G) = K
1
(G) K
2
(G) K
n
(G) ,
1 = L
0
(G) L
1
(G) = L(G) L
n
(G) .
One observes that K
n
(G) and L
n
(G) are both characteristic subgroups in G such
that K
n
(G) contains
n+1
(G) and L
n
(G) is contained in Z
n
(G)(see [3] for more
information).
2 Main Results
As it was discussed in the introduction, Hegarty in [2] generalized Schurs theorem.
Theorem 2.1. (a) [2, Theorem 1.1] If [G : L(G)] is nite, then so are K(G) and
Aut(G).
(b) [2, Theorem 1.2] If K(G) and Aut(G) are both nite, then so is [G : L(G)].
In the following, for a given group G we construct an upper bound for the order
of G/L(G) when K(G) is nite and Aut(G) is nitely generated.
Theorem 2.2. Let G be an arbitrary group such that K(G) is nite and its au-
tomorphism group is nitely generated. Then |G/L(G)| |K(G)|
d
, where d is the
minimal number of generators of Aut(G).
Consider the cyclic group of order 2, Z
2
, then clearly L(Z
2
) is trivial and
K(Z
2
) = Z
2
. So in Theorem 2.2, the equality holds which shows that the up-
per bound is attained. Also one can easily check that the automorphism group of
the Dihedral group D
8
is isomorphic to D
8
, L(D
8
) = Z
2
and K(D
8
) = Z
4
which
gives |K(D
8
)|
d(D
8
)
= 16, while |D
8
/L(D
8
)| = 4.
For a given group G, the element x Gis called right n-auto-Engel if [x, , . . . ,
. .
ntimes
] =
1, for all Aut(G). The element x is said to be left n-auto-Engel, whenevere
[, . . . ,
. .
ntimes
, x] = 1. A group G is called n-auto-Engel if [x, , . . . , ] = 1, for all x G
and Aut(G) (see also [4] for more details). For the automorphisms
1
and
2
of a given group G, we introduce the centralizer of {
1
,
2
} as follows:
C
G
((
1
,
2
)) = {x G|[x,
1
,
2
] = 1}.
Considering 2-auto-Engel groups, one can easily check that C
G
((
1
,
2
)) and [G,
1
,
2
] =
[x,
1
,
2
]|x G are both normal subgroups of G.
The proof of the following lemma can be seen immediately by the denition.
125
Lemma 2.3. Let N be a characterisctic subgroup of a 2-auto-Engel group G with
the automorphisms
1
and
2
. Then
1. C
G
(
1
) C
G
((
1
,
2
));
2. |C
G/N
((
1
,
2
))| |C
G
((
1
,
2
))|, where G is considered to be nite.
Endiomio and Moravec [1], proved the following result.
Theorem 2.4. [1, Theorem 2] Let be an automorphism of a polycyclic group G.
If C
G
() is nite, then so is G/[G, ].
In our terminology, we conclude the following corollary of the above theorem.
Corollary 2.5. In a polycyclic group G, if L(G) is nite then so is G/K(G).
In the above theorem, we impose an extra assumption so that the group G
is 2-auto-Engel. Then we prove that the niteness of C
G
((
1
,
2
)) implies that
G/[G,
1
,
2
] is also nite. It is equivalent to saying that, if L
2
(G) is nite, so is
G/K
2
(G).
Theorem 2.6. Let G be a polycyclic 2-auto-Engel group with C
G
((
1
,
2
)) is nite,
for
1
,
2
Aut(G). Then G/[G,
1
,
2
] is also nite.
The above theorem has the following corollaries.
Corollary 2.7. If G is a polycyclic 2-auto-Engel group with nite L
2
(G), Then
G/K
2
(G) is also nite.
Corollary 2.8. If G is a polycyclic 2-auto-Engel group with nite L
2
(G), Then
G/Z(G) is also nite.
References
[1] G. Endimioni. and P. Moravec, On the centralizer and the commutator subgroup
of an automorphism, Monatshefte fr Mathematik, 167, (2012), 165-174.
[2] P. V. Hegarty, Autocommutator subgroups of nite groups, J. Algebra,
190(1997), 556-562.
[3] M. R. R. Moghaddam, F. Parvaneh and M. Naghshineh, The lower autocentral
series of abelian groups, Bull. Korean Math. Soc.48(2011), 79-83.
[4] M. R. R. Moghaddam, H. Safa and M. Farrokhi D. G., Some properties of 2-
auto-Engle groups, to appear in Quaestiones Mathematicae.
126
The 6
th
Counting centralizers in non-abelian n-dimensional Lie
algebras
M. R. R. Moghaddam
1
, M. Hoseini Ravesh
2
and S. Saarnia
2
1
Centre of Excellence in Analysis on Algebraic Structures, Ferdowsi University of
Mashhad and Khayyam Higher Education Institute, Mashhad, Iran
2
International Campus, Faculty of Mathematical Sciences, Ferdowsi University of
mhoseiniravesh@gmail.com, s saarnia67@yahoo.com
Abstract
In this paper we study the number of centralizers of non-
abelian n-dimensional Lie algebra. Given a Lie algebra L
and an element x L, the set C
L
(x) = {y L : [x, y] =
0} is called the centralizer of x in L. The set of all such
centralizers in L is denoted by Cent(L).
1 Introduction
Let x be a non-identity element of a given group G. Then the centralizer of x in G
is denoted by C
G
(x). Clearly a group is 1-centralizer if and only if it is abelian. In
1994 Belcastro and Sherman [3] proved the following results:
(i) There is no 2-centralizer and no 3-centralizer groups.
(ii) A nite group G is 4-centralizer if and only if
G
Z(G)
= C
2
C
2
.
(iii) A nite group G is 5-centralizer if and only if
G
Z(G)
= C
3
C
3
or S
3
.
Speaker
2010 Mathematics Subject Classication. Primary 20E06, 20E08; Secondary 20E70.
Key words and phrases. Lie algebra, centralizer, n-centralizer Lie algebras.
127
Let L be a nite dimension Lie algebra over the eld F. Then for any element
x L, the set C
L
(x) = {y L | [x, y] = 0} is called the centralizer of x in L. The
set of all centralizers in L is denoted by Cent(L) and |Cent(L)| denotes the number
of distinct centralizers in L. A Lie algebra L is called n-centralizer if |Cent(L)| = n
and L is called primitive n-centralizer if |Cent(L/Z(L))| = |Cent(L)| = n, where
Z(L) denotes the centre of L. A subalgebra K of L is called a proper centralizer of
L if K = C
L
(x), for some x L \ Z(L).
Similar to group theory one can easily see that L is abelian if and only if
|Cent(L)| = 1.
Lemma 1.1. Let L
1
and L
2
be two Lie algebras, then
Cent(L
1
L
2
) = Cent(L
1
) Cent(L
2
).
Lemma 1.2. Let L be a Lie algebra. Then Z(L) is the intersection of all centralizers
in L, i.e. Z(L) =
xL
C
L
(x), for all x L.
Lemma 1.3. If L is a Lie algebra, then L is the union of centralizers of all non-
central elements of L, i.e. L =
xLZ(L)
C
L
(x).
Lemma 1.4. A Lie algebra L cannot be written as a union of two proper Lie
subalgebras.
Theorem 1.5. Let L be a non-abelian Lie algebra, then |Cent(L)| 4.
2 Main Results
In this section, we study the centralizers of low-dimensional Lie algebra over the
eld of p elements Z
p
, for any prime number p.
Lemma 2.1. Suppose that L
i
is a nite dimension Lie algebra with |Cent(L
i
)| = n
i
,
for i = 1, 2, ..., r. Then |Cent(L
1
L
2
... L
r
)| =
r
i=1
n
i
.
Proof. Suppose L = L
1
L
2
... L
r
. Using Lemma 1.1, we have
C
L
(x
1
, x
2
, ..., x
r
) = C
L
1
(x
1
) C
L
2
(x
2
) ... C
Lr
(x
r
),
for all (x
1
, x
2
, ..., x
r
) L. It follows that C
L
(x
1
, x
2
, ..., x
r
) = C
L
(y
1
, y
2
, ..., y
r
) if and
only if C
L
i
(x
i
) = C
L
i
(y
i
), for all 1 i r. This implies that |Cent(L
1
L
2
... L
r
)| =
r
i=1
n
i
.
Lemma 2.2. Let L be a nite dimension Lie algebra and K a subalgebra of L.
Then |Cent(K)| |Cent(L)|.
128
Proof. Let C
K
(k
i
) be the distinct centralizers in K and i = 1, 2, ..., m. On the other
hand C
K
(k
i
) = KC
L
(k
i
), then C
L
(k
i
) = C
L
(k
j
), for all i = j and hence we obtain
the claim.
Lemma 2.3. Let L be an n-centralizer Lie algebra and L
Z(L) = 0. Then L is
a primitive n-centralizer Lie algebra.
Proof. Suppose that Cent(L) = {C
L
(x
1
), C
L
(x
2
), ..., C
L
(x
n
)} is the distinct cen-
tralizers in L. One can easily check that C(x + Z(L)) = C(x)/Z(L). Hence it is
enough to show that for any 1 i = j n, C
L
(x
i
+ Z(L)) = C
L
(x
j
+ Z(L)). So
assume there exist some 1 i = j n such that C
L
(x
i
+ Z(L)) = C
L
(x
j
+ Z(L)).
Suppose y C
L
(x
i
), then y + Z(L) C
L
(x
i
+ Z(L)) = C
L
(x
j
+ Z(L)) and by the
assumption we get [y, x
j
] = 0, i.e., C
L
(x
i
) C
L
(x
j
). Using similar argument, we
have C
L
(x
j
) C
L
(x
i
) which gives a contradiction. Thus |Cent(L/Z(L))| = n and
hence L is a primitive n-centralizer.
In the following we determine the number of centralizer of 2-dimension non-
abelian Lie algebras over the eld of p elements.
Theorem 2.4. Let L be a 2-dimensional non-abelian Lie algebra over the eld Z
p
.
Then
Cent(L)
= p + 2.
Denition 2.5. Let L be a non-abelian 3-dimensional Lie algebra over a eld F,
with L
to be 1-dimension so that L
is contained in Z(L). Such a Lie algebra is

known as the Heisenberg Lie algebra.
Theorem 2.6. Let L be the Heisenberg Lie algebra over the eld Z
p
, then |Cent(L)| =
p + 2.
Example 2.7. n(3, Z
p
) = e
12
, e
13
, e
23
, [e
12
, e
23
] = e
13
and L
= Z(L). Hence
Cent(n(3, Z
p
))
= p + 2.
As in Theorem 3.2[4], there exists a unique 3-dimensional Lie algebra over a eld
F such that L
is 1-dimensional and L
Z(L). Such a Lie algebra is the direct

sum of the 2-dimensional non-abelian Lie algebra with 1-dimensional Lie algebra.
Theorem 2.8. Let L be the 3-dimensional Lie algebra as above over the eld Z
p
.
Then |Cent(L)| = p + 2.
Lemma 2.9. Let L be a Lie algebra such that dimL = 3 and dimL
= 2. Then
(i) L
is abelian.
(ii) The map adx : L
is an isomorphism, for all x L L
.
129
Proof. See [4], Lemma 3.3.
Theorem 2.10. Let L be a Lie algebra over the eld Z
p
such that dimL = 3 and
dimL
= 2. Then
Cent(L)
= p
2
+ 2.
The following example justies the above theorem.
Example 2.11. Consider the 3-dimension Lie algebra as in Theorem 2.10 over
the eld Z
5
, then one may calculate all the centralizers of L and observes that
|Cent(L)| = 27.
On the other hand, by Theorem 2.10, the number of distinct centralizers must
be (5 1)
2
+ 2(5) + 1 = 27.
Theorem 2.12. Let L be a Lie algebra over the eld Z
p
such that dimL = 3 and
dimL
= 3. Then
Cent(L)
= (p 1)
2
+ 3p + 1.
The following example justies the above theorem.
Example 2.13. The sets of distinct centralizers of the 3-dimension Lie algebra in
Theorem 2.12 over the eld Z
3
are as follows:
C
L
(x) = {0, x, 2x}, C
L
(y) = {0, y, 2y}, C
L
(z) = {0, z, 2z}, C
L
(0) = L,
C
L
(x +y) = {0, x +y, 2x + 2y, },
C
L
(2x +y) = {0, 2x +y, x + 2y, },
C
L
(x +z) = {0, x +z, 2x + 2z, },
C
L
(2x +z) = {0, 2x +z, x + 2z, },
C
L
(y +z) = {0, y +z, 2y + 2z, },
C
L
(2y +z) = {0, 2y +z, y + 2z, },
C
L
(x +y +z) = {0, x +y +z, 2x + 2y + 2z, },
C
L
(2x +y +z) = {0, 2x +y +z, x + 2y + 2z, },
C
L
(x + 2y +z) = {0, x + 2y +z, 2x +y + 2z, },
C
L
(x +y + 2z) = {0, x +y +z, 2x + 2y + 2z, }.
So |Cent(L) = 14 and using Theorem 2.12, we get the same number, i.e. |Cent(L)| =
(3 1)
2
+ 3(3) + 1 = 14.
References
[1] A. Abdollahi, S. M. J. Amiri and A. M. Hassanabadi, Groups with specic number
of centralizers, Houston J. Math., 33(1) (2007), 43-57.
[2] A. R. Ashra, On nite groups with a given number of centralizers, Algebra
Colloq., 7(2) (2000), 139-146.
130
[3] S. M. Belcastro and G. J. Sherman, Counting centralizers in nite groups, Math.
Magazine, 67(5) (1994), 366-374.
[4] Karin Erdmann and Mark J. Wildon. Introduction to Lie algebras. Undergradu-
ate Mathematics Series. Springer-Verlag, London Ltd., 2006.
131
The 6
th
Some properties of 2-Engel transitive groups
1
and Amin Rostamyari
2
1
Centre of Excellence in Analysis on Algebraic Structures, Ferdowsi University of
Mashhad and Khayyam Higher Education Institute, Mashhad, Iran
2
International Campus, Faculty of Mathematical Sciences, Ferdowsi University of
rostamyari@gmail.com
Abstract
In 2013, Ciobanu, Fine and Rosenberger introduced and
studied the relationship among the notions of conjugately
separated abelian, commutative transitive and fully residu-
ally -groups. In this article we introduce the concept of
2-Engel transitive groups. Among other results we estab-
lish the relationship of 2-Engel transitive groups with con-
jugately separated 2-Engel and fully residually -groups.
1 Introduction
An element x of a group G is called a right Engel element, if for every y G,
there exists a natural number n = n(x, y) such that [x,
n
y] = 1. If n can be chosen
independent of y, then x is called a right n-Engel element or simply a bounded right
Engel element. We denote the sets of all right Engel elements and bounded right
Engel elements of G by R(G) and R(G), respectively.
An element x of G is called a left Engel element, if for every y G, there exists
a natural number n = n(x, y) such that [y,
n
x] = 1. If n can be chosen independent
of y, then x is called a left n-Engel element or simply a bounded left Engel element.
Speaker
2010 Mathematics Subject Classication. Primary 20E06, 20E08; Secondary 20E70.
Key words and phrases. 2-ET group, CSE
2
-group, residually -group, fully residually -group.
132
We denote the sets of all left Engel elements and bounded left Engel elements of
G by L(G) and L(G), respectively. For any positive integer n, a group G is called
n-Engel group if [x,
n
y] = [y,
n
x] = 1, for all x, y G.
Let be a class of groups. Then a group G is residually if for every nontrivial
element g G, there is a homomorphism : G H, where H is a -group such
that (g) = 1. Also a group G is fully residually if for nitely many nontrivial
elements g
1
, ..., g
n
in G there exists a homomorphism : G H where H is a
-group such that (g
i
) = 1, for all i = 1, ..., n.
Denition 1.1. A subgroup H of a group G is called malnormal or conjugately
separated if H H
x
= 1, for all x GH.
It is clear that the intersection of a family of malnormal subgroups of a given
group G is again malnormal, which allows us to dene the malnormal closure of a
subgroup H of G. Clearly the intersection of all malnormal subgroups of G contains
H is malnormal.
2 Main Results
A group G is called a conjugately separated 2-Engel (henceforth CSE
2
-group) if all
of its maximal 2-Engel subgroups are malnormal. In the following, we introduce the
notion of 2-Engel transitive group and then give its relationship with CSE
2
-group
and fully residually -groups.
Denition 2.1. (a) A group G is 2-Engel transitive (henceforth 2-ET), if [x, y, y] =
1 and [y, z, z] = 1 implies that [x, z, z] = 1, for all nontrivial elements x, y, z in G.
(b) For a given element x of G, we call E
2
G
(x) = {y G : [x, y, y] = 1, [y, x, x] = 1}
to be the set of 2-Engelizer of x in G. The set of all 2-Engelizers in G is denoted by
E
2
(G) and |E
2
(G)| denotes the number of distinct 2-Engelizers in G.
The following lemma is useful for our further investigations.
Lemma 2.2. For any nontrivial group G, the following statements are equivalent:
(i) G is 2-ET group;
(ii) 2-Engelizer of each nontrivial element of G is 2-Engel set.
We remark that the 2-Engelizer of each nontrivial element of a group G does not
form a subgroup, in general. However using Lemma 2.2, if G is a 2-ET group, then
each 2-Engelizer of nontrivial element of G is 2-Engel.
The following lemma is very usefull.
133
Lemma 2.3. Let G be a 2-ET group. Then for all y, z E
2
G
(x) and x G,
(i) [x, y, z] = [x, z, y]
1
;
(ii) [x, [y, z]] = [x, y, z]
2
.
Corollary 2.4. If G is a 2-ET group, then the set of each 2-Engelizer of a nontrivial
element x in G forms a subgroup.
The proof of the following lemma is a routine argument by using Zorns Lemma.
Lemma 2.5. Every 2-Engel subgroup H of a given group G is contained in a
maximal 2-Engel subgroup.
The following lemma gives a connection between CSE
2
-groups and 2-Engel tran-
sitive groups.
Lemma 2.6. Every CSE
2
-group is a 2-ET group.
The following fact is needed in proving our main result.
Proposition 2.7. Let G be a CSE
2
-group, then every 2-Engel normal subgroup of
G is maximal.
Using the above proposition, we obtain the following useful result.
Corollary 2.8. Let G be a CSE
2
-group, then every 2-Engel normal subgroup of G
is equal to the second centre of G.
Lemma 2.9. Let be a class of groups such that each non-2-Engel group H
is CSE
2
-group. Let N be a 2-Engel normal subgroup of a non-2-Engel residually
-group G, then N is contained in the second centre of G.
Remark 2.10. Let G be a 2-ET and non 2-Engel group, then it is clear that
Z
2
(G) = 1. So it follows from the above lemma that any normal 2-Engel subgroup
of G must be trivial.
Now we establish the relationship between the non 2-Engel CSE
2
, 2-ET and
fully residually -groups.
Theorem 2.11. Let be a class of groups such that each non 2-Engel -group is
CSE
2
and G be a non 2-Engel and residually -group. Then the following state-
ments are equivalent:
(i) G is fully residually ;
(ii) G is CSE
2
;
(iii) G is 2-ET.
134
In 1967, B. Baumslag [1] introduced the notion of fully residually free groups
and proved that a residually free group is fully residually free if and only if it is
commutative transitive. A group G is commutative transitive, if [x, y] = 1 and
[y, z] = 1 implies that [x, z] = 1, for nontrivial elements x, y, z in G.
One can easily check that if G is commutative transitive then G is 2-Engel
transitive. Here we show that Baumslags theorem is also true in the case of 2-Engel
transitive groups.
Corollary 2.12. Let G be a residually free group. Then G is fully residually free
if and only if G is 2-Engel transitive.
References
[1] B. Baumslag, Residually free groups, Proc. London Math. Soc. 17 No.3 (1967)
402-418.
[2] L. Ciobanu, B. Fine and G. Rosenberger, Classes of groups generalizing a the-
orem of Benjamin Baumslag, Preprint.
[3] D. J. S. Robinson, Finiteness Conditions and Generalized Soluble Groups, Parts
1 and 2, Springer-Verlag, 1972.
135
The 6
th
Embedding a special subgroup in n-autocentral
subgroups of a group
1
and Mohammad Javad Sadeghifard
2
1
Department of Mathematics, Mashhad Branch, Islamic Azad University and Khayyam
Higher Education Institute, Mashhad, Iran
2
Department of Mathematics, Mashhad Branch, Islamic Azad University , Mashhad, Iran
sadeghifard@iau-neushabur.ac.ir
Abstract
For a given group G and positive integer n, W.P. Kappe
in 2003 introduced and studied the subgroup B
n
(G), which
contains all 2-Engel elements when n = 1. Also the rst au-
thor et. al. in 2013 introduced the concept of 2-auto-Engel
elements of G. In this article, we introduce and study the
subgroup AB
n
(G), which contains all 2-auto-Engel elements
of G. Among other result, it will be shown that AB
n
(G) is
embedded in some subgroups of G.
1 Introduction and Preliminary results
We denote the automorphisms of a group G by A = Aut(G) and Inn(G) is the
inner automorphisms of G. In 2003, W.P. Kappe [1] dened the following subset of
elements of the group G
B
n
(G) = {x G | [x, g, a
1
, . . . , a
n
, g] = 1, g, a
1
, . . . , a
n
G}, n 1.
He then showed that the above set is a characteristic subgroup of G and B
1
(G)
contains the set of all right 2-Engel elements of G. The rst author et.al. [3]
Speaker
2010 Mathematics Subject Classication. Primary 20D45; Secondary 20F45, 20E07, 20F99.
Key words and phrases. 2-auto-Engel element, Engel element, autocentre.
136
introduced the set of all right n-auto-Engel elements of the group G which is denoted
by AR
n
(G) = {g G | [g,
n
] = 1, A}. Here [g, ] = g
1
g
= g
1
.(g),
[g,
1
, . . . ,
n
] = [[g,
1
, . . . ,
n1
],
n
] and [g,
n
] = [g, , . . . ,
. .
n
]. It is shown in [3]
that AR
2
(G) is a subgroup of G.
In the present article, using the automorphisms group of G we introduce the
subgroup of G which is some how a generalization of AR
2
(G), and will be denoted
by AB
n
(G).
Now, the following denition is vital in our further investigation.
Denition 1.1. Let G be any group. For a positive integer n, let
AB
n
(G) = {g G | [g, ,
1
, . . . ,
n
, ] = 1, ,
1
, . . . ,
n
A};
AC
n
(G) = {g G | [gh, ,
1
, . . . ,
n
, ] = [h, ,
1
, . . . ,
n
, ],
h G, ,
1
, . . . ,
n
A}.
As observed above, AC
n
(G) AB
n
(G). It will be shown that AC
n
(G) =
AB
n
(G), which implies that AB
n
(G) is a characteristic subgroup of G.
In the next section, we study the basic properties of AB
n
(G) and also show that
the set of AB
1
(G) contains AR
2
(G) and it is contained in B
1
(G). Finally, we give
some sucient conditions that when AB
n
(G) can be embedded in certain subgroups
of G.
In the following, we collect some of the basic facts, which are needed for the
proofs of our main results. The subgroup of right 2-auto-Engel elements of G,
AR
2
(G) = {g G | [g, , ] = 1, A} is a model and the fundamental tool for
the investigation of AB
n
(G).
The following result of [3] is very useful for our further studies.
Theorem 1.2. ([3] Lemma 3.2 and Theorem 3.3) Let G be a group, then for all
g, h AR
2
(G) and , , A
(a) AR
2
(G) is a characteristic subgroup of G;
(b) g
A
= g
: A is abelian and its elements are right 2-auto-Engel elements;

(c) [g, , ] = [g, , ]
1
;
(d) [g, [, ]] = [g, , ]
2
;
(e) [g, , , ]
2
= 1;
(f) [g, [, ], ] = 1.
137
If and are the automorphisms of a group G, we set g
= (g
, for all
g G. Using the above notation, and according to identities in [3] about the
autocommutators, we are able to prove the following lemmas which will be used
frequently in the next section.
Lemma 1.3. If [g,
1
, . . . ,
m1
,
m
, ] = 1, for a xed element g G,
1
, . . . ,
m1
,
A and all
m
A, then
[[g,
1
, . . . ,
m1
,
m
]
1
,
2
] = 1, for all
1
,
2
A.
Lemma 1.4. Let g be an element of AB
n
(G), then for all ,
1
, . . . ,
n
,
0
, . . . ,
n

A,
(a) [[g, ,
1
, . . . ,
n
]
1
,
2
] = 1;
(b) [[g, ,
1
, . . . ,
n
]
1
,
2
g
] = 1;
(c) [. . . [[g, ]
0
,
1
]
1
, . . . ,
n
]
n
, ] = 1.
2 Basic properties of AB
n
(G)
The main goal of this section is to prove that AB
n
(G) is a characteristic subgroup
of G and we obtain some more properties of this subgroup. We recall that
L(G) = {g G | [g, ] = 1 or g
= g, A},
is the autocentre of G. Clearly, it is a characteristic subgroup of G and one notes
that if we take A = Inn(G) then L(G) = Z(G) is the centre of G. Also we may
dene the nth autocentre of G, for n 1 as follows
L
n
(G) = {g G | [g,
1
, . . . ,
n
] = 1,
1
, . . . ,
n
A}.
(See [2] for more details).
Theorem 2.1. Let G be a group, then for all g AB
n
(G), ,
1
, . . . ,
n
, , , A
and n 1,
(a) AB
n
(G) = AC
n
(G) and hence AB
n
(G) is a characteristic subgroup of G;
(b) AR
2
(G) AB
1
(G) and AB
n
(G) AB
n+1
(G);
(c) [g, ,
1
, . . . ,
n
, , ] = 1; i.e., [g, ,
1
, . . . ,
n
] AR
2
(G).
(d) [g, , ,
1
, . . . ,
n
, ] = 1;
138
(e) [g, ,
1
, . . . ,
n
, , , ]
2
= 1;
(f) [g, ,
1
, . . . ,
n
, ] = [g, ,
1
, . . . ,
n
, ]
1
.
Proof. (a) By the previous discussion and using induction
[gh, ,
1
, . . . ,
n
] = [. . . [[g, ]
w
0
,
1
]
w
1
, . . . ,
n
]
wn
[h, ,
1
, . . . ,
n
],
for all h Gand suitable w
0
, w
1
, . . . , w
n
G. Since g AB
n
(G), [gh, ,
1
, . . . ,
n
, ] =
[h, ,
1
, . . . ,
n
, ], i.e., AB
n
(G) AC
n
(G) and the result follows, as we already
have AC
n
(G) AB
n
(G).
(b) Assume g AR
2
(G), then by using Theorem1.2 (c)
[[g, ], , ] = [[g, ], , ]
1
= [1, ]
1
= 1,
which gives AR
2
(G) AB
1
(G).
Clearly [g, ,
1
, . . . ,
n+1
] [g, ,
1
, . . . ,
n
]
A
. Hence Lemma1.4 (a) yields AB
n
(G)
AB
n+1
(G).
(c) By expansion of [g, ,
1
, . . . ,
n
], we get
[g, ,
1
, . . . ,
n
] = [[g, ][g, ]
,
1
, . . . ,
n
] = y
1
y
2
,
where y
1
= [. . . [g, ,
1
]
w
1
, . . . ,
n
]
wn
and y
2
= [[g, ]
,
1
, . . . ,
n
], for suitable
w
1
, . . . , w
n
G. Using Lemma1.4 (c), 1 = [y
1
, ]
y
2
[y
2
, ]. Therefore [y
2
, , ] = 1.
By substitution of
i
for
i
nally gives
1 = [[g, ]
1
, . . . ,
n
, , ] = [g, ,
1
, . . . ,
n
, , ]
,
which proves the claim.
(d) Substitute [g, ] for g in 1 = [y
1
, ]
y
2
[y
2
, ] and note that [y
1
, ] = 1 by
Lemma1.4 (c). Thus 1 = [y
2
, ] = [[g, , ]
,
1
, . . . ,
n
, ], for all
i
A, which
proves part (d).
(e) This part follows from part (c) and Theorem1.2 (e).
(f) Clearly, 1 = [g, ,
1
, . . . ,
n
, ]. As in the proof of part (c), we have
1 = [y
1
, ]
y
2
[y
2
, ]. Now, as [g, ]
g
A
we obtain y
1
= [g, ,
1
, . . . ,
n
], by
using Lemma1.4 (b). Hence [y
1
, ]
y
2
= [g, ,
1
, . . . ,
n
, ], by Lemma1.4 (a).
To simplify [y
2
, ], Lemma1.4 (a) and (b) imply that [y
2
, ] = [g, ,
1
, . . . ,
n
, ].
Altogether, we have 1 = [y
1
, ]
y
2
[y
2
, ] = [g, ,
1
, . . . ,
n
, ][g, ,
1
, . . . ,
n
, ],
which gives the result.
Finally, in the following theorem we identify the embedding of AB
n
(G) in some
subgroups of G. Note that, for this purpose we impose some restriction on the
elements of order 2 in some subgroups of G.
139
Theorem 2.2. Let G be a group
(a) If [AB
n
(G),
n+4
A] having no elements of order 2. Then AB
n
(G) L
n+4
(G).
(b) If n is odd and [AB
n
(G),
n+2
A] has no elements of order 2, then AB
n
(G)
L
n+2
(G).
References
[1] W.P. Kappe, Some subgroups dened by identities, Illinois J. Math. 47 (2003),
317-326.
[2] M.R.R. Moghaddam, M.A. Rostamyari, Autonipotent groups and their proper-
ties, to apppear in Southeast Asian Bulletin of Mathematics.
[3] M.R.R. Moghaddam, M. Farrokhi D.G and H. Safa, Some Properties of 2-auto
Engel groups, to appear in Quaestiones Mathematicae.
140
The 6
th
Triangle-free commuting conjugacy classes graphs
A. Mohammadian
1
, A. Erfanian
2
and M. Farrokhi Derakhshandeh
Ghouchan
3
1
abbasmohammadian1248@gmail.com
2
erfanian@math.um.ac.ir
3
m.farrokhi.d.g.@gmail.com
Abstract
We study all nite groups whose commuting conjugacy class
graph are triangle-free.
1 Introduction
The character degree graph
(G) of a group G is a graph whose vertices are non-

linear complex irreducible characters of G and two distinct characters are adjacent
whenever their degrees not coprime. Analogously, the conjugacy class graph
C
(G)
of G is dened as graph whose vertices are non-central conjugacy classes of G and
two distinct vertices are adjacent whenever their sizes are not coprime. Also, the
prime graph (G) on character degrees of G is dened as a graph whose vertices
is the set of all primes dividing some character degree of G such that two vertices
p, q (G) are adjacent whenever pq divides some character degree of G.
The above mentioned graphs are studied in depth by many authors. For the case
where such a graph is triangle-free, we may refer the reader to
Triangle-free character degree graph (Li, Liu and Song [3] and Wu and Zhang
[5]),
Speaker
2010 Mathematics Subject Classication. Primary 05C25; Secondary 20E45.
Key words and phrases. Triangle-free, conjugacy class, graph.
141
Triangle-free conjugacy class graph (Fang and Zhang [1]),
Triangle-free prime graphs on character degrees (Tong-Viet [4]),
For a group G, let (G), commuting conjugacy class graph of G, be a graph
associated with the non-central conjugacy classes of G in such a way that the vertices
of (G) are the non-central conjugacy classes of G, and two distinct vertices C and
D are adjacent whenever there exist elements x C and y D such that xy = yx.
In 2009, Herzog, Longobardi and Maj [2] introduced and studied the graph (G)
and proved that if G is a periodic non-abelian group, then (G) has no edges if and
only if G is isomorphic to one of the groups S
3
, D
8
or Q
8
.
In this talk, we discuss on the structure of those nite groups such that (G) is
a triangle-free graph.
2 Main results
Throughout this section G stands for a non-abelian nite group G with triangle-free
commuting conjugacy class graph.
Theorem 2.1. If G is a group of odd order, then |G| = 21 or 27 .
Lemma 2.2. If G is group of even order which is not a 2-group, then either Z = 1
or Z

= Z
2
.
Theorem 2.3. Suppose G is a group of even order which is not a 2-group. Then
Z = 1 if and only if G is isomorphic to D
12
or T
12
, where T
12
= a, b
a
4
= b
3
=
1, b
a
= a
1
.
Theorem 2.4. G is a centerless non-soluble group if and only if G is isomorphic
to one of the groups PSL(2, 4), PSL(2, 7), PSL(2, 9), PSL(3, 4), or a group G of
order 960.
Theorem 2.5. G is a non-abelian soluble group with Z = 1 if and only if G is
isomorphic to one of the groups S
3
, D
10
, A
4
, S
4
, G
1
, G
2
or G
3
, where G
1
is a group
of order 72 and G
2
and G
3
are groups of order 192.
Theorem 2.6. If G is a 2-group, then cl(G) = 2 and both Z(G) and G/Z(G) are
elementary abelian 2-groups.
142
References
[1] M. Fang and P. Zhang, Finite groups with graphs containing no triangles, J.
Algebra 264 (2003), 613619.
[2] M. Herzog, P. Longobardi and M. Maj, On a Commuting Graph on conjugacy
classes of groups, Comm. Algebra 37(10) (2009), 33693387.
[3] T. Li, Y. Liu and X. Song, Finite nonsolvable groups whose character graphs
have no triangles, J. Algebra 323(8) (2010), 22902300
[4] H. P. Tong-Viet, Groups whose prime graphs have no triangles,
arXiv:1303.3457v1.
[5] Y.T.Wu and P. Zhang, Finite solvable groups whose character graphs are trees,
J. Algebra 308(2) (2007), 536544.
143
The 6
th
Isologism crossed modules
Hamid Mohammadzadeh
Department of Mathematics, Iran University of Science and Technology, Tehran, Iran
h mohammadzadeh@iust.ac.ir
Abstract
Let A
q
be the variety of abelian crossed modules of exponent
q, where q is a square free positive integer. In this article,
we dene the notions of A
q
-covering crossed module and
A
q
-isologism and, same as the work of Jones and Wiegold
[6], we show that all q-covering crossed modules of a given
crossed module is mutually A
q
-isologic. Also, we present
the notion of an A
q
-stem crossed module and we prove its
existence within an arbitrary A
q
-isologism class.
1 Introduction and preliminaries results
A crossed module (M, G, ) is a group homomorphism : M G together with an
action of G on M, (g, m)
g
m, satisfying:
(i) The homomorphism is a precrossed module, i.e., (
g
m) =
g
(m), for all g G,
m M.
(ii) The Peier subgroup is trivial, i.e.,
(m)
m
=
m
m
, for all m, m
M.
We can consider any group as a crossed modules in two ways (G, G, id), (i, G, id).
A morphism of crossed modules = (
1
,
2
) : (M, G, ) (M
, G
) is a
pair of group homomorphisms
1
: M M
and
2
: G G
such that
1
=
2
and
1
(
g
m) =

2
(g)
1
(m), for all g G, m M. We denote the resulting
category of crossed modules by CM. In this category the notions of (normal) crossed
submodule, commutator, center, product, etc. are dened in obvious ways. For more
details see [3, 13].
2010 Mathematics Subject Classication. 20E10, 20E34, 20N99.
Key words and phrases. Isologism, covering crossed module, stem crossed module, variety of
groups.
144
A crossed module (M, G, ) is said to be nite if the groups M and G are nite.
In this case, we dene |(M, G, )| to be the ordered pair (|M|, |G|). Clearly, a totally
order is dened on the class of all nite crossed modules by means of |(M, G, )| <
|(M
, G
)| if and only if |M| < |M
|, or |M| = |M
| and |G| < |G
|.
Let (M, G, ) be a crossed module. For a nonnegative integer q, we dene the
following G-invariant subgroups of M:
G
q
M =
g
mm
1
, m
q
| m M, g G,
M
G
q
= {m M | m
q
= 1 and
g
m = m, for all g G}.
Clearly, if N is a normal subgroup of G, then the inclusion map i : N G with the
action of G on N by conjugation is a simple example of a crossed module. In this
situation, G
q
N = [G, N]N
q
and N
G
q
, which is denoted it by Z
q
G
(N), is a central
subgroup of G whose elements have order dividing q.
Let (M, G, ) be a crossed module and (N, K, ) be a normal crossed submodule
of it. In [4] for nonnegative integer q, q-commutator crossed submodule, (M, G, )
q
(N, K, ),
and q-center crossed submodule,
Z
q
(M, G, ), are dened by ([K, M]G
q
N, G
q
K, ) and (M
G
q
, Z
q
(G) st
G
(M), ),
respectively, where
Z
q
(G) = {g Z(G) | g
q
= 1},
St
G
(M) = {g G |
g
m = m for all m M}.
In the following proposition we show that the category A
q
-CM has enough projec-
tives.
Proposition 1.1. (i) The category of q-abelian crossed modules, A
q
-CM, has
enough projectives.
(ii) Let (Y, F, i) be a projective crossed module. Then any crossed submodule of
(Y, F, i)
q.ab
is A
q
-projective.
Theorem 1.2. (Leedham-Green and Mackay [7]) Let be a variety of groups dened
by the set of laws V , then satises the following conditions:
(i) subgroups of -free groups are -splitting;
(ii) subgroups of the -marginal subgroup of a given group are normal, if and only
if the variety is the variety of all groups, the variety of abelian groups, or A
q
, the
variety of abelian groups of exponent q, where q is a square free positive integer.
In sequel we assume that q is nonnegative square free integer unless stated oth-
erwise. The following corollary plays an important role in our future investigations.
Corollary 1.3. Let (M, G, ) be a q-abelian crossed module with a crossed sub-
module (S, H, ). If (M, G, )/(S, H, ) is a A
q
-projective crossed module, then
(M, G, ) = (S, H, ) (U, N, ), for some crossed submodule (U, N, ) of (M, G, ).
145
2 H
q
2
(M, G, ) and A
q
-Covering Crossed Modules
In this section after the denition of A
q
-covering crossed module, we examine the
connection between A
q
-isologism and A
q
-covering crossed module in one situa-
tion that the given crossed modules is nite. Let 1 (V, R, ) (Y, F, )
(M, G, ) 1 be a projective presentation of crossed module (M, G, ). In [4]
Grandjean, et al. introduced the second homology crossed module modulo q of
(M, G, ) by
H
q
2
(M, G, ) = (
V F
q
R
(R
q
R)(F
q
V )
,
R F
q
F
F
q
R
,
).
In following, we convection that If 1 (V, R, ) (Y, F, ) (M, G, ) 1
is a projective presentation of the crossed module (M, G, ), then for every normal
crossed module (U, S, ) of (Y, F, ) satisfying the condition (Y, F, )
q
(V, R, )
(U, S, ), we will denote the crossed module (U, S, )/(Y, F, )
q
(V, R, ) by (
U,

S, ).
In the next proposition we will show that the second homology modulo q of nite
crossed module is nite. But rstly we need to prove the following lemma.
Lemma 2.1. The following conditions in the category CM are equivalent:
(i) If (M, G, )/Z
q
(M, G, ) is nite, then so is (M, G, )
q
(M, G, ),
(ii) If (M, G, ) is nite, then so is H
q
2
(M, G, ).
Proposition 2.2. (i) For any crossed module (M, G, ), if
(M, G, )/Z
q
(M, G, )
is nite, then so is (M, G, )
q
(M, G, ).
(ii) If (M, G, ) is nite then so is H
q
2
(M, G, ).
Vieites and Casas in [14] generalized the notions of covering groups to the cov-
ering crossed modules, then Mohammadzadeh, et al. in [9] for any given crossed
module prove the existence covering crossed module and determined the structure
of it. Here we introduce the notion of q-covering crossed module as follows:
Let e : 1 (A, B,
) (M
, G
) (M, G, ) 1 be a q-central extension

of crossed module, i.e., (A, B,
) Z
q
(M
, G
), then e is called a stem cover if

(A, B,
) (M
, G
)
q
(M
, G
) and (A, B,
)

= H
q
2
(M, G, ). In this case
(M
, G
) named A
q
-covering crossed module.
Proposition 2.3. Every nite crossed module admits at least one A
q
-covering
crossed module.
Theorem 2.4. Let (M
, G
) be a covering crossed module of (M, G, ) whose

second homology modulo q is nite. If
146
1 (V, R, ) (Y, F, )

(M, G, ) 1
be a projective presentation of crossed module (M, G, ). Then there exists an
epimorphism = (
1
,
2
) from (
Y ,

F, ) onto (M
, G
) such that Ker is a

complement for H
q
2
(M, G, ) in (
V ,

R, ).
References
[1] H. Behravesh, Quasi-Permutation representations of p-groups of class 2, J. Lon-
don Math. Soc. 55 (1997), 251260.
[2] D. Arias, M. Ladra, The precise center of a crossed module, J. Group Theory 12
(2009), 247-269.
[3] A.R. Grandjean, M. Ladra, On totally free crossed modules, Glasgow Math. J.
40(1998), 323-332.
[4] A. R. Grandjean, M. P. Lopez, H
2
(T, G, ) and q-perfect crossed modules, Jour-
nal of Applied Categorical Structures. 11 (2003), 171-184.
[5] P. Hall, The classication of prime-power groups, Reine Angew. Math. 182
(1940), 130-141.
[6] M.R. Jones, J. Wiegold, Isoclinism and covering groups, Bull. Aust. Math. Soc.
11(1974), 71-76.
[7] C.R. Leedham-Green, S. Mckay, Baer-invariants, isologism, varietal laws ard
homology, Acta Math. 137 (1976), 99-150.
[8] H. Mohammadzadeh, A.R. Salemkar, S. Shahrokhi, Isoclinism of crossed mod-
ules, submitted.
[9] H. Mohammadzadeh, S. Shahrokhi, A.R. Salemkar, On the Schur multiplier of
crossed modules, submitted.
[10] M.R.R. Moghaddam, A.R. Salemkar, Characterization of varietal covering and
stem groups, Comm. Algebra 27(1999), 5575-5586.
[11] M.R.R. Moghaddam, A.R. Salemkar, Varietal isologism and covering groups,
Arch. Math. 75(2000), 8-15.
[12] B.H. Neumann, Groups with nite classes of conjugate subgroups, Math. Z. 63
(1955), 76-79.
147
[13] K.J. Norrie, Crossed modules and analogues of group theorems, Thesis, Kings
College, Univ. of London, London, 1987.
[14] A.M. Vieites, J.M. Casas, Some results on central extensions of crossed modules,
Homology, Homotopy Appl. 4(2002), 29-42.
148
The 6
th
The structure of non-solvable CTI-groups
Hamid Mousavi
1
, Tahereh Rastgoo
2
and Viktor Zenkov
3
1
Department of Mathematics, Faculty of Sciences, Tabriz University, Tabriz, Iran
hmousavi@tabrizu.ac.ir
2
PhD graduate in Mathematics of Institute for Advanced Studies in Basic Sciences,
Zanjan, Iran
t.rastgoo.1982@gmail.com
3
Institute of Mathematics and Mechanics of Ural Branch RAS,S. Kovalevskaya 16,
Ekaterinburg 620990, Russia
v1i9z52@mail.ru
Abstract
A nite group G is called a CTI-group if for any cyclic sub-
group H of G, H H
g
= 1 or H for all g G. This paper,
describes the structure of nite non-solvable CTI-groups.
1 Introduction
Throughout the following, G always denotes a nite group.
Let H be a subgroup of G. If for any g G we have H H
g
{1, H} then H
is called a TI-subgroup. Now if every subgroup of G is a TI-subgroup, then G is
called a TI-group. In [3], G. Walls classied the TI-groups :
Theorem 1.1. A nite group, G, is a TI-group if and only if one of the following
occurs:
(i) G is Hamiltonian,
(ii) G = H Z
p
n, where H is a group of order p
3
.
Speaker
2010 Mathematics Subject Classication. 20D10; 20E34.
Key words and phrases. Solvable Group, TI-subgroup, CTI-group.
149
(iii) G = x, y|x
p
n
= y
p
= 1, y
1
xy = x
1+p
n1
for some n.
(iv) G = D
8
Q
8
, where D
8
is the dihedral group of order 8 and Q
8
is the quaternion
group of order 8.
(v) G = Z
p
Z
m
, m|p 1, Z
m
acts regularly on Z
p
.
(vi) G = (Z
p
Z
p
) Z
m
, m|p + 1, Z
m
acts regularly on the subgroups of order p.
In [1], S. Li and X. Guo with P. Flavel determined the structure of groups whose
all Abelian subgroups are TI-subgroups. These groups are called ATI-groups.
Theorem 1.2. Let G be a nite ATI-group. Then one of the following holds:
(i) G is nilpotent.
(ii) G is a soluble Frobenius group. Let K be the Frobenius kernel and H a
complement. Then one of the following holds:
(a) Every H-chief factor of K is cyclic and for every p (K), H is cyclic of
order dividing p 1.
(b) K

= Z
p
Z
p
for some prime p, H acts irreducibly on K and either H is
cyclic or the direct product of a cyclic group of odd order and Q
8
(iii) G

= S
4
.
(iv) G is isomorphic to one of the simple groups PSL
2
(4), PSL
2
(7) or PSL
2
(9).
A group G is called a CTI-group if all of its cyclic subgroups are TI-subgroups.
Clearly, any ATI-group is a CTI-group; however, the converse is not true. This
paper, classies the non-solvable CTI-groups.
Throughout this paper, F(G) is the Fitting subgroup of G, Z(G) is the center
of G; also Q
8
and S
4
are the quaternion group of order 8, and the symmetric group
of degree 4. All unexplained notation and terminology are standard.
2 Preliminaries
This section, states some results which will be useful in the proof of main results.
Theorem 2.1. Let G be a non-nilpotent CTI-group with non-trivial center. Then
Z(G) is an elementary abelian p-subgroup where p is smallest factor of |G|. More
specially, any p
-subgroup of G is a normal.
150
Theorem 2.2. Let G be a non-nilpotent CTI-group such that Z(G) = 1. Also
suppose that p divides |Z(G)| and let H be a Hall p
-subgroup of G. Then H is
abelian and normal, and moreover G = HP is solvable, where P Sy
p
(G). Also,
(i) if Z(G) G
= 1 then G

= K (H Z
p
i ), where p is the smallest divisor of
|G|, K = Z(G), P = Z(G) Z
p
i and H = G
;
(ii) if Z(G) G
= 1 then p = 2 and P = K Z
2
, where K is an abelian normal
subgroup of G; also Z(G) =
1
(K), G
= H
1
(K) and Z
2
inverts any element
of HK;
(iii) the Fitting subgroup F(G) = HK is abelian.
Theorem 2.3. Let G be a nite CTI-group with trivial center and V , its minimal
normal subgroup, be solvable. Then F(G) = C
G
(V ).
Theorem 2.4. Let G be a nite solvable CTI-group with trivial center. Then:
(i) If |F(G)| has more than one prime divisor, then G = F(G)H is a Frobenius
group with abelian kernel F(G) and complement H;
(ii) If F(G) is a p-group, then either G is isomorphic to S
4
, or F(G) is a Sylow
p-subgroup of G and G is a Frobenius group with kernel F(G).
3 Mailn Result
This section, classies non-solvable CTI-groups.
Theorem 3.1. A CTI-group G is solvable if and only if it has a solvable minimal
normal subgroup.
Let V be a minimal normal subgroup of a non-solvable CTI-group G. By The-
orem 3.1, V cannot be solvable, since the centralizer of any element (in particular
any subgroup) of G is solvable, and so C
G
(V ) = 1. Therefore, V must be simple.
Also we have V G Aut(V ) and G/V Out(V ).
Theorem 3.2. Let G be a nite non-solvable CTI-group. Then G

= PSL(2, q) or
PGL(2, q), where q > 3 is a prime power.
The inverses of Corollary 2.2 and Theorem 2.4 are simple: we just prove the
inverse of the non-solvable case. Before proving the inverse theorem, we consider
the simple fact that, if a non-normal subgroup x of G is normal in a non-normal
maximal subgroup M, then x x
g
G, where g G\M.
151
Theorem 3.3. Let G be isomorphic to K, where PSL(2, q) K PGL(2, q), q > 3
is a power of prime p. Then G is a CTI-group.
Proof. We can simply check by GAP that PSL(2, p) is CTI for p = 5, 7, 9, 11. Let x
be an element of G. If p | |x| then x must be a p-element, since by [4, Theorem 2.8.2
and Lemma 15.1.1] Sylow p-subgroups of G are elementary abelian and TI; therefore
|x| = p. If |x| | (q
2
1) and x is not a 2-element, then |x| | 2
n
m, where m is odd;
hence x = yz, where |z| > 1 is odd. In this case z belongs to the maximal subgroup
D
2(q1)
or D
2(q+1)
by [2, Theorem 2.1 and Theorem 2.2]; since z is normal in these
groups, then N
G
(x) = N
G
(z) is a non-normal maximal subgroup of G. Therefore,
x is normal in a non-normal maximal subgroup of G, and so is TI. Now, let x be a
2-element and |x| > 2; then p is an odd prime and again x belongs to the dihedral
group. Since x is normal in this group, then N
G
(x) is maximal in G. Hence x is
a TI-group. Therefore, G is a CTI-group.
References
[1] X. Guo, S. Li and P. Flavell, Finite groups whose abelian subgroups are TI-
subgroup, J. Algebra. 307 (2007), 565569.
[2] A. Lucchini and A. Maroti, On nite simple groups and Kneser graphs, J. Alge-
braic Combin. 30 (2009), No. 4, 549-566.
[3] G. Walls, Trivial intersection groups, Arch. Math. 32 (1979), 14.
[4] D. Gorenstein,Finite groups, Chelsea, New York (1980).
152
The 6
th
P-semisimple BCI-algebras and adjoint groups
Ardavan Naja
1
and Hamid Rasouli
2
1
Department of Mathematics, Behbahan Branch, Islamic Azad University, Behbahan, Iran
naja2005@yahoo.com
2
Department of Mathematics, Science and Research Branch, Islamic Azad University,
Tehran, Iran
hrasouli@srbiau.ac.ir
Abstract
In this paper, we study the p-semisimple BCI-algebras and
their connection to Abelian groups. A ccording to the
structure of commutators in group theory, we introduce the
concept of pseudo-commutators and commutators in BCI-
algebras, and obtain some related results.
1 Introduction
In 1966, Imai and Iseki dened a class of algebras of type (2,0) called BCK-algebra
which generalizes on one hand the notion of algebra of sets with the set subtraction
as the only fundamental non-nullary operation, and on the other hand the notion
of implication algebra. We can dene an implication in each BCK-algebra by y
x = x y. In the same year, Iseki introduced the concept of a BCI-algebra in as
follows. p-semisimple algebras are another special classes of BCI-algebras which
were touched by Lei in 1982. They play a basic role in the research of BCI-algebras
and have close contacts with Abelian groups.([1,2,3])
Denition 1.1. Let (G, , 0) be an algebra of type (2, 0). Then G is said to be a
BCI-algebra if it satises the following properties:
Speaker
2010 Mathematics Subject Classication. Primary 03G25; Secondary 08A05, 06F35.
Key words and phrases. Adjoint group, P-Semisimple, BCI-Algebra, Commutator.
153
(1)((x y) (x z)) (z y) = 0,
(2)(x (x y)) y = 0,
(3)x x = 0,
(4) x y = y x = 0 implies x = y,
for all x, y, z G.
On any BCI-algebra (G, , 0) we can dene the natural order putting
(5) x y if and only if xy = 0. It is not dicult to verify that this order is partial.
A BCI-algebra G has the following properties:
(6) (x y) x, (7) x y implies that x z y z and z y z x
(8) x 0 = x, (9) x 0 = 0 implies that x = 0.
If a BCI-algebra G satises 0 x = 0 for all x G, then we say that G is a BCK-
algebra. For elements x and y of a BCK-algebra G, we denote x y = y (y x).
A BCI-algebra G is called commutative if for any x, y G, x y = 0 implies
x = x y = y (y x). A non-empty subset S of a BCI-algebra G is called a
BCI-subalgebra of G if x y S whenever x, y S. A non-empty subset I of a
BCI-algebra G is called a BCI-ideal of G if it satises (i) 0 I, (ii) x y I and
y I imply that x I, for all x, y G. The set B = {x : 0x = 0} in a BCI-algebra
G is called the BCK-part of G. Obviously B is a subalgebra of G, and it is also
an ideal of G. If I is an ideal of G, and for every x in I, 0 x, then I is called
a p-ideal of G. Clearly, BCK-part B of G contains all p-ideals of G so that it is
a maximal p-ideal of G. If B = {0}, then G is called a p-semisimple BCI-algebra.
In the case, B is called a p-radical of G. Let G be a BCI-algebra. We choose an
element x
0
G such that there does not exist any y = x
0
satisfying y x
0
= 0 and
dene A(x
0
) = {x G : x
0
x = 0}. The element x
0
is known as the initial element
of A(x
0
) as well as G. Let I
x
denote the set of all initial elements of G. We call it
the center of G. A(0) = {x G : 0 x = 0} = B =the BCK-part of G. The center
I
x
of a BCI-algebra G is p-semisimple.
Example 1.2. Let G = {0, 1, 2}. Dene a binary operation on G by the
following table:
Table 3:
0 1 2
0 0 0 2
1 1 0 2
2 2 2 0
It is not dicult to verify that (G, , 0) is a BCI-algebra, but G is not a p-semisimple
algebra, because the BCK-part of G is {0, 1}. The elements 0, 2 are initial elements
154
of G and A(0) = {0, 2}, A(2) = {2}. Therefore, I
x
= {0, 2}. Also the set (Z, , 0) is
a BCI-algebra. Since 0x = 0 gives that x = 0, the BCK-part of G equals B = {0}.
Hence, it is a p-semisimple algebra.
2 Main results
In this section we will present some results on a p-semisimple algebra. We use
Abelian group theory to study p-semisimple algebras. Also we will deal with the
relations between p-semisimple algebras and Abelian groups.
Lemma 2.1. Let G be a BCI-algebra and x, y G. Then the following are equiva-
lent:
a) G is p-semisimple. b) 0 x = 0 = x = 0.
c) 0 (0 x) = x. d) x (0 y) = y (0 x).
Lemma 2.2. Let G be a semisimple algebra. If we dene xy = x(0y) = y(0x),
then (G, , 0) is an Abelian group.
Proof. Obviously, G is closed under the operation , and x (y z) = x (0 (y
(0 z))) = (y (0 z)) (0 x) = (y (0 x)) (0 z) = (x (0 y)) (0 z) =
(x y) z But, x y = x (0 y) = y (0 x) = y x. Hence, the operation
is associative and commutative. Moreover, x 0 = 0 x = 0 (0 x) = x and
x (0 x) = (0 x) x = (0 x) (0 x) = 0. Therefore, 0 x is the inverse of x.
Thus G is an Abelian group with respect to .
Conversely, we can show that any Abelian group is a p-semisimple algebra. Sup-
pose (G, , e) is an Abelian group with e as the unit element. Dene a binary oper-
ation on G by putting x y = xy
1
. Then (G, , e) is a BCI-algebra. We call
(G, , e) the adjoint BCI-algebra of the Abelian group (G, , e).The Abelian group
induced by a p-semisimple algebra in above lemma is said adjoint group. In a p-
semisimple BCI-algebra G, the following hold:
(e) (x z) (y z) = x y; (f) a x = b x implies that a = b;
(g) x (0 y) = y (0 x); (h) x y = 0 implies that x = y;
(i) x a = x b implies that a = b; (j) a (a x) = x.
Denition 2.3. Let (G, , 0) be a BCI-algebra and let x, y be elements of G. Then
the pseudo-commutator [x, y] of x and y is dened as follows:
[x, y] =
_
0 x = y
(x (0 y)) (0 ((0 x) (0 (0 y)))) Otherwise.
If x y = [x, y] (y x), then [x, y] is called the commutator of x , y.
155
Lemma 2.4. Let (G, ., 0) be a BCI-algebra. Then for any x, y G,
i) if x y, then [x, y] = 0. ii) [0, x] = [x, x] = 0.
Denition 2.5. The subset [G, G] = {[a, b]|a, b G} of G is called the derived
subalgebra of G and we will denote by G
. In fact, G
is the set all commutators of

elements of G.
Theorem 2.6. Let (G, , 0) be a BCI-algebra. Then G is p-semisimple if and only
if G
= {0}.
Theorem 2.7. Let (G, , 0) be a BCI-algebra. Then
1) G
is a subalgebra of G. 2) G
is an ideal of G. 3) G is commutative if and

only if G
is the BCK-part of G.
Example 2.8. Let G = {0, 1, a, b, c} and let the operation be given by the
following table:
Table 4:
0 1 a b c
0 0 0 c b a
1 1 0 c b a
a a a 0 c b
b b b a 0 c
c c c b a 0
It is not dicult to verify that (G, , 0) is a BCI-algebra. In this algebra for all
x, y G we have x y = [x, y] (y x). Now we see that G
= {0, 1} is a subalgebra
and also an ideal of G. The initial segments of G are of the form [0, 1] = {0, 1}.
Hence, G
is an initial segment of G. Also I

x
= {0, a, b, c}, which follows that
I
x
= G
.
Theorem 2.9. If (G, ., 0) is a BCI-algebra and H is a subalgebra of G, then H
.
References
[1] S. A. Bhatti, M. A. Chaudhry, Characterization of BCI-algebras of order 5,
(1992), no.25 , 99121.
[2] Y. Imai and K. Iseki, On axiom system of propositional calculi XIV, Proc,Japan
Acad. 42 (1996), 1922.
[3] K. Iseki, On BCI-algebras, Math. sem. Notes, 8, (1980), 125-130.
156
The 6
th
The nite -solvable groups with three conjugacy class
sizes of primary and biprimary -elements
Majid Naja
1
and Neda Ahanjideh
2
Department of Mathematics, Faculty of Sciences, Shahrekord University, Shahrekord, Iran
1
majid
naja1357@yahoo.com
2
Abstract
Let G be a nite -solvable group, where is a set of primes
with || 2. If the conjugacy class sizes of all -elements of
primary and biprimary orders of G are {1, m, n} such that
m is a -number and n is a
-number, then we show that

there exists p such that m = p
and G = K PW,
where P Syl
p
(G), K Z(G) is a Hall ( {p})-subgroup
and W is a Hall
-subgroup of G.
1 Introduction
Let G be a nite group. For x G, the conjugacy class of x is the set x
G
= {x
g
:
g G} and the size of this class is called the conjugacy class size of x in G and is
denoted by |cl
G
(x)|. We say that x has primary order if its order is a prime power
and x has biprimary order if its order has exactly two distinct prime divisors.
We write (G) for the set of prime divisors of order of G. Suppose that is a set of
primes and
is a complement of . We say that g G is a -element (
-element)
if the prime divisors of the order of g are in (
). There are many results on

the relationship between the structure of a group and its conjugacy class sizes. For
example, Ito shows in [2] that if the sizes of the conjugacy classes of a group G are
Speaker
Key words and phrases. -solvable group, conjugacy class sizes, elements of primary and
biprimary orders, Hall subgroup.
157
{1, m}, then G is nilpotent, m = p
a
for some prime p and G = P A, where P is a
Sylow p-subgroup of G and A Z(G). Also, Ito in [3] shows that G is solvable if
the conjugacy class sizes of G are {1, m, n}.
In [4], the author nd the structure of the nite p-solvable group which its con-
jugacy class sizes of its primary and biprimary elements are {1, p
a
, n}, where p is
prime and gcd(p, n) = 1. In this paper, we are going to prove that.
Main Theorem. Let be non-empty set of prime numbers with || 2 and let G
be a -solvable group. If 1, m and n are the only conjugacy class sizes of -elements
of G of primary and biprimary orders, where m is a -number and n is a
-number,
then there exists p such that m = p
and G = KPW, where P Syl

p
(G), W
is a Hall
-subgroup of G and K Z(G) is a Hall ( {p})-subgroup of G.

2 Main results
Lemma 2.1. [1] Let G be a -solvable group, where is a non-empty subset of
(G).
(a) |cl
G
(x)| is a -number for every
-element x of primary order if and only if G

has an abelian Hall
-subgroup.
(b) |cl
G
(x)| is a
-number for every
-element x of primary order if and only if

G = O
(G) O
(G).
The proof of the following lemma is straightforward and we are going to use it
in the proof of the main theorem.
Lemma 2.2. If G is a nite group and x, y G such that gcd(|x|, |y|) = 1 and
xy = yx, then C
G
(xy) = C
G
(x) C
G
(y).
Proof of the Main Theorem. We are going to show that the conjugacy class sizes
of -elements of G of primary order are {1, m, n}. If not, then one of the following
holds:
i. For every -element x of primary order, if conjugacy class size of x is 1 or m,
then since m is a -number, Lemma 1 shows that
G = O
(G) O
(G).
Thus for every y O
(G), O
(G) C
G
(y), so |cl
G
(y)| is a -number, which is
a contradiction, because by our assumption, there exists y
(G) such that

|cl
G
(y
)| = n.
158
ii. For every -element x of primary order, if conjugacy class size of x is 1 or n,
then by Lemma 1, G has an abelian Hall -subgroup H. Thus for every x H,
H C
G
(x) and hence, for every -element y in G, |cl
G
(y)| is a
-number, which is
contradiction.
Thus there exist -elements x and w of primary orders in Gsuch that |cl
G
(x)| = n
and |cl
G
(w)| = m. Since |cl
G
(x)| = n is a
-number and |cl

G
(x)| =
|G|
|C
G
(x)|
, we
deduce that C
G
(x) contains a Hall -subgroup of G as H. We know that x is a
-element of primary order, so for some p , |x| = p
. Let q {p} and let y

be a q-element of G. Without loss of generality, we can assume that y H. Since
H C
G
(x), y C
G
(x). Thus we have
C
G
(xy) = C
G
(x) C
G
(y) C
G
(x).
This implies that |cl
G
(x)| | |cl
G
(xy)|. Thus n| |cl
G
(xy)|. But xy is a -element of
biprimary order. Thus by assumption of theorem, conjugacy class size of xy in G
is 1, n or m and since n divides the conjugacy class size of xy in G, |cl
G
(xy)| = n.
Now since |cl
G
(x)| = |cl
G
(xy)| = n, C
G
(x) C
G
(y). Thus |cl
G
(y)| | |cl
G
(x)| = n.
Therefore |cl
G
(y)| = 1 or n.
If |cl
G
(y)| = 1, then y Z(G).
If |cl
G
(y)| = n, then since |cl
G
(x)| = n, applying the previous argument shows
that C
G
(xy) = C
G
(y), so C
G
(x) = C
G
(y). Also H C
G
(x), so H C
G
(y).
Thus y Z(H)
This shows that for every q ( {p}) and Q Syl
q
(G), Q Z(H). Thus
H = P K, where P Syl
p
(G), K Z(H) and K is a Hall ( {p})-subgroup of
G. Therefore K is an abelian group.
Also, there exists a -element w in G of primary order such that |cl
G
(w)| = m.
Since H = P K, K is abelian, w is of primary order and m is a -number, we can
see that w P, where P Syl
p
(G). Thus K C
G
(w) and hence, |cl
G
(w)| = p
t
,
where t a positive integer.
Also, for every y K of primary order, since H = K P and K is abelain,
H C
G
(y). Thus |cl
G
(y)| is a
-number. Therefore, |cl

G
(y)| {1, n}. Also,
K C
G
(w) and (|w|, |y|) = 1. Thus
C
G
(yw) = C
G
(y) C
G
(w) C
G
(w).
Consequently, |cl
G
(w)| | |cl
G
(yw)| and hence, m | |cl
G
(yw)|. On the other hand,
we assume that |cl
G
(yw)| {1, m, n}, so |cl
G
(yw)| = m. But C
G
(yw) = C
G
(y)
159
C
G
(w) C
G
(y), so |cl
G
(y)| | |cl
G
(yw)| = m. But |cl
G
(y)| = 1 or n, so |cl
G
(y)| = 1
and hence, y Z(G).
So we show that K Z(G). Therefore, G = K PW, where W is a Hall
-subgroup of G and K Z(G). So theorem follows.

References
[1] C. Shao, Q. Jiang, Finite groups with two conjugacy class sizes of -elements of
primary and biprimary orders, Monatsh. Math. 169 (2013), 105-112.
[2] N. Ito, On nite groups with given conjugate types I, Nagoya Math. J. 6 (1953),
17-28.
[3] N. Ito, On nite group with given conjugate types II, Osaka J. Math. 7 (1970),
231-251.
[4] Q. Kong, Finite groups with three conjugacy class sizes of some elements, Proc.
Indian Acad. Sci. 122 (2012), no. 3, 335-337.
160
The 6
th
On the absolute center of some groups
Mohammad Mehdi Nasrabadi
1
and Ali Gholamian
2
1
Department of Mathematics,University of Birjand, Birjand, Iran
mnasrabadi@birjand.ac.ir
2
Department of Mathematics, Birjand Education, Birjand, Iran
ali.ghfath@gmail.com
Abstract
The concept of the absolute center of a group was introduced
and investigated by Hegarty in a series of papers. This paper
deals with the behavior of the absolute center of a group.
1 Introduction
Let G be a group and A(G) = Aut(G) denote the group of automorphisms of G. If
g G and A(G), then the element [g, ] = g
1
(g) is an autocommutator
element of g and . In [2], Hegarty introduced the following subgroups,
K(G) = [G, Aut(G)] = [g, ]|g G, A(G),
L(G) = {g G|[g, ] = 1, A(G)},
which are called the autocommutator subgroup and absolute center of G, re-
spectively. Clearly, they are both characteristic subgroups in G so that K(G) con-
tains the derived subgroup, G
, and L(G) is contained in the center of G, Z(G). The

autocommutator subgroup and absolute center are already studied in [1-5].
We know that if G is a nite p-group, for some prime p, then Z(G) is non-trivial.
But there exist many p-groups, such that L(G) is trivial. In this paper we prove the
results in the absolute center of a group.
Speaker
2010 Mathematics Subject Classication. 20D45, 20D25.
Key words and phrases. Automorphism, Autocommutator element, Absolute center.
161
2 Preliminary Results
We begin with some useful results that will be used in the proof of our main results.
Denition 2.1. Let H be a subgroup of a group G, h H and A(G). Then
we dene the sets
C
A(G)
(h) = { A(G) | (h) = h},
C
A(G)
(H) = { A(G) | (h) = h h H},
N
A(G)
(H) = { A(G) | (H) = H},
C
G
() = {g G | (g) = g}.
Clearly the sets C
A(G)
(h), C
A(G)
(H) and N
A(G)
(H) are subgroups of A(G) and
the set C
G
() is a subgroup of G.
Denition 2.2. Let H be a subgroup of a group G and x, y H. Then we say that
x is autoconjugate to y in H by A(G), if (x) = y for some A(G).
Remark 2.3. It is easy to check that the relation x is autoconjugate to y in H by
A(G) is an equivalence relation on H. If H is a characteristic subgroup of G, then
this equivalence relation yields a partition of H and each cell in the partition arising
from an equivalence relation is equivalence class. The equivalence classes are called
autoconjugancy classes of H by A(G). The autoconjugancy class of x H by
A(G) is denoted by Acl(x).
Lemma 2.4. Let G be group and H be a subgroup of G. Then
i) N
A(G)
(H) N
A(G)
(K) N
A(G)
(H K).
ii) For any x G, N
A(G)
(H
x
) = N
A(G)
(H)
x
, where x is an inner automorphism of
G.
iii) C
A(G)
(H) N
A(G)
(H).
iv) A(G) = C
A(G)
(H) if and only if H L(G).
Lemma 2.5. Let G be any group and H be a characteristic subgroup of G. Then
i) If H is nite, then
|H| = |Acl(h)|,
such that sum is on distinct autoconjugate classes of H by A(G).
ii) If A(G) is nite, then for any h H
|Acl(h)| = [A(G) : C
A(G)
(h)].
162
Corollary 2.6. Let G be a nite group, then
i)
|G| = [A(G) : C
A(G)
(g)],
such that each autoconjugate class is represented once and only once in the summa-
tion.
ii)
|G| = |L(G)| +
g / L(G)
[A(G) : C
A(G)
(g)],
such that each autoconjugate class is represented once and only once in the summa-
tion.
3 Main Results
We start with the following Lemma.
Lemma 3.1. Let G be an abelian group. Then L(G) is an elementary abelian
2-group.
Theorem 3.2. Let G be a nite abelian group. Then
L(G) = e or C
2
,
where C
2
denotes the cyclic group of order 2.
The following corollary is the immediate result of the above theorem.
Corollary 3.3. Let G be a nite abelian group. Then
L(G) = C
2
if and only if in the decomposition of the sylow 2-subgroup of G there is
unique cyclic direct factor of maximal order and L(G) = e otherwise.
Theorem 3.4. Let G be a group and H be a subgroup of G. Then
N
A(G)
(H)
C
A(G)
(H)
is
isomorphic to a subgroup of A(H).
Corollary 3.5. Let G be a nite group and H be a characteristic subgroup of prime
order p such that p be the smallest prime divisor of |A(G)|, then
H L(G).
Corollary 3.6. Let H be a cyclic characteristic subgroup of G. Then
[H, A(G)
] = e.
Recall: A group G is called perfect if G = G
.
163
Corollary 3.7. For a group G let A(G) be a perfect group and H be a cyclic
characteristic subgroup of G. Then
H L(G).
References
[1] C. Chi s, M. Chi s, and G. Silberberg, Abelian groups as autocommutator groups,
Arch. Math. (Basel). 90 no. 6 (2008) 490492.
[2] P. Hegarty, The absolute centre of a group, Journal of Algebra 169 no. 3 (1994)
929935.
[3] P. Hegarty,Autocommutator subgroups of nite groups, Journal of Algebra 190
(1997) 556562.
[4] M. R. R. Moghaddam,Some properties of autocommutator groups, The rst Two-
Days Group Theory Seminar in Iran, University of Isfahan, 12-13 March 2009,
Isfahan.
[5] M. M. Nasrabadi and A. Gholamian, On nite A-perfect abelian groups, Int. J.
Group Theory. Vol. 01 No.3 (2012) 1114.
164
The 6
th
On countability of homotopy groups
Tayyebe Nasri
1
, Behrooz Mashayekhi
2
and Hanieh Mirebrahimi
3
Department of Pure Mathematics, Center of Excellence in Analysis on Algebraic
Structures, Ferdowsi University of Mashhad, P.O.Box 1159-91775, Mashhad, Iran
1
ta na@stu.um.ac.ir
2
bmashf@um.ac.ir
3
h mirebrahimi@um.ac.ir
Abstract
In this talk we intend to generalize some results of Conner
and Lamereaux on the countability of
1
(X, x). For this,
we show that some properties of topological spaces can be
transferred from X to the loop space
n
(X, x), for some
x X. Finally, we intend to give some conditions in which
the space X is semilocally n-connected.
1 Introduction
Conner and Lamereaux [2] proved that several results concerning the existence of
universal covering spaces for separable metric spaces. They dened several homo-
topy theoretic conditions which are equivalent to the existence of a universal covering
space. For instance they proved that every connected, locally path connected sep-
arable metric space whose fundamental group is a free group admits a universal
covering space. As an application of these results, they proved that a connected,
locally path connected subset of the Euclidean plane, E
2
, admits a universal cover-
ing space if and only if its fundamental group is free, if and only if its fundamental
group is countable. In this talk we intend to generalize some of this results on the
Speaker
2010 Mathematics Subject Classication. Primary 55Q05; Secondary 55P35, 20k20.
Key words and phrases. Homotopy group, Loop space, Free group, Countable group.
165
countability of
1
(X, x). For this, we show that some properties of topological spaces
can be transferred from X to the loop space
n
(X, x), for some x X. Finally, we
intend to give some conditions in which the space X is semilocally n-connected.
2 Main results
In this section, we intend to generalize some results of Conner and Lamereaux [2] on
the countability of
1
(X, x). For this, we show that some properties of topological
spaces can be transferred from X to the loop space
n
(X, x), for some x X.
Lemma 2.1. Let X be locally (n-1)-connected space. If
(n1)
(X, x) is semilocally
simply connected at the constant (n-1)-loop e
x
, then X is semilocally n-connected
at x, for all n 2.
Note that the converse of this fact has been shown by Wada [5, Remark]
Conner and Lamereaux [2] proved that the fundamental group of a path con-
nected, locally connected, separable metric space which admits a universal cover
is countable. Using this result, Lemma 2.1, the fact that the separability, metriz-
ability, locally connected properties of space X can be transferred to the loop space
n
(X, x), for some x X and applying the group isomorphism
1
(
(n1)
(X, x), e
x
)

=
n
(X, x) we conclude the following result. The following result is the rst result on
countability of homotopy groups.
Theorem 2.2. Let X be an (n-1)-connected, locally (n-1)-connected, semilocally
n-connected and separable metric space. Then
n
(X, x) is countable.
A space X is called n-homotopically Hausdor at x X if for any essential n-
loop based at x, there is an open neighborhood U of x for which is not homotopic
(rel

I
n
) to any n-loop lying entirely in U. X is said to be n-homotopically Hausdor
if it is n-homotopically Hausdor at any x X (see [4]).
Consider
n
(X, x) as the space of homotopy classes rel

I
n
of n-loops at x in X.
If p is an n-loop at x, and U is an open neighborhood of x, then we dene O
n
(p, U)
to be the collection of homotopy classes of n-loops rel

I
n
containing n-loops of the
form p , where is an n-loop in U at x. It is routine to check that the collection
O
n
(p, U) is a basis for
n
(X, x). In the following, we show that
n
(X, x) is Hausdor
if and only if X is n-homotopically Hausdor at x. ( see also [1] for the case n = 1.)
The following lemmas are essential to prove of the second result on countability
of homotopy groups.
Lemma 2.3.
n
(X, x) is Hausdor if and only if X is n-homotopically Hausdor
at x.
166
Lemma 2.4.
n
(X, x) with the above topology is homeomorphic to (
(n1)
(X, x), e
x
),
where
(n1)
(X, x) is equipped with the compact-open topology, for all n 2.
Lemma 2.5. Let n 2. Then a space X is n-homotopically Hausdor at x if and
only if
(n1)
(X, x) is homotopically Hausdor at e
x
, for any x X.
We shall also need the following well-known result of Dugundji [3].
Theorem 2.6. If X is second countable and Y is locally compact and second count-
able, then the function space X
Y
is second countable. In particular, if X is second
countable then
n
(X, x) is also second countable, for all x X.
Now, the second result on countability of homotopy groups is as follows.
Theorem 2.7. Suppose that X is a second countable, locally (n-1)-connected and
n-homotopically Hausdor space at x which is not semilocally n-connected at this
point. Then
n
(X, x) is uncountable.
The following corollary is a consequence of Theorems 2.2 and 2.7.
Corollary 2.8. If X is an (n-1)-connected, locally (n-1)-connected, separable met-
ric space, then the following statements are equivalent.
(i) X is semilocally n-connected.
(ii) X is n-homotopically Hausdor and
n
(X) is countable.
One of the main conditions of Theorem 2.2 is assuming that X is semilocally
n-connected. In the follow, we intend to give some conditions in which the space X
is semilocally n-connected.
Conner and Lamereaux [2] proved that if X is a connected, locally path con-
nected separable metric space with a fundamental group which is a free group then
X admits a universal covering space. Using this result, the fact that the sepa-
rability, metrizability, locally connected properties of space X can be transferred
to the loop space
n
(X, x), for some x X and applying the group isomorphism
1
(
(n1)
(X, x), e
x
)

=
n
(X, x) we conclude the following result.
Proposition 2.9. Let X be an (n-1)-connected, locally (n-1)-connected, separable
metric space in which
n
(X, x) is free. Then X is semilocally n-connected at x.
The following results are the extension of some results of Conner and Lamereaux
[2].
167
Denition 2.10. Let i : X Y be an embedding of one path connected space into
another. Then we say that X is a
n
-retract of Y if there exists a homomorphism r :
n
(Y )
n
(X) such that the composition ri
:
n
(X)
n
(X) is an isomorphism.
In this case the homomorphism r is called a
n
-retraction for X in Y. Also, X is called
a
n
-neighborhood retract in Y if X is a
n
-retract of one of its open neighborhoods
in Y .
Denition 2.11. A separable metric space X is called a
n
-absolute neighborhood
retract (
n
-ANR) if whenever X is a subspace of a separable metric space Y , then
X is a
n
-neighborhood retract in Y .
Lemma 2.12. Let Y be locally (n-1)-connected and semilocally n-connected and
X be a
n
-retract of Y . Then X is semilocally n-connected.
Corollary 2.13. Let X be a separable metric space. If X is
n
-ANR, then it is
semilocally n-connected.
References
[1] J.W. Cannon and G.R. Conner, On the fundamental groups of one-dimensional
spaces, Topology and its Applications, 153 (2006) 26482672.
[2] G.R. Conner, J.W. Lamoreaux, On the existence of universal covering spaces for
metric spaces and subsets of Euclidean plane, Fund. Math., 187 (2005), 95-110.
[3] J. Dugundji, Topology, Allyn and Bacon, Boston, 1966.
[4] H. Ghane, Z. Hamed, n-homotopically Hausdor spaces, The 5th Seminar on
Geometry and Topology proceeding, 2009.
[5] H. Wada, Local connectivity of mapping space, it Duke Math. J., 22:3 (1955),
419-425.
168
The 6
th
The schur multiplier of pairs for some nite groups
Adnin A Nawi
1
2
, Nor Haniza Sarmin
3
,
Samad Rashid
4
and Rosita Zainal
5
1,2,3,5
adnin
a@yahoo.com
1
2
, nhs@utm.my
3
,
rosita.zainal@gmail.com
5
4
Department of Mathematics, , Faculty of Science , Shahr-e-Rey Branch, Islamic Azad
University, Tehran, Iran
samadrashid47@yahoo.com
Abstract
The Schur multiplier of a group, M(G) is the second ho-
mology group of G with integer coecients. Let (G, N) be
an arbitrary pair of nite groups, then the Schur multiplier
of pairs of a group, M(G, N) is a nite abelian group with
exponent dividing the order of G. Theoretically, Schur mul-
tiplier of a group and Schur multiplier of pairs of a group
are related to each other. In this research, we determine the
Schur multiplier of pairs of groups of order p
3
and p
2
q where
p and q are prime numbers.
1 Introduction
Let G be a group with a free presentation 1 R F G 1, then the Schur
multiplier of G, M(G) is isomorphic to R F
/[R, F] in which F is any free group

and G

= F/R is any presentation of G. Schur computed M(G) for many types of
groups and Karpilovsky compiled all the computations in [3].
Speaker
2010 Mathematics Subject Classication. Primary 20D15; Secondary 20F99, 20J99.
Key words and phrases. Groups of order p
3
, Groups of order p
2
q, Schur multiplier of pairs of
groups.
169
Let (G, N) be an arbitrary pair of nite groups and N is a normal subgroup of
G, then the Schur multiplier of a pair of groups, M(G, N) is said to be a functorial
abelian groups whose principal feature is the following exact sequence;
H
3
(G) H
3
(G/N) M(G, N) M(G) M(G/N) N/[N, G] (G)
ab
(G/N)
ab
0
in which H
3
(G) is the third homology of G with integer coecients. Ellis [2] deduced
several basic results for M(G, N) by assuming the existence of the above natural
sequence and the existence of a certain transfer homomorphism.
In this research, M(G, N) for groups of order p
3
where p is an odd prime is
determined.
In the following theorems,, some preliminary results that are necessary in proving
our main theorem are stated.
Theorem 1.1. [1] Let G be a group of order p
3
, p an odd prime. Then exactly one
of the following holds:
1. G

= Z
p
3,
2. G

= Z
p
2 Z
p
,
3. G

= (Z
p
)
3
,
4. G

= Z
p
2 Z
p
,
5. G

= (Z
p
Z
p
) Z
p
,
where Z
n
is cyclic group of order n.
Theorem 1.2. [3] Let G be a nite group. Then
1. M(G) is a nite group whose elements have order dividing the order of G.
2. M(G) = 1 if G is cyclic.
Theorem 1.3. [3] Let G be an extra-special p-group of order p
2n+1
. Suppose that
|G| = p
3
and p is odd. Then
M(G) =
_
Z
p
Z
p
; if G is of exponent p
1 ; if G is of exponent p
2
.
Theorem 1.4. [3] If G
1
and G
2
are nite groups, then
M(G
1
G
2
) = M(G
1
) M(G
2
) (G
1
G
2
).
170
Theorem 1.5. [2] Let (G, N) be a pair of groups and Q be the complement of N
in G. Then |M(G, N)| = |M(N)| |N
ab
Q
ab
|.
Theorem 1.6. [2] Let (G, N) be a pair of groups and N = {e} then M(G, N) =
M(G, {e}) = 1.
Theorem 1.7. [2] Let (G, N) be a pair of groups and N = G then M(G, N) =
M(G, G) = M(G).
Theorem 1.8. [2] Supppose that N and Q are subgroups of G, with G = NQ,
N Q = 1 and N normal. In other words, suppose that G is a semi direct product
of N and Q. Then M(G)

= M(G, N) M(Q).
Theorem 1.9. [5] Let G be a cyclic group and H a subgroup of G. Then M(G, N) =
1.
2 Main results
In the following theorems, the Schur multipler of pairs of groups of order p
2
and pq
are stated.
Theorem 2.1. Let G be a group of order p
2
where p is a prime number and let
(G, N) be an arbitrary pair of nite groups where N is a normal subgroup of G.
Then M(G, N) = 1 or Z
p
.
Theorem 2.2. Let G be a group of order pq where p and q are prime number and
p < q. Let (G, N) be an arbitrary pair of nite groups where N is a normal subgroup
of G. Then M(G, N) = 1.
In the following theorem, the Schur multipler of pairs of groups of order p
3
is
stated.
3
, p an odd prime. Then exactly one of
the following holds:
M (G, N) =
_
_
1 ; if G

= Z
p
3 and G

= Z
p
2 Z
p
,
1 or Z
p
; if G

= Z
p
2 Z
p
,
1 or Z
2
p
; if G

= (Z
p
Z
p
) Z
p
,
1, Z
2
p
or Z
3
p
; if G

= Z
3
p
.
Proof. In order to compute the Schur multiplier of pairs of groups of order p
3
, the
classication in Theorem 1.1 is referred.
171
Firstly, lets consider the case where G

= Z
p
3. Since G is cyclic, we have M(G, N) =
1. The result follows from Theorem 1.9.
For a group G

= Z
p
2 Z
p
, we have the following cases:
Case 1: If N = {e}, then by Theorem 1.6, M(G, N) = M(G, {e}) = 1.
Case 2: If N = Z
p
2 then M(G, N) = M(G, Z
p
2). ByTheorem 1.5, the computation
is as follows;
|M(G, Z
p
2)| = |M(Z
p
2)| |(Z
p
2)
ab
(Z
p
)
ab
|. Since Z
p
2 is cyclic, M(Z
p
2) = 1 (refer to
Theorem 1.2). We have (Z
n
)
ab
= Z
n
, thus it is clear that Z
p
2 (Z
p
)

= Z
(p
2
,p)
= Z
p
.
Thus, M(G, Z
p
2) = Z
p
.
Case 3: If N = Z
p
then M(G, N) = M(G, Z
p
). The computation is similar as in
Case 2.
Case 4: If N = G then by Theorem 1.7 M(G, N) = M(G, G) = M(G). Then by
Theorem 1.4, we have the following computation:
M(Z
p
2 Z
p
) = M(Z
p
2) M(Z
p
) (Z
p
2 Z
p
). By Theorem 1.2, M(G) = Z
p
.
By using a similar method as the group G

= Z
p
2 Z
p
, the computation of M(G, N)
for G

= Z
3
p
is given as follows:
Case 1: If N = {e}, then M(G, N) = M(G, {e}) = 1.
Case 2: If N = Z
p
Z
p
p
Z
p
) = Z
3
p
.
Case 3: If N = Z
p
p
) = Z
2
p
.
Case 4: If N = G then M(G, N) = M(G, G) = M(G) = Z
3
p
.
For the group G

= Z
p
2 Z
p
, we consider the following cases:
Case 1: If N = {e}, then by Theorem 1.6, M(G, N) = M(G, {e}) = 1.
Case 2: If N = Z
p
2 then M(G, N) = M(G, Z
p
2). By Theorem 1.8, M(G)

=
M(G, Z
p
2) M(Z
p
). M(G) = 1 is computed in [3] and M(G) = 1 (refer to Theorem
1.3). Hence, it is clear that M(G, Z
p
2) = 1.
Case 3: If N = G then M(G, N) = M(G, G) = M(G). Thus, M(G) = 1 as given in
Theorem 1.3.
For the group G

= (Z
p
Z
p
) Z
p
the following cases are considered:
Case 1: If N = {e}, then by Theorem 1.6 M(G, N) = M(G, {e}) = 1.
Case 2: If N = Z
p
Z
p
p
Z
p
). M(G) is computed in [3] and
M(G) = (Z
p
)
2
(refer to Theorem 1.3). Hence, by Theorem 1.8 M(G, Z
p
Z
p
) = Z
2
p
.
Case 3: If N = G then by Theorem 1.7 M(G, N) = M(G, G) = M(G). Thus,
M(G) = Z
2
p
as given in Theorem 1.3.
Lastly, in the following theorem, we state the Schur multipler of pairs of groups
of order p
2
q.
172
2
q where p and q are distinct primes
and (G, N) be an arbitrary pair of nite groups where N is a normal subgroup of
G. Then M(G, N) = 1 or Z
p
.
Acknowledgement
The authors would like to thank Universiti Teknologi Malaysia (UTM) for the -
nancial funding through the Research University Grant (RUG) Vote No. 04H13
and UTM Mobility Program. The rst author would also like to thank Ministry of
Education (MOE) Malaysia for her MyPhD Scholarship.
References
[1] D. S. Dummit and R. M. Foote Abstract Algebra, Third Edition, USA. John
Wiley and Sons, Inc., 2004.
[2] G. Ellis, The Schur multiplier of a pair of groups, Applied Categorical Structures,
6 (1998), 355371.
[3] G. Karpilovsky, The Schur multiplier, LMS Monogrphs New Series 2, Oxford
Univ. Press, 1987.
[4] F. Mohammadzadeh, A. Hokmabadi and B. Mashayekhy, On the order of the
Schur multiplier of a pair of nite p-groups II, International Journal of Group
Theory, 2 (2013), no. 3, 18.
[5] A. A. Nawi, N. M. Mohd Ali, N. H. Sarmin and S. Rashid On The Second
Homology of Pairs of Groups of Finite Order, AIP Conf. Proc. (to appear).
173
The 6
th
Separation properties of topological fundamental groups
Ali Pakdaman
1
, Behrooz Mashayekhi
2
and Hamid Torabi
2
1
a.pakdaman@gu.ac.ir
2
Department of Pure Mathematics,
Center of Excellence in Analysis on Algebraic Structures,
Ferdowsi University of Mashhad,
P.O.Box 1159-91775, Mashhad, Iran
bmashf@um.ac.ir and hamid
torabi86@yahoo.com
Abstract
In this talk, we discuss on the topological properties of the
Spanier groups which are new subgroups of fundamental
group, constructed by an inverse limit method. Also, by
using these results, we establish an algebraic criteria for the
Hausdorness of topological fundamental groups.
1 Introduction
In 2002, a work of Biss initiated the development of a theory in which the familiar
fundamental group
1
(X, x) of a topological space X becomes a topological space
denoted by
top
1
(X, x) by endowing it with the quotient topology inherited from the
path components of based loops in X with the compact-open topology. Among other
things, Biss claimed that
top
1
(X, x) is a topological group. However, there is a gap
in his proof. Brazas discovered some interesting counterexamples for continuity of
multiplication in
top
1
(X, x) (for more details, see [1]).
In fact,
top
1
(X, x) was a quasitopological group, that is, a group with a topology
such that inversion and all translations are continuous. After this obstacle, Brazas
[1] by removing some open sets of
top
1
(X, x), make it a topological group and denote
Speaker
2010 Mathematics Subject Classication. Primary 20F38; Secondary 20k45 , 57M10.
Key words and phrases. Topological fundamental group, Spanier group, Hausdor topology.
174
it by
1
(X, x). Indeed, the functor
1
removes the smallest number of open sets
from the topology of
top
1
(X, x) so as to make it a topological group. Here, by the
topological fundamental group we mean
1
(X, x).
In the sequel, we study the topology of topological fundamental group from some
separation axioms viewpoint. The main idea is working with the Spanier groups
with respect to open covers of a given space X which have been introduced in [2]
and named in [2]. The importance of these groups and their intersection which is
named Spanier group,
sp
1
(X, x), is studied by H. Fischer et al. in [2] in order to
modication of the denition of semi-locally simply connectedness.
Throughout this article, all the homotopies between two paths are relative to
end points, X is a connected and locally path connected space with the base point
x X, and p :

X X is a covering of X with x p
1
({x}) as the base point of

X.
For a space X and any H
1
(X, x), by

X
H
we mean a covering space of X such
that p
1
(
X, tildex) = H, where x p
1
(x) and p :

X
H
X is the corresponding
covering map.
2 Denitions and preliminaries
E.H. Spanier [2, 2.5] classied path connected covering spaces of a space X using
some subgroups of the fundamental group of X, recently named Spanier groups (see
[3]). If U is an open cover of X, then the subgroup of
1
(X, x) consisting of all
homotopy classes of loops that can be represented by a product of the following
type
n
j=1
j

j

1
j
,
where the
j
s are arbitrary paths starting at the base point x and each
j
is a loop
inside one of the neighborhoods U
i
U, is called the Spanier group with respect to
U, and denoted by (U, x) [2]. For two open covers U, V of X, we say that V renes
U if for every V V, there exists U U such that V U.
Denition 2.1. [2] The Spanier group of a topological space X, denoted by
sp
1
(X, x)
for an x X is
sp
1
(X, x) =
open covers U
(U, x).
Also, we can obtain the Spanier groups as follows: Let U, V be open coverings
of X, and let U be a renement of V. Then since (U, x) (V, x), there exists
an inverse limit of these Spanier groups, dened via the directed system of all open
covers with respect to renement and it is
sp
1
(X, x).
175
Denition 2.2. [3] We call a topological space X the Spanier space if
1
(X, x) =
sp
1
(X, x), for an arbitrary point x X.
Proposition 2.3. [3] If p :

X X is a covering and x X, then
sp
1
(X, x)
p
1
(
X, tildex).
Theorem 2.4. ([2, 2.5 Theorems 12,13]) Let X be a connected, locally path con-
nected space and H
1
(X, x), for x X. Then there exists a covering p :

X X
such that p
1
(
X, tildex) = H if and only if there exists an open cover U of X in

which (U, x) H.
We immediately deduce that for every open cover U of X,

X
(U,x)
exists.
3 Main results
By [5, Theorem 3.7], the connected coverings of a connected and locally path con-
nected space X are classied by conjugacy classes of subgroups of
qtop
1
(X, x) with
open core, and since
1
(X, x) and
qtop
1
(X, x) have the same open subgroups [1,
Corollary 3.9], we have the same result for open subgroups of
1
(X, x). Using this
fact and Theorem 1.2, for every open cover U of X, (U, x) is an open subgroup
of
1
(X, x) and since
1
(X, x) is a topological group, (U, x) is a closed subgroup,
which implies that
sp
1
(X, x) is a closed subgroup of
1
(X, x). Hence we have the
following proposition.
Proposition 3.1. For a connected and locally path connected space X,
sp
1
(X, x)
is a closed subgroup of
1
(X, x), for every x X.
Using the above proposition, the Spanier group of a connected and locally path
connected space contains the closure of the trivial element of the topological funda-
mental group. Hence we have the following corollary.
Corollary 3.2. Let X be a connected and locally path connected space and x X.
If
1
(X, x) has an indiscrete topology, then X is a Spanier space.
Corollary 3.3. Let X be a connected and locally path connected space and x X.
If
sp
1
(X, x), then
1
(X, x) has the T
1
topology.
We recall that a space X is called shape injective if the natural homomorphism
:
1
(X, x)
1
(X, x) is injective, where
1
(X, x) is the rst shape group of
(X, x). Also, an open cover U of X is called normal if it admits a partition of unity
subordinated to U. Also, every open cover of a paracompact space is normal. (see [3]
for further details). In [1, Proposition 3.25] it is proved that the topological funda-
mental groups of shape injective spaces are Hausdor. Since the spaces with a trivial
176
Spanier group are not necessarily shape injective, the triviality of Spanier groups
can not certify the Hausdorness of topological fundamental groups in general. In
the following, we provide the conditions that guarantee this.
Denition 3.4. [3] A space X is small loop homotopically Hausdor if for each
x X and each loop based at x, if for each normal open cover U of X, [] (U, x),
then [] = 1.
Proposition 3.5. Suppose X is a connected, locally path connected and paracom-
pact space. Then
sp
1
(X, x) if and only if X is shape injective.
Corollary 3.6 (A criterion for the Hausdorness of
1
(X, x)). Let X be a con-
nected, locally path connected and paracompact space. If
sp
1
(X, x), then
1
(X, x)
is Hausdor.
Note that since
1
(X, x) is a topological group, by the assumption of the above
corollary
1
(X, x) is regular.
References
[1] J. Brazas, The fundamental group as a topological group, Topology Appl. 160
(2013), no. 1, 170188.
[2] H. Fischer, D. Repovs,

Z. Virk, and A. Zastrow, On semilocally simply connected
spaces, Topology Appl. 158 (2011), no. 3, 397408.
[3] B. Mashayekhy, A. Pakdaman, H. Torabi, Spanier spaces and covering theory
of non-homotopically path Hausdor spaces, Georgian Mathematical Journal, 20
(2013) 303317.
[4] E. H. Spanier, Algebraic Topology, McGraw-Hill Book Co., New York-Toronto,
Ont.-London 1966
[5] H. Torabi, A. Pakdaman, B. Mashayekhy, On the Spanier Groups and Covering
and Semicovering Spaces, arXiv:1207.4394v1.
177
The 6
th
On the characterizations of nite groups
Hosein Parvizi Mosaed
1
, Ali Iranmanesh
2
and Mahnaz Foroudi
Ghasemabadi
3
1
Department of Mathematics, Science and Research Branch, Islamic Azad University,
Tehran, Iran
h.parvizi.mosaed@gmail.com
2
Department of Mathematics, Tarbiat Modares University, Tehran, Iran
iranmana@modares.ac.ir
3
Department of Mathematics, Tarbiat Modares University, Tehran, Iran
foroudi@modares.ac.ir
Abstract
Let G be a nite group and (G) be the set of all prime
divisors of |G|. Let
e
(G) be the set of element orders of G
and k(G) be the largest element order of G. Suppose that
m
k
be the number of elements of order k in G and nse(G) =
{m
k
| k
e
(G)}. In this talk, we rst prove that the nite
simple k
4
-groups Sz(8), Sz(32), L
2
(2
m
), L
2
(3
m
), L
2
(p
2
),
where p {5, 7} are characterizable by nse(G). Then we
show that the sporadic simple groups except Fi
22
and He
are characterizable by nse(G) and (G). Finally the char-
acterization of the nite groups PGL
2
(p) and L
2
(3
m
) by |G|
and k(G) are investigated.
Speaker
Key words and phrases. Element order, the largest element order, simple group, sporadic simple
group.
178
1 Introduction
During the classication of the nite simple groups, it has been observed that some
of the known simple groups are characterizable by some of their properties and
up to now, dierent characterizations are investigated for the nite simple groups.
For instance, in [4], motivated by one of the Thompsons problem, the authors
introduced a new characterization for nite simple groups by nse(G) and |G|. For
a nite group G, denote by
e
(G) the set of element orders of G. If k
e
(G), then
m
k
denotes the number of elements of order k in G. Let nse(G) = {m
k
| k
e
(G)}.
In fact, the authors in [4] proved that all nite simple K
4
-groups can be uniquely
determined by nse(G) and |G|. Let (G) be the set of all prime divisors of the
order of a nite groups G. The nite simple group G is called simple K
n
-group if
|(G)| = n. Following this result, in [3] and [5], the authors prove that the group
L
2
(q), where q {3, 4, 5, 7, 8, 9, 11, 13} is determined only by nse(G) and up to the
present time, it has been proved that some other simple groups can be characterized
by nse(G) and |G| or only by nse(G) (see for instance [2]-[3]). In this talk, we
try to extend the results in [4]. In fact, we prove that the nite simple k
4
-groups
Sz(8), Sz(32), L
2
(2
m
), L
2
(3
m
), L
2
(p
2
), where p {5, 7} are uniquely determined
by nse(G). Also, we show that the sporadic simple groups except Fi
22
and He are
characterizable by nse(G) and (G).
It is a well-known conjecture by Shi which states that every nite simple group
G is uniquely determined by
e
(G) and |G| in the class of all group. A series
of papers proved that this conjecture is true for most of nite simple groups and
nally Mazurov, et al. completed the proof of the validity of Shis conjecture for all
nite simple groups. Now the authors try to characterize simple groups by using
less quantities. For instance, in [1], it has been proved that the linear simple group
L
2
(q) with q = p
n
< 125 is determined by group order, the largest, the second
largest and the third largest element orders. Let k(G) denote the largest element
order of a nite group G. Our another goal in this talk is to investigate that the
group PGL
2
(p), where p > 3 is a prime number and the simple K
4
-group L
2
(3
m
)
are characterizable by |G| and k(G).
2 Main results
Theorem 2.1. Let G be a group and S be one of the following simple groups:
1. L
2
(2
m
), where m, 2
m
1 and (2
m
+ 1)/3 are primes greater than 3;
2. L
2
(3
m
), where m, (3
m
1)/2 are odd primes and (3
m
+1)/4 is either a prime
or 11
2
for (m = 5);
179
3. Sz(8) and Sz(32);
4. L
2
(p
2
)), where p {5, 7}.
If nse(G) = nse(S), then G

= S.
Theorem 2.2. Let G be a group and S be a sporadic simple groups except Fi
22
and He. If nse(G) = nse(S) and (G) = (S), then G

= S.
Theorem 2.3. Let G be a group and S be one of the following groups:
1. L
2
(3
m
), where m, (3
m
1)/2 are odd primes and (3
m
+1)/4 is either a prime
or 11
2
for (m = 5);
2. PGL
2
(p), where p > 3 is a prime.
If |G| = |S| and k(G) = k(S), then G

= S.
References
[1] He, L.G., Chen, G.Y.: A new characterization of simple L
2
(q) where q = p
n
<
125. Italian Journal of Pure and Applied Mathematics, 28:127-136, 2011.
[2] Khalili Asboei, A.R., Salehi Amiri, S.S., Iranmanesh, A., Tehranian, A.: A
characterization of sporadic simple groups by NSE and order. J. Algebra Appl.
12, 1250158 (2013)
[3] Khatami, M., Khosravi, B., Akhlaghi, Z.: A new characterization for some linear
groups, Monatsh. Math. 163, 39-50 (2011)
[4] Shao, C.G., Shi, W.J., Jiang, Q.H.: Characterization of simple K
4
-groups, Front.
Math. China 3, 355-370 (2008)
[5] Shen, R., Shao, C., Jiang, Q., Shi, W., Mazurov, V.: A new characterization of
A
5
, Monatsh. Math. 160, 337-341 (2010)
180
The 6
th
An approach to c-imperfect groups
Azam Pourmirzaei
1
and Mitra Hassanzadeh
2
1
Department of Mathematics, Hakim Sabzevari University, P. O. Box 96179-76487,
Sabzevar, Iran
a.pmirzaei@hotmail.com
2
Department of Pure Mathematics, Ferdowsi University of Mashhad, P. O. Box
1159-91775, Mashhad, Iran
mtr.hassanzadeh@gmail.com
Abstract
We call a group G, c-imperfect if it has no nontrivial c-
perfect quotient group. In this paper, some equivalent condi-
tions for a group to be c-imperfect is obtained. Furthermore
we show that every countable residually c-imperfect group
is c-imperfect. Finally this fact that the class of countable
c-imperfect groups forms a variety is concluded.
1 Introduction
Groups that coincide with their derived subgroups which are called perfect groups,
are extensively studied in group theory. It is very clear that every simple nonabelian
group is perfect. The smallest nontrivial nite perfect group must be simple, hence
is the alternating group A
5
= PSL(n, K), for n 3 or n = 2 where |K| > 3 (see [1]).
A type of groups that are far removed from the domain of perfect groups are
called imperfect groups which is introduced by Robinson in [3]. A group is said to be
imperfect if it has no nontrivial perfect quotient group. Soluble and nite symmetric
groups are some examples of imperfect groups.
Speaker
2010 Mathematics Subject Classication. Primary 20E34; Secondary 20E22, 20F05.
Key words and phrases. Perfect group, Imperfect group, Variety.
181
In this work we introduce a new notion c-imperfect groups, that is, a group
with no nontrivial c-perfect quotient group. By a c-perfect group G we mean
c+1
(G) = G. For c = 1, we have imperfect groups, also it can be easily seen
that every imperfect group is c-imperfect. We emphasize that this generalization
yields to have better result for imperfect groups.
2 Main results
We begin this section by some basic properties of the class of c-imperfect groups.
The class of c-imperfect groups is closed with respect to homomorphic images.
The class of c-imperfect groups is closed with respect to extension.
Theorem 2.1. If M and N are c-imperfect normal subgroups of a group G, then
MN is c-imperfect.
Proof. By the hypothesis as MN/N is c-imperfect, we have the result.
The following lemma is essential for Theorem 2.3
Lemma 2.2. If G is a nilpotent group of class c, then G is c-imperfect.
Theorem 2.3. Suppose that M and N are normal subgroups of a group G. If G/M
and G/N are c-imperfect, then so is G/M N.
Proof. Without lose of generality we can assume that M N = 1. Consider a c-
perfect quotient of G, G/L. The c-perfect subgroup LM/M of G/M implies that
G = LM. Similarly G = LN. In the same vein we assume L M = 1. Then
[M,
c
G] = 1, hence M Z
c
(G). By Lemma 2.2, G = L.
Lemma 2.2 and Theorem 2.3 have the following nice but easy conclusion.
Corollary 2.4. Let G/Z
c
(G) be a c-imperfect group. Then G/(G) is c-imperfect.
Theorem 2.5. A direct product of c-imperfect groups is c-imperfect.
Proof. Let G =
, where G
is a c-imperfect group. Consider the c-perfect

factor G/L of G. Similar to the previous argument let G
L = 1, for every .
Therefore L Z
c
(G) and hence by the assumption G
= Z
c
(G
). This shows that

G is nilpotent of class c and so L = G.
The following theorem asserts a description of c-imperfect groups by mapping
properties.
182
Theorem 2.6. For a group G the following conditions are equivalent:
(i) G is c-imperfect.
(ii) If : H Gis a homomorphism inducing an epimorphism
c
: H/
c+1
(H)
G/
c+1
(G), then G =< Im
c
>
G
.
(iii) If N G and the natural map N/
c+1
(N) G/
c+1
(G) is surjective, then
N = G.
Proof. (i) (ii): By contrary let < Im
c
>
G
< G. Then since G is c-imperfect,
c+1
(G) < Im
c
>
G
< G. On the other hand
c
is an epimorphism. These facts
force the subgroup < Im
c
>
G
to be equal to G which is a contradiction.
(ii) (iii): It is clear.
(iii) (i): Let G/T be a c-perfect quotient of G. Consider the natural map
: T G. Since
c+1
(G)T = G,
c
: T/
c+1
(T) G/
c+1
(G) is an epimorphism.
Therefore G = T.
In sequel we explore that the class of all countable c-imperfect groups forms
a variety of groups. This determines that the property of being c- imperfect in a
countable group is inherited by its subgroup. Moreover we deal with residually c-
imperfect groups. As free groups are residually nilpotent so residually c-imperfect
but not necessarily c-imperfect ([4]). Now the following theorem may be interesting.
Theorem 2.7. If Gis a countable residually c-imperfect group, then Gis c-imperfect.
Proof. From the denition of residually X-group ([2]) and Theorem 2.3, the result
holds.
Corollary 2.8. A subcartesian product of c-imperfect groups is c-imperfect.
Proof. A group G is residually c-imperfect if and only if it is a subcartesian product
of c-imperfect groups ([2]). The previous theorem implies the result.
A class of groups which is closed with respect to forming homomorphic images
and subcartesian product of its members is a variety ([2]). Furthermore every variety
is closed with respect to forming subgroups, images and subcartesian product ([2]).
These facts help us to achieve our goals.
Corollary 2.9. The class of countable c-imperfect groups is a variety.
Corollary 2.10. Every subgroup of a countable c-imperfect group is c-imperfect.
183
References
[1] R. Beyl, J. Tappe, Group extensions, representations and Schur multiplicator,
Lecture notes in math, vol. 958, Springer-verlag, Berlin, 1982.
[2] D. J. S. Robinson, A course in the theory of groups, Speringer-Verlage, New
York, 1982.
[3] D. J. S. Robinson, Finiteness conditions and generalized soluble groups,
Speringer, Berlin, 1972.
[4] D. J. S. Robinson, Imperfect groups, Journal of Pure and Applied Algebra 88
(1993) 3-22.
184
The 6
th
The structure of Permutation Groups with
t = 1/3(6m2)
Behnam Razzaghmaneshi
Department of Mathematics, Faculty of Sciences, Islamic Azad University, Talesh Branch,
Talesh, Iran
b razzagh@yahoo.com
Abstract
Let G be a permutation group on a set with no xed
points in . If t the number of G-orbits in . Then in this
paper we classied all of groups for t = 1/3(6m2).
1 Introduction
Let G be a permutation group on a set with no xed points in and let m be a
positive integer. If for a subset of the size |
g
\ | is bounded, for g G , we dene the
movement of as move() = max
gG
|
g
\ |. If move() m for all ,then G is said
to have bounded movement and the movement of G is dene as the maximum of move()
over all subsets , that is,
m := move(G) := sup{|
g
\ || , g G}.
This notion was introduced in [3]. By [3,Theorem 1],if G has bounded movement m,then
is nite. Moreover both the number of G-orbits in and the length of each G-orbit
are bounded above by linear functions of m.In particular it was shown that the number of
G-orbits is at most 2m-1. In this paper we will improve this to 13(6m2), if the lengths of
all orbits not equal to 2. If m=1, then t = 1, || = 2 and G is Z
2
or S
2
. So in this paper we
suppose that m greater than 1. We present here a classication of all groups for which the
bound 13(6m2) is attained. We shall say that an orbit of permutation group is nontrivial
if its length is greater than 1.The main result is the following theorem.
Theorem 1.1. Let m be a positive integer and suppose that G is a permutation group on
a set such that G has no xed points in , and G has bounded movement equal to m .
2010 Mathematics Subject Classication. 20B25.
Key words and phrases. permutation group, bounded movement, orbits.
185
If the lengths of all orbits not equal to 2. Then the number t of G-orbits in is at most
13(6m 2). And also if t = 13(6m 2), then m is a power of 2, and G is order 2m, all
G-orbits have length 2 or 3, and the pointwise stabilizers of the G-orbits are precisely the
13(6m2) distinct subgroups of G of index 2 or 3 .
Note that an orbit of a permutation group is non trivial if its length is greater than 1.
The groups described below are examples of permutation groups with bounded movement
equal to m which have exactly 13(6m2) nontrivial orbits.
2 Examples and Preliminaries
Lemma 2.1. [5, Lemma 2.1]. Let G be a permutation group on a set and suppose that
. Then for each g G, |
g
\ |

t
i=1
l
i
/2, where l
i
is the length of the ith cycle
of g and t is the number of nontrivial cycles of g in its disjoint cycle representation . This
upper bound is attained for = (g) dened above .
Now we will show that there certainly is an innite family of 3-groups for which the maxi-
mum bound obtained in Theorem 1.1 holds .
Example 2.2. For a positive integer d and a prime number 3, let G
1
:= (123)

= Z
3
be
a permutation group on
1
:= 1, 2, 3. Moreover, suppose that G
2
:= Z
d
2
, and H
1
, ..., H
t
be
all subgroups of index 2 in G on
2
:=
2
d
1
i=1

2i
, where
2i
denotes the set of two cosets
of H
i
in G
2
, 1 i t = 2
d
1. Then G
2
has movement equal 2
d
1 and also (2
d
1)
nontrivial orbits in
2
. Now we consider the direct product G := G
2
G
2
as a permutation
on which is the disjoint union of
1
and
2
, and G
1
and G
2
act trivially on
2
and
1
,
respectively . Then G has movement 1 + 2
d
1 . The set splits into 2
d
= 2m2 orbits
under G, which are
1
and 2
d
1 orbits of length 2 in
2
. In particular , none of them is
trivial . Furthermore , 4m3 = 4(1 + 2
d+1
) 3 = 3 + 2(2
d
1) = |
1
| +|
2
| = || .
Example 2.3. Let d , G
2
and
2
have the same meaning as Example 2.2 . Suppose that
the permutation group G
1
:= Z
3
Z
d
2
on
1
of length 3 is a Ferobenius group dened as above
of order 32
d
where 2
d
|2 for some positive integer d, let x be a generator of a complement
isomorphic to Z
d
2
. Then G := G
1
G
2
is a permutation group on :=
1

2
( as in
Example 2.2) with bounded movement m = 1 + 2
d1
and (2m 2) 1 = 2m3 orbits of
lengths 2 in
2
as well as single orbit in
1
. In particular, || = 2(2m 3) + 3 = 4m 3,
which meets the upper bound for the latter inequality in Theorem 1.1.
Example 2.4. Let r be a positive integer , let G := Z
3
Z
r
2
, let t := 2m 2 , and let the
lengths of all orbits are not equal to 2, and H
1
, ..., H
t
be an enumeration of the subgroups of
index 2 in G. Dene
i
to be the coset space of H
i
in G and :=
1
...
t
. If g G\ 1
then g lies in 13(3.2
r+1
1) of the groups H
i
and therefore acts on as a permutation with
13(3.2
r+1
2) = m 1 xed points and 2
r
disjoint 2-cycles . Taking one point from each
of these 2-cycles to form a set we see that m(G) 2
r
,and it is not hard to prove that
in fact m(G) = 2
r
. Thus n = 2t = 23(3.2
r+1
4) = 23(6m 2) . This proves bound of
G orbits of Theorem 1.1 . It follows that G has bounded movement equal to m, and G
has 13(6m2) nontrivial orbits in .
When m > 1, the classication in Theorem 1.1 follows immediately from the following
186
theorem about subsets with movement m.
Denition Let G be a permutation group on a set with orbits
i
, for i I. We shall say
that a subset G cuts across each G-orbit if G
i
:= G
i
/ {,
i
}, for every i I.
Theorem 2.3. Let GlSym() be a permutation group with t orbits for positive integer
t, such that the lengths all of orbits are not to 2. Moreover suppose that G such that
move (G) = m > 1, and G cuts across each G-orbit. Then t 13(6m2) and moreover, if
t = 13(6m2) , then:
(1) G is an 2-group and all G-orbits of G has size 2 ;
(2) If the rank of the group G is r then r2, t = 13(3.2
r+1
2) and m = 2
r1
;
(3)If one of the G-orbits is 3, then The tdifferentGorbits are (isomorphic to) the coset
spaces of the 13(3.2
r+1
2) 1 = 13(3.2
r+1
5) dierent subgroups of index 2inG.
3 Proof of Theorem 2.3.
From now on we may and shall assume that each |G
i
| = 1. Let G
i
= {
i
}. Further we
may assume that n
1
ln
2
l...ln
t
. For g G let c(g) denote the number of integers I such that
g
i
=
i
. Note that since move (G) = m, we have c(g) > t m = 2m 23 m = m 23
and also c(1
G
) = t > m23.
Lemma 3.2. If one of the orbits of G has length equal to 3, then the rest orbits of G has
size 2.
Proof : Let X denote the number of pairs (g,i) such that g G, 1 i t , and
g
i
=
i
.
Then X =
gG
c(g), and by our observations, X > |G|.(m1). On the other hand, for each
i, the number of elements of G which x
i
is |G
i
| = |G|n
i
, and hence X = |G|
t
i=1
n
1
i
If all the n
i
2, and one of n
i
3 then X |G|.t2 = |G|(m 13) |G|.(m 1) (since m3 )
which is a contradiction. Hence n=2.
A similar argument to this enables us to show that except one the rest of n
i
is n
i
= 2,
and hence that G is an 2 group.
Lemma 3.3. The group G = Z
3
Z
r
2
for some r2. Moreover for each n
i
= 2, except one
, the stabilizers G
i
(2lilt) are pair wise distinct subgroups of index 2 in G, and for each
g = 1, c(g) = (m12).
Proof: By Lemma 3.2, except one of n
i
the rest of n
i
is n
i
= 2. Thus H := G
i
is a subgroup
of index 2. This time we compute the number Y of pairs (g, i) such that g G H, 2lilt ,
and
g
i
=
i
. For each such g,
g
1
=
1
and hence there are c(g) of these pairs with rst
entry g. Thus Y =
gG\H
c(g)|G\H|(m1) = |G|(m12).
On the other hand, for each i2, the number of elements of G, which x
i
is |G
i
\H|.
If H = G
i
then |G
i
\H| = 0, while if G
i
= H, then |G
i
\H| = |G
i
|2 = |G|2n
i
l|G|4.
Hence
Y =
t
i=2
|G
i
\H|l]|G|2
t
i=2
1n
i
l|G|2(13 +t 12)
= |G|2(3t 16) < |G|(m12)
It follows that equality holds in both of the displayed approximations for Y . This means
in particular that each n
i
= 2, Whence G = Z
r
3
for some r. Further, for each i3, G
i
= H
187
and so r2. Arguing in the same way with H replaced by G
i
, for some i2, we see that
G
i
= G
j
if j = i, and also if g G
i
then c(g) = (m12). Thus the stabilizers G
i
(1lilt)
are pairwise distinct , and if gl1 then c(g) = (m12). Finally we determine m.
Lemma 3.4.. m = 2
r1
Proof: We use the information in lemma 3.3 to determine precise the quantity X =
gG
c(g) : X = t + (|G| 1).(m 23) = 13(6m 2)(3.2
r1
1)(m 23). On the other
hand, from the proof of lemma 3.2,
X = |G|
t
i=1
n
1
i
= |G|(13 +t 12) = 3.2
r
.(m(3t 1)6) = 2
r1
(3t 1).
Thus implies that m = 2
r1
.
The proof of theorem 2 now follows from lemmas 3.2 3.4.
References
[1] L.Brailovsky, Structure of quasi-invariant sets, Arch.Math.,59 (1992),322-326.
[2] L.Brailovsky, D.Pasechnix , C.E.Praeger, Subsets close to invarianr subset of quasi-
invariant subsets for group actions ,,Proc.Amer. Math.Soc. ,123(1995),2283-2295.
[3] C.E.Praeger,On permutation groups with bounded movement,J.Algebra ,144(1991),436-
442.
[4] C.E.Praeger, The separation theorem for group actions, in ordered Groups and Innite
Groups(W.charles Holland, Ed.), Kluwer Academic, Dordrecht/ Boston/ Lond, 1995.
[5] A.Hassani,M.Khayaty,E.I.Khukhro and C.E.Praeger, Transitive permutation groups
with bounded movement having maximum degree.J. Algebra,214(1999),317-337.
[6] J.R.Cho, P.S.Kim, and C.E.Praeger, The maximal number of orbits of a permutation
Group with Bounded Movement, J.Algebra,214 (1999),625-630.
[7] P.M.Neumann, The structure of nitary Permutation groups, Arch. Math. (Basel)
27(1976),3-17.
[8] B.H.Neumann, Groups covered by permutable subsets, J. London Math soc., 29(1954),
236-248.
[9] P.M.Neumann, C.E.Praeger, On the Movement of permutation Group, J.Algebra, 214,
(1999)631-635.
188
The 6
th
Permutation Groups with Three Constant Orbits
Behnam Razzaghmaneshi
Department of Mathematics, Faculty of Sciences, Islamic Azad University, Talesh Branch,
Talesh, Iran
b razzagh@yahoo.com
Abstract
Let G be a permutation group on a set with no xed
points in . If t the number of G-orbits in . Then in this
paper we determined the maximum bound || = 3m + 2,
for t = 2, will be classied. We show that there are not no
group and no example for case || = 3m+t 1,when t > 2.
1 Introduction
Let G be a permutation group on a set with no xed points in and let m
be a positive integer. If each G-orbit has length at most 3m, t 2m 1 and
n := || 3m + t 1 5m 2, where t is the number of G-orbits on . In [2]
it was shown that n = 5m 2 if and only if n = 3 and G is transitive. But in [4],
this bound was rened further and it was shown that n (9m3)/2. Moreover, if
n = (9m3)/2 then either n = 3 and G = S
3
or G is an elementary abelian 3-group
and all its orbits have length 3. Also this upper bound was improved to the bound
n 4mp in [1, Theorem 1.1], where p 5 is the least odd prime dividing |G|.
Throughout this paper m is a positive integer and G is an intransitive permuta-
tion group on a set of size n with movement m and t( 2) orbits, such that
n = 3m+t 1. The purpose of this paper is to classify all intransitive permutation
groups of degree n = 3m+t 1, for t = 2. In order to classify such groups, we rst
consider the upper bound n (9m3)/2. In continue the groups which attains
the upper bound will be classied, that we use for the classication of permutation
groups with maximum degree n = 3m + 1. In [5] Praeger asked in Question 1.5
2010 Mathematics Subject Classication. 20B25.
Key words and phrases. Permutation group, bounded movement, orbits.
189
that the upper bound of || by 3m+t 1 is sharp for any values of t greater than
1. In this paper we will give positive partial answer to this question for t = 2 and
n = 3m+ 1. We note that for x R, x is the integer part of x.
THEOREM 1.1 Let G be a permutation group on a set with t( 3) orbits which
have no xed points in . Suppose further that m is a positive integer such that
move(G) = m and n = 3m+t 1. Then
I) n (9m3)/2, and the equality holds if and only if G is the semidirect product
of Z
13
and Z
3
with normal subgroup Z
13
.
2 EXAMPLES AND PRELIMINARIES
EXAMPLE 2.4. Let
1
= {1, ..., 13},
2
= {(1
, 2
, 3
)},
2
= {1
, 2
, 3
}, , Z
13
=
1...13 and Z
3
= (1
)(1
)(123)(456)(789)(101112). Then G := Z
13
Z
3
is
a permutation group on a set :=
1
3
of size 19, in which every 1 = g G
has constant movement 6. Therefore the permutation group G has 3 orbits and de-
gree 3m+ 1 = 19 with move(G) = 6.
3 THE PROOF OF THEOREM 1.1
To prove Theorem 1.1 we introduce the following notation:
r
3
:=number of G-orbits of length 3 on which G acts as Z
3
;
r
3
:=number of G-orbits of length 3 on which G acts as Sym(3);
and
r
2
:=number of G-orbits of length 2;
r
4
:=number of G-orbits of length 4;
s:=number of G-orbits of length 5.
The orbits are labelled accordingly: thus
1
,...,
r
3
are those of length 3 on which
G acts as Z
3
;
r
3
+1
,...,
r
3
+r
3
are those of length 3 on which G acts as Sym(3);
r
3
+r
3
+1
,...,
r
3
+r
3
+r
2
are those of length 2, etc. Dene t := r
3
+ r
3
+ r
2
+ r
4
+ s,
t
0
:= r
3
+ r
3
+ r
2
,
4
:=
t
0
+r
4
i=t
0
+1

i
, and
5
:=
t
i=t
0
+r
4
+1

i
and so || = n =
3r
3
+ 3r
3
+ 2r
2
+ 4r
4
+|
5
|.
190
With the above notation by [4, Lemma 3] we have
n <
9
2
m(
3
4
r
3
+
1
4
r
2
+
5
4
r
4
+
1
2
(|
5
| 3s)). (1)
With some simple calculation, the Inequality (1) can be simplied as n (9m3)/2.
The proof of the part (I) of Theorem 1.1 is complete now.
We now consider the maximum bound n = 3m+t 1, for t = 3, that is n = 3m+2.
Suppose that n = 3m + 2. Then we rst have the following lemma, which follows
easily by 2 > 3r
3
+r
2
+ 5r
4
+ 2(|
5
| 3s) 0.
LEMMA 3.1 If t = 3, then m 3.
Let
1
,
2
, ...,
t
be t orbits of G of lenghs n
1
, n
2
, ..., n
t
. Then by [6], we know
that if n
i
2, for i = 1, ..., t, then t 2m 1. Now if n
i
3, for i = 1, ..., t, then
t 2m2, and || t +3m2, which for t = 3, || 3m+1. Therefore if t = 3,
then || = 3m+2, it follows that whose if all n
i
3, then || = 3m+1, which is a
contradiction. So the exist r
2
= 0, such that G can be classied.
Now from the equality t := r
3
+ r
3
+ r
2
+ r
4
+ s = 2, it follows that there are only
the several possibilities:
Since t 2m 2, then m (t + 2)/2 therefore if t 3, then m 3. There-
fore || 11.
It follows easily from the above lemma and the equality n = || = 3r
3
+ 3r
3
+ 2r
2
+
4r
4
+|
5
| = 3m+ 2 that, the only six following cases will be remained:
(I) r
3
= r
3
= s = 1, r
4
= r
2
= 0,
(II) r
2
= r
4
= s = 1, r
3
= r
3
= 0,
(III) r
3
= 1, r
4
= 2, r
3
= r
2
= s = 0,
(IV) r
3
= 1, r
4
= 2, r
3
= r
4
= s = 0,
(V) r
4
= 1, s = 2, r
3
= r
3
= r
2
= 0,
(VI) s = 1, r
3
= 2, r
3
= r
2
= r
4
= 0,
(VII) s = 1, r
3
= 2, r
3
= r
2
= r
4
= 0,
191
In the cases (I) and (II), || is equal to 11 and so m is equal to 3. Therefore
in these cases n = 3m + 2 = (13m 4)/3 = 11. But it was proved that the no
group satisfying in this equality, since in this case m 4. In the cases (III) and
(IV), since r
4
= 2, therefore there are not any group whose satised in this cases.
In the cases (V) and (VI), || = 11, n = 6 +|
5
| = 3m+2. With respect to equality
|
5
| = 3m 4, it is easy to see that the movement m cannot be greater than 5. So
no group is not satises in this cases. We now show that case (VII) does not occur.
Suppose therefore that r
4
= 1, s = 2, r
3
= r
3
= r
2
= 0, so || is equal to 14 and
hence m is equal to 4. Suppose that :=
1

2

3
, in which
1
is orbit of
length 4 and
2
,
3
are two orbits of length 5. Then these three orbits of lengths
4, 5, 5 respectively must be appeared in the cycle representation of some elements.
Therefore move
(g) = move
1
(g
1
) +move
2
(g
2
) +move
3
(g
2
) = 2 +2 +2 = 6, for
some g G. Thus m = 6 and this proves that the case (VII) can not arises. Now
the proof of Theorem 1.1 is complete.
References
[1] M. Alaeiyan and S. Yoshiara, Permutation groups of minimal movement, Arch.
Math. 85 (2005), 211-226.
[2] J. R. Cho, P. S. Kim, and C. E. Praeger, The maximal number of orbits of a
permutation groups with bounded movement, J. Algebra 214 (1999), 625630.
[3] A. Hassani, M. Khayaty (Alaeiyan), E. I. Khukhro and C. E. Praeger, Transitive
permutation groups with bounded movement having maximal degree, J. Algebra
214 (1999), 317337.
[4] P. M. Neumann and C. E. Praeger, On the movement of a permutation group,
J. Algebra 214 (1999), 631635.
[5] C. E. Praeger, Movement and separation of subsets of points under group actions,
J. London Math. Soc. (2) 56 (1997), 519-528.
[6] C. E. Praeger, On permutation group with bounded movement, J. Algebra 144
(1991), 436442.
192
The 6
th
On minimal non PST-groups
Gholamreza Rezaeezadeh
1
and Zahra Aghajari
2
1
Department of Mathematics, Faculty of Sciences, Shahrekord University, Shahrekord,
Iran
2
Iran
Z.Aghajari@stu.sku.ac.ir
Abstract
A nite group G is said to be a PST-group if every subnor-
mal subgroup of G is S-permutable in G. In this paper, we
determinate if G be minimal non PST-group then the num-
ber of distinct prime divisor of |G| is two. In the end, a
theorem from Derek J. S. Robinson is brought that charac-
terized minimal non PST-groups.
1 Introduction
All group considered in this paper will be nite. A group G is said to be a T-group if
every subnormal subgroup of G is normal in G. A group G is said to be a PT-group
if every subnormal subgroup of G is permutable in G. A subgroup H of a group G
is said to be S-permutable (or S-quasinormal) in G if it permutes with every Sylow
subgroups of G. A group G is said to be a PST-group if every subnormal subgroup
of G is S-permutable in G.
The structure of solvable PST-group was determined by Agrawal; also A. Ballester-
Bolinches and R. Esteban-Romero[3].
if P is a property of group, a group G is said to be a minimal non P-group if
Speaker
Key words and phrases. Finite group, PST-group, Minimal non PST-group.
193
G does not have P but all its proper subgroups do. M. M. Al-mosa Al-shomrani [2]
determined the structure of minimal non-PT groups (non PT-groups all of its proper
subgroups are PT-groups) and Derek J. S. Robinson [5] characterised the structure
of minimal non-PST groups(non PST-groups all of its proper subgroups are PST-
groups).
In addition |(G)| will denote the number of distinct prime divisors of |G|.
2 Main results
Lemma 2.1. If a group G possesses three solvable PST-group whose indices are
pairwise relatively prime, then G is a solvable PST-group.
Lemma 2.2. Let G be a solvable group. If G is a minimal non PST-group, then
|(G)| = 2.
Lemma 2.3. If G is a minimal non PST-group, then |(G)| = 2.
Theorem 2.4. If G is a minimal non-PST-group, then it is one of the types de-
scribed in I to IV below. Let p and q be distinct primes.
TypeI : Let p and q be primes such that p 1 (mod q
f
) where q
f
> 1. let i be
the least positive primitive q
f
-th root of unity modulo p. Put j = 1 +kq
f1
where
0 < k < q. Dene
G
1
= X A
where X =< x > has order q
r
with r f, A =< a, b > is elementary abelian of
order p
2
, and a
x
= a
i
, b
x
= b
i
j
.
TypeII : Let p and q be distinct primes such that p 1 (mod q
f
). Let z be a
primitive q-th root of unity modulo p and denote by F the eld Z
p
(z). Dene
G
2
= X F
+
where X =< x > has order q
r
> 1 and x act on F
+
via multiplication by z.
TypeIII : Let p and q be primes such that p 1 (mod q), and write q
f
for the
highest power of q dividing p-1. Let A be an elementary abelian p-group with basis
{a
0
, a
1
, ..., a
q1
} and let X =< x > have order q
r
where r > f. Set i equal to the
least positive primitive q
f
-th root of unity modulo p. Dene
G
3
=< x > A
where a
x
i
= a
i+1
for 0 j < q 1 and a
x
q1
= a
i
0
.
TypeIV : G
4
= X Q where Q is a quaternion group of order 8, X =< x > has
194
order 3
r
and x permutes cyclically the three subgroups of Q with order 4.
TypeV : Let p and q be distinct primes such that the exponent of p modulo q
is even, say 2m. Let P be a (non-abelian) special p-group of rank 2m which can
be generated by elements of order p. Take X =< x > to have order q
r
> 1 and
let x induce an automorphism in P such that P/P is a simple Z
p
X-module and
[P, X] = 1. Dene
G
5
= X P.
References
[1] M. J. Alejandre, A. Ballester-Bolinches, and M. C. Pedraza-Aguilera. Finite
soluble groups with permutable subnormal subgroups.J. Algebra, 240(2001),705-
721 .
[2] M. M. Al-Mosa Al-Shomrani. On minimal non PT-groups. International Math-
ematical Forum, 3, 2008, no. 10, 495-501.
[3] A. Ballester-Bolinches and R. Esteban-Romero. On nite soluble groups in which
Sylow permutability is a transitive relation. Acta Math. Hungar., 101(3):193-202,
2003.
[4] D. J. S. Robinson, A course in the theory of groups, 2
nd
ed., Springer-Verlage,
New York, 1996.
[5] D. J. S. Robinson. Minimality and Sylow-permutability in locally nite groups.
Ukr. Math. J., 54(2002), 1038-1049.
195
The 6
th
The structure of SS-semipermutable groups
Gholamreza Rezaeezadeh
1
and Sayed Ebrahim Mirdamadi
2
1
Iran
2
Iran
ebrahimmirdamadi@stu.sku.ac.ir
Abstract
A subgroup H of a nite group G is said to be SS-
semipermutable in G if H has a supplement K in G such
that H permutes with every Sylow subgroup X of G such
that (|X|, |H|) = 1. The structure of SS-semipermutable
groups is investigated in this paper.
1 Introduction
Through in this paper all groups considered nite and for a group G, Let (G)
denotes the set of prime divisor of |G|. Given a nite group G, two subgroups H
and K are said to permute if HK = KH. A subgroup H of a group G is said to
be permutable (resp. S-permutable) in G if H permutes with all the subgroups (resp.
Sylow subgroups) of G. A group G is called a T-group(resp. PT-group, PST-group)
if normality (resp. permutability, S-permutability) is a transitive relation.
By [3], a group G is PST-group if anf only if every subnormal subgroup of G is
S-permutable in G. A subgroup H of a group G is said to be -quasinormal in G if
HG
p
= G
p
H for every G
p
Syl
p
(G) such that (|H|, p) = 1 and (|H|, |(G
p
)
G
|) = 1.
A subgroup H of a group G is said to be SS-permutable in G if H has a supplement
Speaker
Key words and phrases. PST-groups, SS-semipermutable groups.
196
K in G such that H permutes with every Sylow subgroup of K. In this case K is
called an SS-permutable supplement of H in G. Recall that a subgroup H of a group
G is said to be SS-semipermutable in G if H has a supplement K in G such that H
permutes with every Sylow subgroup X of K such that (|X|, |H|) = 1. In this case
K is called an SS-semipermutable supplement of H in G.
2 Main results
Lemma 2.1. Suppose that a subgroup H of a group G is SS-semipermutable in G
with an SS-semipermutable supplement K, L G and N G. Then
(1) If H L, then H is SS-semipermutable in G.
(2) If H is a p-group, Where p (G), then (HN)/N is SS-semipermutable in G/N.
(3) If N L and L/N is SS-semipermutable in G/N, then L is SS-semipermutable
in G.
(4) Every conjugate of K in G is SS-semipermutable supplement of H in G.
(5) If N is nilpotent, then NK is an SS-semipermutable supplement of H in G.
(6) If H is a p-subgroup, where p (G), and H F(G), then H is S-semipermutable
in G.
Note that F(G) denotes the Fitting subgroup of G.
Lemma 2.2. Let G be a group. Then every subgroup of F
(G) is -quasinormal
in G if and only if G is a solvable PST-group.
Note that F
(G) denotes the generalized Fitting subgroup of G. That is the product

of all normal quasinilpotent subgroup of G.
Lemma 2.3. Let T and S are SS-semipermutable in a solvable group G such that
(|T|, |S|) = 1. Then T, S is SS-semipermutable in G.
Theorem 2.4. Let G be a group. Then the following statement are equivalent:
(1) G is solvable and every subnormal subgroup of G is SS-semipermutable in G.
(2) Every subgroup of F
(G) is SS-semipermutable in G.
(3) G is a solvable PST-group.
Theorem 2.5. Let G be a group. Then the following statement are equivalent:
(1) Whenever H K are two p-subgroups of Gwith p (G), H is SS-semipermutable
in N
G
(K).
(2) G is a solvable PST-group.
197
References
[1] A. Ballester-Bolinches and R. Esteban-Romero. Sylow permutable subnormal
subgroups of nite groups. J. Algebra, 251:727-738, 2002.
[2] B. Huppert and N. Blackburn. Finite group III. Springer-Verlage,
Berline/Heidelberg, 1982.
[3] O. H. Kegel. Sylowgrouppen und subnormalteiler endlicher gruppen. Math. Z.
78:205-221. 1962.
[4] V. O. Lukyanenko and A. N. Skiba. On weakly -quasinormality is a transitive
relation. Rend. Semin. Math. Univ. Podova, 124:231-246, 2010.
[5] P. Shemid. Subgroup permutable with all Sylow subgroups. J. Algebra, 207:285-
293,1998.
198
The 6
th
Movement of permutation groups with two orbits
Mehdi Rezaei
Buein Zahra Technical University, Buein Zahra, Qazvin, Iran
m rezaei@bzte.ac.ir
Abstract
Let G be a permutation group with bounded movement,
move(G) = m. It was shown by Praeger that || 3m+t1,
where t is the number of G-orbits on . In this paper we
classify all permutation groups G with bounded movement
m attaining the maximum bound || = 3m + 1. Indeed, we
will give a positive partial answer to Praeger question that
whether the upper bound || = 3m+t1, is sharp for t > 1.
1 Introduction
Let G be a permutation group on a set with no xed points in and let m be a
positive integer. If for a subset of the size |
g
| is bounded, for g G, we
dene the movement of as
move() := sup
gG
|
g
|.
If move() m for all , then G is said to have bounded movement m and the
movement of G is dened as the
move(G) := sup
|
g
|.
This notion was introduced in [3, 6]. By [6, Theorem 1], if G has bounded movement
m, then is nite. Moreover both the number of G-orbits in and the length of
each G-orbit are bounded above by linear functions of m. In particular each G-orbit
2010 Mathematics Subject Classication. Primary 05C25; Secondary 20B25.
Key words and phrases. Intransitive permutation groups, orbits, bounded movement.
199
has length at most 3m, t 2m 1 and n := || 3m + t 1 5m 2, where t
is the number of G-orbits on . In [2] it was shown that n = 5m 2 if and only
if n = 3 and G is transitive. But in [4], this bound was rened further and it was
shown that n (9m3)/2. Moreover, if n = (9m3)/2 then either n = 3 and
G = S
3
or G is an elementary abelian 3-group and all its orbits have length 3. Also
this upper bound was improved to the bound n 4mp in [1, Theorem 1.1], where
p 5 is the least odd prime dividing |G|.
Throughout this paper m is a positive integer and G is an intransitive permutation
group on a set of size n = 3m+1 with movement m and t = 2 orbits. The purpose
of this paper is to classify all intransitive permutation groups of degree n = 3m+1.
In [5] Praeger asked in Question 1.5 that the upper bound of || by 3m + t 1 is
sharp for any values of t greater than 1. In this paper we will give positive partial
answer to this question for t = 2 and n = 3m + 1. We note that for x R, x is
the integer part of x and K H is a semi-direct product of K by H with normal
subgroup K.
2 Main results
Let 1 = g G and suppose that g in its disjoint cycle representation has t (t is a
positive integer) nontrivial cycles of lengths l
1
, ..., l
t
, say. We might represent g as
g = (a
1
a
2
...a
l
1
)(b
1
b
2
...b
l
2
)...(z
1
z
2
...z
lt
).
Let (g) denote a subset of consisting of l
i
/2 points from the i
th
cycle, for each
i, chosen in such a way that (g)
g
(g) = . For example, we could choose
(g) = {a
2
, a
4
, . . . , a
k
1
, b
2
, b
4
, . . . , b
k
2
, ..., z
2
, z
4
, . . . , z
kt
},
where k
i
= l
i
1 if l
i
is odd and k
i
= l
i
if l
i
is even. Note that (g) is not uniquely
determined as it depends on the way each cycle is written. For any set (g) of this
kind, we say that (g) consists of every second point of every cycle of g. From the
denition of (g) we see that
|(g)
g
\(g)| = |(g)| =
t
i=1
l
i
/2.
The next lemma shows that this quantity is an upper bound for |
g
\| for an arbitrary
subset of .
Lemma 2.1. Let G be a permutation group on a set and suppose that .
Then for each g G, |
g
\|
t
i=1
l
i
/2, where l
i
is the length of the i
th
cycle of
200
g and t is the number of nontrivial cycles of g in its disjoint cycle representation.
This upper bound is attained for = (g) dened above.
Let g be an element of a permutation group G on a set . Assume that the
set is the disjoint union of G-invariant sets
1
and
2
. Then every subset
of is a disjoint union of subsets
i
=
i
for i = 1, 2. Let g
i
be the permu-
tation on
i
induced by g for i = 1, 2. Since |
g
| = |
g
1
1

1
|+|
g
2
2

2
|, we have
move
(g) =
2
i=1
max{|
g
i
i
\
i
||
i

i
} = move
1
(g
1
) +move
2
(g
2
).
Now we introduce some examples of groups with bounded movement m satisfying
in || = 3m+ 1.
Example 2.2. Let G
1
:= Z
2
2
and G
2
:= Z
3
be permutation groups on the sets
1
= {1, 2, 3, 4} and
2
= {1
, 2
, 3
} respectively, where Z
2
2
=< (12)(34), (13)(24) >

and Z
3

=< (123)(1
) >. Set :=
1
2
. Then G := G
1
G
2
is a permutation
group on which has t = 2 orbits, and since each non-identity element of G has
two cycles of length 2 or two cycles of length 3, so m =move(G) = 2. It follows that
n = 3m+ 1 = 7.
Example 2.3. Let
1
= {1, ..., 7},
2
= {1
, 2
, 3
}, = (1...7) and = (1
)(235)(476).
Then G :=< , >
= Z
7
Z
3
is a permutation group with t = 2 orbits on a set
:=
1
2
of size 10, in which every 1 = g G has 3 cycles of size 3 or is a cycle of
size 7 and therefore in both cases have movement 3. It follows that n = 3m+1 = 10.
Theorem 2.4. Let G be a permutation group on a set with t( 2) orbits which
have no xed points in . Suppose further that m is a positive integer such that
move(G) = m and n = 3m + 1, which is the maximum bound for t = 2. Then G is
one of the following:
(a) G is the semidirect product of Z
2
2
and Z
3
2
2
.
(b) G is the semidirect product of Z
7
and Z
3
7
.
References
[1]
[2] M. Alaeiyan and S. Yoshiara, Permutation groups of minimal movement, Arch.
Math. 85 (2005), 211-226.
201
[3] J. R. Cho, P. S. Kim, and C. E. Praeger, The maximal number of orbits of a
permutation groups with bounded movement, J. Algebra. 214 (1999), 625-630.
[4] A. Hassani, M. Khayaty (Alaeiyan), E. I. Khukhro and C. E. Praeger, Transitive
permutation groups with bounded movement having maximal degree, J. Algebra.
214 (1999), 317-337.
[5] P. M. Neumann and C. E. Praeger, On the movement of a permutation group,
J. Algebra. 214 (1999), 631-635.
[6] C. E. Praeger, Movement and separation of subsets of points under group actions,
J. London Math. Soc. (2) 56 (1997), 519-528.
[7] C. E. Praeger, On permutation group with bounded movement, J. Algebra. 144
(1991), 436-442.
202
The 6
th
Irreducible characters and conjugacy classes in nite
groups
Sajjad Mahmood Robati
Department of Mathematics, Imam Khomeini International University, Qazvin, Iran
mahmoodrobati@sci.ikiu.ac.ir
Abstract
Let G be a nite group. If A and B are two conjugacy classes
in G, then AB is a union of conjugacy classes in G and
(AB) denotes the number of distinct conjugacy classes of
G contained in AB. If and are two complex irreducible
characters of G, then is a character of G and again we let
() be the number of irreducible characters of G appearing
as constituents of . In this paper our aim is to study the
product of conjugacy classes in a nite group and obtain an
upper bound for in general. Then we study similar results
related to the product of two irreducible characters.
1 Introduction
Let G be a nite group.For a G let Cl(a) = {g
1
ag|g G} denote the conjugacy
class of a in G. A subset X of G is called G-invariant if X
G
= {g
1
xg|x X, g
G} = X, and in this case X is the union of some conjugacy classes of G. By
denition (X) is the number of distinct conjugacy classes of G contained in G. If
Cl(a) and Cl(b) are two conjugacy classes of G, then it is clear that Cl(a)Cl(b) =
{a
x
b
y
|x, y G} is a G-invariant subset of G, hence Cl(a)Cl(b) contains at least one
conjugacy class of G, i.e. (Cl(a)Cl(b)) 1. If we know (AB) for some conjugacy
classes A and B of G, then we may ask about the structure of G as well as the
conjugacy classes A and B. Similar concept can be dened for complex characters of
2010 Mathematics Subject Classication. Primary 20E45, 20C15.
Key words and phrases. Conjugacy classes, irreducible characters, products.
203
a nite group G. By Irr(G) we mean the set of all the complex irreducible characters
of G. It is known that for any character of G we have =
k
i=1
m
i
i
, where
m
i
N and
i
Irr(G). The irreducible characters
i
are called the constituents
of and similar to the case of product of conjugacy classes we set () = k. In
particular if and are irreducible characters of G, then is a character of G,
hence () 1. Similar questions as in the case of conjugacy classes may be asked,
for instance if we know () for some irreducible characters and , then we may
ask about the structure of G as well as the irreducible characters and .
2 main theorems
For a nite group G it is important to nd the -function on the product of two
conjugacy classes of G. In [1], Adan-Bante shows that if G is a nite p-group and
a G and |Cl(a)| = p
n
, then (Cl(a)Cl(a
1
)) n(p 1) + 1. Let [a, G] be the set
of all commutators [a, g] = a
1
g
1
ag where g G. In [2], she proved the following
theorem about products of irreducible character of p-groups:
Theorem 2.1. Let G be a nite p-group, where p is a prime number.Let ,
Irr(G) be faithful characters. then either () = 1 or () (p + 1)/2.
Our rst result is the following:
Proposition 2.2. Let G be a nite group and a, b G and Cl(a)Cl(b) Z(G) = .
Then [a, G] is a subgroup of G if and only if |Cl(a)Cl(b)| = |Cl(a)|.
The next proposition is an analogue of the previous proposition in character
theory.
Proposition 2.3. Let G be a nite group and , Irr(G) with Irr()
Lin(G) = . Then vanishes on G Z(G) if and only if

=
G/Z(G)
, where
G/Z(G)
is the regular character of G/Z(G) and

(gZ(G)) := (g) for all g G.
Proposition 2.4. Let G be a nite group and a G and the order of a be an odd
number. Then [a, G] is a subgroup of G if and only if (Cl(a)Cl(a)) = 1.
At this point we prove the following Theorem which is an analogue of Proposition
2.4.
Theorem 2.5. Let G be a nite group of odd order and Irr(G). Then
vanishes on GZ() if and only if (
2
) = 1.
204
Theorem 2.6. Let G be a nite group and a, b G and [a, G] be a subset of Z(G).
Then
(i) If Cl(a)Cl(b) Z(G) = , then (Cl(a)Cl(b)) = |Cl(a)|;
(ii) If |Cl(a)| is an odd number, then (Cl(a)Cl(a)) = 1;
(iii) If |Cl(a)| is an even number, then (Cl(a)Cl(a)) = 2
n
(where n is the number
of cyclic direct factors in the decomposition of the Sylow 2-subgroup of [a, G]).
Concerning irreducible constituents of the square of an irreducible character the
following results are proved in [5].
Theorem 2.7. Let G be a nite group and , Irr(G) such that vanishes on
GZ(). Then
(i) If Lin(G) = , then ()) = |Irr(G/Z(G))|;
(ii) If (1) is an odd number, then (
2
) = 1.
3 Conjugacy calsses and Linear groups
If P is a Sylow p-subgroup of GL
4
(q), q = p
m
, p prime, then |P| = q
6
= p
6m
and in
[4] it is proved:
Theorem 3.1. If A and B denote two conjugacy classes of the group P, then
(AB) = 1, q, 2q 1 or q
2
+q 1.
If Q is a Sylow p-subgroup of SP
4
(q), q = p
m
, p prime, then |Q| = q
6
= p
6m
and
in [4] we have proved:
Theorem 3.2. If A and B denote two conjugacy classes of the group Q, then
(AB) = 1, q, 2q 1 or q
2
+q 1 if p is odd and (AB) = 1, q or q
2
if p = 2.
The following results are proved in [3] for GL
n
(q) and SL
n
(q).
Theorem 3.3. If A and B are non-scalar matrices in GL
n
(q), then (Cl(A)Cl(B))
q 1.
Theorem 3.4. If A and B are non-scalar matrices in SL
n
(q), then (Cl(A)Cl(B))
[q/2].
References
[1] E. Adan-Bante, Conjugacy classes and nite p-group, Arch.Math, 85,(2005),
297-303.
205
[2] E. Adan-Bante, Products of characters and nite p-groups II, Arch.Math, 82,
No4, (2004), 289-297.
[3] E. Adan-bante, J. M. Harris, On conjugacy classes of GL(n, q) and SL(n, q),
ArXive: 0904.2152v1.
[4] M. R. Darafsheh, S. M. Robati, Products of Conjugacy Classes in certain p-
groups, International Journal of Mathematics, Game Theory and Algebra, 22,
No3, (2013).
[5] M. R. Darafsheh, S. M. Robati, Products of Conjugacy Classes and Products of
Irreducible Characters in Finite Groups, Turk. J. Math., 37, (2013), 607-616.
206
The 6
th
The classication of some nilpotent Leibniz 4-algebras
Farshid Saeedi
1
and Seyyedeh Naseh Akbarossadat
2
1
Department of Mathematics, Islamic Azad University, Mashhad Branch, Mashhad, Iran
saeedi@mshdiaum.ac.ir
2
n.akbarossadat@gmail.com
Abstract
In this paper, we recall the denition of Leibniz n-algebras
and then classify the two steps strongly nilpotent Leibniz 4-
algebras with dimension 3.
1 Introduction
In 1993, Loday [1] introduced a non-skew-symmetric version of Lie algebras, the
so-called Leibniz algebras as follow
A Leibniz n-algebra is a vector space L over a eld F equipped with an n-ary
linear operation [, , . . . , ] : L
n
L satisfying in following identity, for all
x
1
, . . . , x
n
, y
2
, . . . , y
n
L
[[x
1
, x
2
, . . . , x
n
], y
2
, . . . , y
n
] =
n
i=1
[x
1
, . . . , x
i1
, [x
i
, y
2
, . . . , y
n
], x
i+1
, . . . , x
n
] (1)
If n = 2, L is called Leibniz algebra.
Then in 2006, S. Albeverio, B. A. Omirov and I. S. Rakhimov classied 4-
dimensional nilpotent Leibniz algebras.
Also, in 2002,[5] the n-ary version of Leibniz algebras was introduced, which is
Lie n-algebras, so that its bracket is symmetric. Also, it is Leibniz algebras when
n = 2. In [2] described the representations of Leibniz n-algebras by means of a uni-
versal enveloping algebra and established a PBW type theorem. Also, 3-dimensional
Speaker
2010 Mathematics Subject Classication. Primary 17A32; Secondary 17B30.
Key words and phrases. Leibniz n-algebra, nilpotent, strongly nilpotent.
207
strongly-nilpotent Leibniz 3-algebras and two-step nilpotent 3-dimensional Leibniz 3-
algebras over an algebraic closed eld of characteristic zero have been classied in
[4]. In fact they give eleven classes of nilpotent 3-dimensional Leibniz 3-algebras.
Now, our aim in this paper is the classication of some strongly nilpotent Leibniz
4-algebras which are introduced in next section.
Denition 1.1. A Leibniz n-algebra L is calleb nilpotent, if L
r
= 0 for some
r 0, where
L
0
= L & L
s+1
= [L
s
, L, . . . , L
. .
(n1)times
], s 0.
A nilpotent Leibniz n-algebra L is called two-step nilpotent, if L satises L
1
= 0
and L
2
= 0[4].
Abelian Leibniz n-algebras are the examples of nilpotent Leibniz n-algebras.
Denition 1.2. Let L be a Leibniz n-algebra and S L. Then S is said
subalgebra of L, if it satiss the following condition
[x
1
, x
2
, . . . , x
n
] S, x
1
, x
2
, . . . , x
n
S
Also, the subalgebra I of L is called an ideal, when we have [y, x
2
, . . . , x
n
] I,
for all y I and x
2
, . . . , x
n
L.
The subalgebra L
1
= [L, L, . . . , L
. .
ntimes
] generated by the elements [x
1
, x
2
, . . . , x
n
],
for each x
1
, x
2
, . . . , x
n
L, is called derived algebra of L. If L
1
= 0, then we say
that L is abelian Leibniz n-algebra.
2 Classication of Some Leibniz n-Algebras
In this section, we classify some m-dimensional nilpotent Leibniz n-algebras for m =
2, 3, 4.
Theorem 2.1. Let L be a 2-dimensional two-step nilpotent Leibniz 3-algebra with
basis {e
1
, e
2
}, and L
1
= Fe
1
. Then up to isomorphisms L is as following
[e
2
, e
1
, e
2
] = e
1
, [e
2
, e
2
, e
1
] = e
1
, [e
2
, e
2
, e
2
] = e
2
Theorem 2.2. [4] Let L be a 3-dimensional two-step nilpotent Leibniz 3-algebra
with basis e
1
, e
2
, e
3
, and L
1
= Fe
1
. Then up to isomorphisms one and only one of
the following possibilities holds:
208
1. [e
i
, e
j
, e
k
] =
ijk
e
1
,
ijk
F, 2 i, j, k 3, and at least one
ijk
= 0. The
Leibniz 3-algebra L
of case (3.4) with coecients
ijk
is isomorphic to L if
and only if there exists a matrix A =
_
a
22
a
23
a
32
a
33
_
such that det A = 0 and
ijk
=
l,t,s=2,3
a
il
a
jt
a
ks
lts
, 2 i, j, k 3. (2)
2.
_
_
_
[e
2
, e
1
, e
2
] = e
1
[e
2
, e
2
, e
1
] = e
1
[e
i
, e
j
, e
k
] =
ijk
e
1
where
ijk
F and 2 i, j, k 3.
Theorem 2.3. [4] Let L be a 3-dimensional two-step nilpotent Leibniz 3-algebra
with a basis {e
1
, e
2
, e
3
}, and dimL
1
= 2, then, up to isomorphisms, one and only
one of the following possibilities holds
(c
1
).
_
_
[e
3
, e
1
, e
3
] = e
1
[e
3
, e
2
, e
3
] =
1
e
2
[e
3
, e
3
, e
1
] = e
1

i
F, i = 1, 2, 3,
1
= 0.
[e
3
, e
3
, e
2
] =
1
e
2
[e
3
, e
3
, e
3
] =
2
e
1
+
3
e
2
(c
2
).
_
_
[e
3
, e
1
, e
3
] = e
1
[e
3
, e
2
, e
3
] = e
1
e
2
[e
3
, e
3
, e
1
] = e
1

i
F, i = 1, 2, 3.
[e
3
, e
3
, e
2
] = e
1
+e
2
[e
3
, e
3
, e
3
] =
1
e
1
+
2
e
2
(c
3
).
_
_
_
[e
3
, e
1
, e
3
] = e
2
[e
3
, e
3
, e
1
] = e
2
[e
3
, e
3
, e
3
] = e
1
.
(c
4
).
_
_
_
[e
3
, e
2
, e
3
] = e
2
[e
3
, e
3
, e
2
] = e
2
[e
3
, e
3
, e
3
] = e
1
+e
2
.
(c
5
).
_
_
_
[e
3
, e
2
, e
3
] = e
2
[e
3
, e
3
, e
2
] = e
2
[e
3
, e
3
, e
3
] = e
1
.
209
3 Classication of Some Nilpotent Leibniz 4-Algebras
Notation: Let L be a Leibniz 4-algebra. Denote [L, L
1
, L, L], [L, L, L
1
, L]
and [L, L, L, L
1
] with M
2
, M
3
and M
4
, respectively.
Proposition 3.1. Let L be a 3-dimensional two-step nilpotent Leibniz 4-algebra
with basis {e
1
, e
2
, e
3
}. Then M
i
= 0 if and only if M
j
+M
k
= 0, for i, j, k = 2, 3, 4
and i = j = k.
Theorem 3.2. Let L be a 3-dimensional two-step nilpotent Leibniz 4-algebra with
basis e
1
, e
2
, e
3
, and L
1
= Fe
1
. Then up to isomorphisms one and only one of the
following possibilities holds
1. If M
4
= 0, then the multiplication table of L is as follow
_
[e
i
, e
j
, e
k
, e
l
] =
ijkl
e
1
2 i, j, k, l 3
[e
i
, e
j
, e
1
, e
l
] = [e
i
, e
1
, e
j
, e
l
] 2 i l 3, 2 j 3
2. If M
4
= 0, then the these conditions are hold
_
_
[e
i
, e
1
, e
1
, e
1
] = 0, 2 i 3
[e
1
, e
j
, e
k
, e
l
] = 0, 1 j, k, l 3
i11l
=
i1l1
=
il11
, 2 i, l 3
ijj1
+
i1jj
+
ij1j
= 0, 2 i, j 3
i123
+
i132
+
i213
+
i231
+
i321
+
i312
= 0, 2 i 3
4 Classication of Some Strongly Nilpotent Leibniz 4-
Algebras
Let L be a Leibniz n-algebra. L is called s-step strongly nilpotent, if there exist
s = 0 such that L
s
= 0 and L
s1
= 0, where
L
0
= L & L
i
=
n
j=1
[L, ..., L
. .
j1times
, L
i1
, L, ..., L]
Proposition 4.1. Every strongly nilpotent Leibniz n-algebra is nilpotent.
Theorem 4.2. Let L be a 2-step strongly nilpotent Leibniz 4-algebra with dimen-
sion 3 and basis {e
1
, e
2
, e
3
}. Then the conditions in Theorem ?? are hold.
210
Theorem 4.3. Let L be a 3-dimensional strongly nilpotent Leibniz 4-algebra with
basis {e
1
, e
2
, e
3
} such that dimL
1
= 2. Then L is one of the following (up to the
isomorphism)
(A) :
[e
3
, e
2
, e
3
, e
3
] = e
1
, [e
3
, e
3
, e
3
, e
3
] = e
1
,
[e
3
, e
3
, e
3
, e
2
] = ( +)e
1
, [e
3
, e
3
, e
3
, e
3
] = e
2
(B) :
[e
2
, e
3
, e
3
, e
3
] = e
1
, [e
3
, e
3
, e
2
, e
3
] = e
1
, [e
3
, e
3
, e
3
, e
2
] = e
1
,
[e
3
, e
3
, e
3
, e
3
] = e
2
(C) : [e
2
, e
3
, e
3
, e
3
] = e
1
, [e
3
, e
3
, e
3
, e
3
] = e
2
(D) : [e
3
, e
3
, e
2
, e
3
] = e
1
, [e
3
, e
3
, e
3
, e
2
] = e
1
, [e
3
, e
3
, e
3
, e
3
] = e
2
Acknowledgement
Acknowledgements could be placed at the end of the text but precede the references.
References
[1] J. M. Casas, J. L. Loday and T. Pirashvili, Leibniz n-algebras, Forum Math,
14, (2002), 189-207.
[2] J. Casas, M. Insua and M. Ladra, Poincare-Birkho-Witt theorem for Leibniz
n-algebras, J. Symbolic Comput., 42, (2007), 1052-1065.
[3] J. L. Loday, Une version non commutative des algebres de Lie: Les algebres de
Leibniz, Enseign Math, 3, (1993), 269-293.
[4] B. Ruipu and Z. Jie, The Classication of Nilpotent Leibniz 3-Algebras,Acta
Mathematica scientia, 31B(5), (2011), 1997-2006.
211
The 6
th
Finite groups with a given number of relative
centralizers
F. Saeedi
1
and M. Farrokhi D. G.
2
1
Department of Mathematics, Islamic Azad University, Mashhad Branch, Mashhad, Iran
saeedi@mshdiau.ac.ir
2
m.farrokhi.d.g@gmail.com
Abstract
We will study all nite groups and their subgroups with at
most four relative centralizers.
1 Introduction
Counting centralizers in nite groups was initiated by Belcastro and Sherman [4]
in 1994 by characterizing all nite groups with at most 5 centralizers. Let Cent(G)
denotes the set of all centralizers of elements of a groups G and cent(G) be the size of
Cent(G). Belcastro and Sherman proved that cent(G) = 1 if and only if G is abelian
and that there is no nite groups with 2 or 3 centralizers. In addition, cent(G) = 4
if and only if G/Z(G)

= Z
2
Z
2
and cent(G) = 5 if and only if G/Z(G)

= Z
3
Z
3
or S
3
. Later, Ashra [2, 3] proved that a group G with cent(G) = 6 must satisfy
G/Z(G)

= D
8
, A
4
, Z
2
Z
2
Z
2
or Z
2
Z
2
Z
2
Z
2
. Moreover, if G/Z(G)

= A
4
,
then cent(G) = 6 or 8. ( see also [1])
Let G be a nite group and H be a subgroup of G. A relative centralizer with
respect to G and H is a centralizer of the form C
G
(h) or C
H
(g), where g G and
h H. The set of all relative centralizers of H in G is dened as
Cent
G
(H) = {C
G
(h) : h H}
Speaker
2010 Mathematics Subject Classication. Primary 20F99; Secondary 20D99.
Key words and phrases. Centralizer, relative centralizer, cover, eccentralizerity, equicentralizer.
212
and the set of all relative centralizers of G in H is dened similarly as
Cent
H
(G) = {C
H
(g) : g G}.
Let cent
G
(H) and cent
H
(G) denote the size of the sets Cent
G
(H) and Cent
H
(G),
respectively. Clearly, Cent
G
(H) = Cent
H
(G) = Cent(G), whenever H = G. The
aim of this paper is to study those nite groups and their subgroups which admit
few relative centralizers. Despite the fact that the central factor of nite groups with
a given number of centralizers have nitely many possible structures, there is no
specic structural result for nite groups and their subgroups with a given number
relative centralizers. Hence, we shall study the two sets Cent
G
(H) and Cent
H
(G) of
relative centralizers and their relationships. In sections 2 and 3, we show that for
n 3, the conditions cent
G
(H) = n and cent
H
(G) = n on a nite group G and its
subgroups H are equivalent. Also, we show that if cent
G
(H) = 4, then cent
H
(G) = 4
or 5, and if cent
H
(G) = 4, then cent
G
(H) = 4 or 5. Some examples presented to
support each case in our theorems.
In the last section, we shall prove that the quantity cent
H
(G) cent
G
(H) can
take any integer value when G ranges over all nite groups and H ranges over
all subgroups of G. However, our computations indicates that probably the above
quantity is under control of both numbers cent
H
(G) and cent
G
(H), that is,
cent
H
(G) cent
H
(G) cent
G
(H) cent
G
(H).
2 main results
In this section, we obtain connections between two quantities cent
G
(H) and cent
H
(G)
for a nite group G and its subgroup H when they take small values. Clearly, if H
is a central subgroup of G, then Cent
G
(H) = {G} and Cent
H
(G) = {H}. Hence,
the following result follows easily.
Theorem 2.1. Let G be a nite group and H be a subgroup of G. Then cent
G
(H) =
1 if and only if cent
H
(G) = 1. In this case, H Z(G), Cent
G
(H) = {G} and
Cent
H
(G) = {H}.
G
(H) =
H
(G) = 2. In this case, H is abelian, Cent
G
(H) = {G, C
G
(H)}
and Cent
H
(G) = {H, H Z(G)}.
G
(H) =
H
(G) = 3. In this case, H is abelian, Cent
G
(H) = {G, P, C
G
(H)}
and Cent
H
(G) = {H, K, H Z(G)}, where C
G
(H) < P < G, H Z(G) < K < H,
P = C
G
(K) and K = C
H
(P).
213
Theorem 2.4. Let G be a nite group and H be a subgroup of G. Then
(i) if cent
G
(H) = 4, then
(i) Cent
G
(H) = {G, P, Q, C
G
(H)}, H is an abelian group, Cent
H
(G) =
{H, C
H
(Q), C
H
(P), H Z(G)} and cent
H
(G) = 4, or
(ii) Cent
G
(H) = {G, P, Q, R}, where P, Q, R = C
G
(H), P Q = Q R =
R P = P Q R = C
G
(H), H/H Z(G)

= Z
2
Z
2
, and
(i) G = PQR, Cent
H
(G) = {H, C
H
(R), C
H
(Q), C
H
(P)} and cent
H
(G) =
4,
(ii) G = P Q R,
Cent
H
(G) = {H, C
H
(R), C
H
(Q), C
H
(P), H Z(G)}
and cent
H
(G) = 5
(ii) if cent
H
(G) = 4, then
(i) Cent
H
(G) = {H, K, L, H Z(G)}, H is an abelian group, Cent
G
(H) =
{G, C
G
(L), C
G
(K), C
G
(H)} and cent
G
(H) = 4, or
(ii) Cent
H
(G) = {H, K, L, M}, where K, L, M = H Z(G), H is abelian,
H/H Z(G)

= Z
2
Z
2
, or H/H Z(G)

= Z
2
Z
2
Z
2
and H/Z(H)

=
Z
2
Z
2
, and
(i) H = K L M,
Cent
G
(H) = {G, C
G
(M), C
G
(L), C
G
(K)}
and cent
G
(H) = 4, or
(ii) H = K L M,
K L = L M = M K9 = K L M = H Z(G),
Cent
G
(H) = {G, C
G
(M), C
G
(L), C
G
(K), C
G
(H)} and cent
G
(H) = 5.
Now, we present some examples which supports Theorems 2.1, 2.2, 2.3 and 2.4.
Example 2.5. Let G = x, y : x
p
m
= y
p
n
= 1, x
y
= x
p
mk
+1
, where k 0, m > k,
n k and p is a prime. If H = x, then Cent
G
(H) = {G, HG
p
, . . . , HG
p
k
} and
Cent
H
(G) = {H, H
p
, . . . , H
p
k
}. Therefore, cent
G
(H) = cent
H
(G) = k + 1.
The above example when k = 0, 1, 2, 3 provides pairs of groups satisfying Theo-
rems 2.1, 2.2, 2.3 and 2.4(i.i and ii.i), respectively.
The following example gives another pair of groups with two relative centralizers.
214
Example 2.6. Let Gbe a Frobenius group with abelian kernel H. Then Cent
G
(H) =
{G, H} and Cent
H
(G) = {H, 1}.
Example 2.7. Let G = HK be the central product of two groups H and K, where
H/Z(G)

= Z
2
Z
2
. Then cent
G
(H) = cent
H
(G) = 4 and G, H satisfy Theorem
2.4(i.ii.i and ii.ii.i).
Example 2.8. Let n 4 and
G = x, y, z : x
2
n
= y
2
= z
2
= 1, x
y
= x
2
n2
+1
, x
z
= x
1
y, y
z
= x
2
n1
y.
If H = x
2
n1
, yz

= Q
8
and K = x
2
, y

= Z
2
n1 Z
2
, then
Cent
G
(H) =
_
G, x, y, x
2
n1
y, yz, x
2
n1
yz, y
_
,
Cent
H
(G) =
_
H, x
2
n2
, yz, x
2
n2
yz, x
2
n1
_
,
Cent
G
(K) =
_
G, x, y, x
2
, y, z, x
2
, y, xz, x
2
, y
_
,
Cent
K
(G) =
_
K, x
2
, x
2
n2
y, x
2
n1
, y
_
.
In particular, cent
G
(H) = 4, cent
H
(G) = 5, cent
G
(K) = 5, cent
K
(G) = 4. Hence,
G, H satisfy Theorem 2.4(i.ii.ii) and G, K satisfy Theorem 2.4(ii.ii.ii).
3 Further results and problems
In this section, we shall obtain some more results and show that the dierence be-
tween two numbers cent
G
(H) and cent
H
(G) can take any integer value, where G is
a nite group and H is a subgroup of G.
Denition 3.1. Let G be a nite group and H be a subgroup of G. Then G and
H are said to be equicentralizers if cent
G
(H) = cent
H
(G). The eccentralizerity of G
and H is dened by (G, H) = cent
H
(G) cent
G
(H).
Theorem 3.2. Let Rdenotes the set of all eccentralizerity (G, H), where G ranges
over all nite groups and H ranges over all subgroups of G. Then R = Z.
We conclude this section with some open questions.
Conjecture 3.3. Let G be a nite group and H be a subgroup of G. Then
cent
G
(H) 2cent
H
(G) and cent
H
(G) 2cent
G
(H).
215
Conjecture 3.4. Let Q be the set of all quotients cent
G
(H)/cent
H
(G), where G
ranges over all nite groups and H ranges over all subgroups of G. Then Q is a
dense subset of [
1
2
, 2].
Conjecture 3.5. For all integers m, n with m 1 and 0 n max{0, m5}, there
exist nite groups G
i
with H
i
(i = 1, 2), respectively, such that cent
G
1
(H
1
) = m and
cent
H
1
(G
1
) = m+n, cent
G
2
(H
2
) = m+n and cent
H
2
(G
2
) = m.
Question 3.6. Which nite groups are equicentralizer with all of their subgroups?
In particular, is it true that all nite groups equicentralizer with all of their subgroups
are solvable?
Denition 3.7. Let RelCent(G) be the set of all ordered pairs (cent
G
(H), cent
H
(G)) for all group G, where H ranges over all subgroups of G. A ca-
pable group G = H/Z(H) is said to be characterizable by its relative centralizers if
K/Z(K)

= G whenever K is a group such that RelCent(K) = RelCent(H).
By Theorem 2.4, one can easily see that the group Z
2
Z
2
is characterizable by
its relative centralizers. This fact suggest us to pose the following conjectures.
Conjecture 3.8. The alternating group A
4
is characterizable by its relative cen-
tralizers.
Question 3.9. Are there innitely many nite groups characterizable by their rel-
ative centralizers?
References
[1] A. Abdollahi, S. M. Jafarian Amiri and A. Mohammadi Hassanabadi, Groups
with specic number of centralizers, Houston J. Math. 33(1) (2007), 4357.
[2] A. R. Ashra, On nite groups with a given number of centralizers, Algebra
Colloquium 7(2) (2000), 139146.
[3] A. R. Ashra, Counting the centralizers of some nite groups, Korean J. Com-
put. & Appl. Math. 7(1) (2000), 115124.
[4] S. M. Belcastro and G. J. Sherman, Counting centralizers in nite groups, Math.
Mag. 5 (1994), 366374.
216
The 6
th
Cellular Automata and its application in group theory
Hesam Safa
Department of Mathematics, Faculty of Basic Sciences, University of Bojnord, Bojnord,
Iran
h.safa@ub.ac.ir
Abstract
In this paper, we show how applying linear cellular automata
on elements of nite permutation p-groups creates interest-
ing patterns when the group elements are sorted by their lexi-
cographic ordering. In particular, we investigate the relation
between these patterns and group structures.
1 Introduction
Cellular automata (CA) are well known for their applications in the natural (e.g.,
biology, physics) and social sciences (e.g., population dynamics). They have also
been used as processing machines able to carry on abstract tasks, such as learning
and image rendering. In this paper, we propose a new use for CA in the context
of group theory as a mean to explore the properties of permutation p-groups. We
nd that, through simple rules, a cellular automaton is able to reveal numerous
structural features of the permutation group on which it operates. As simple rules
already display important links between the cellular automaton and the structure
(e.g., number of cycles, size of the largest cycle), there is a strong potential to apply
other rules and carry on a similar analysis of patterns in order to reveal additional
properties.
A cellular automaton (CA) describes a discrete space in which each element is
referred to as a cell. A state is assigned to each cell. As the CA evolves over
time, the state of each cell changes according to three fundamental features: all cells
are updated simultaneously (synchronicity) by the same rules (uniformity), and these
2010 Mathematics Subject Classication. Primary 20B40; Secondary 68Q80, 20B05.
Key words and phrases. Cellular Automata, Group theory, Lexicographic ordering.
217
rules can take into account the states of neighbor cells (locality). In this paper we use
a 1-dimensional cellular automaton (CA), also called a linear cellular automaton.
Intuitively, this means that the discrete space can be seen as a 1-dimensional array.
Cells are then commonly seen as squares. We consider periodic CAs, which are
intuitively thought of as a torus or a wrap because the previous neighbor of the rst
cell is the last cell. From here on, all denitions as well as the short notation CA
refer specically to the 1-dimensional case. A CA is formally dened below.
Denition 1.1. A cellular automaton A is a triple (S, N, ) where:
a) S is a nite set, the elements of which are the states of A,
b) each cell is identied by its coordinate in a set N,
c) is the local transition function or local rule of A.
We denote by c
i
(t) the state of a cell i N at time t. The computation of the
new state c
i
(t + 1) for a given cell i uses the local rule, which can be based on the
cells previous state c
i
(t) as well as states of neighbor cells. Thus, in the most general
sense, the local rule is formally dened by c
i
(t+1) = (c
j
(t), . . . , c
i
(t), . . . , c
k
(t)) S,
j < i < k N, where j denotes the leftmost cell and k the rightmost cell. Note that
the state obtained at time t +1 can only use information available at time t and not
earlier. This is a rst order automaton, as it goes back one step in time. In this
paper, we use a symmetric local rule. Intuitively, the rule uses the state of as many
cells before as after i. This is formalized in the following denition.
Denition 1.2. (c
j
(t), . . . , c
i
(t), . . . , c
k
(t)) is symmetric if and only if |i j| =
|i k|. This dierence represents the number of cells used on each side, and is
known as the radius of .
We are interested in using a CA to investigate the behaviour of a group G. By
A
G
, we denote the CA in which the states are the permutations of G, and |N| |G|.
Permutations can be ordered using a ranking which assigns a unique number to
each permutation. To determine the initial state of the CA, the permutations of
G are ordered by lexicographic order [6]. Then, the rst cell of the CA contains
the permutation whose ranking by lexicographic order is 1, and so on. Applying
lexicographic ordering is a key part of our method: if the permutations are ordered
dierently, then we do not observe the patterns analyzed in this paper.
Also, a row or a state is said to be a xed point, if applying the rule again leaves
the states unchanged. In this paper, the types of rules that we apply and the fact
that the elements are initially ordered using lexicographic ordering always results in a
space-time diagram reaching a xed point. The next Section explores the conditions
such that a xed point is obtained and how obtaining this xed point depends on the
group structure. The xed point that we use to nd structural properties consists of
all cells having 1 as their state, which we denote by 1.
218
2 Main results
Theorem 2.1. Let p be a prime and G be an abelian p-group. Suppose that the
update function of the CA, A
G
is given by
c
i
(t + 1) = [c
ir
(t), . . . , c
i1
(t), c
i
(t), c
i+1
(t), . . . , c
i+r
(t)]
= c
ir
(t) c
i1
(t) c
i
(t) c
i+1
(t) c
i+r
(t).
for some radius r. If p = 2r + 1 is odd, then 1 is a xed point for any initial
conguration.
Conjecture. We strongly believe that the above theorem is true for every p-
group.
Acknowledgement
I would like to thank Prof. Vahid Dabbaghian and the IRMACS centre, Simon Fraser
University, Canada, for the support received during my sabbatical stay in 2012.
References
[1] V. Dabbaghian and P. J. Giabbanelli, Investigating p-groups Using Cellular Au-
tomata, Discrete Mathematics, Algorithms and Applications, (to appear).
[2] M. Mares and M. Straka, Linear-time ranking of permutations, in Proceedings
of the 15th Annual European Symposium on Algorithms, eds. M. Homann and
E. Welszl (Springer-Verlag, 2007), 187193.
219
The 6
th
On t-extensions of abelian groups
Hossein Sahleh
1
and Ali Akbar Alijani
2
1
Department of Mathematics, Faculty of Sciences, Guilan University, Rasht, Iran
sahleh@guilan.ac.ir
2
Department of Mathematics, Faculty of Sciences, Guilan University, Rasht, Iran
taleshalijan@phd.guilan.ac.ir
Abstract
Let A,B and C be abelian groups and tA, tB and tC the
maximal torsion subgroups of A,B and C respectively. An
extension 0 A B C 0 is called a t-extension
if 0 tA tB tC 0 is an exact sequence. In this
paper, we show that the set of all t-extensions of A by C
is a subgroup of Ext(C, A) which contains Pext(C, A), the
subgroup of all pure extensions of A by C.
1 Introduction
Let denote the category of abelian groups with homomorphisms as morphisms. For
the groups A and C in , we let Ext(C, A) denote the group of extensions of A by
C [1]. The elements represented by pure extensions of A by C form a subgroup of
Ext(C, A) which is denoted by Pext(C, A). For group A, tA denote the maximal
torsion subgroup of A. An extension 0 A

B

C 0 will be called t-
extension if 0 tA

tB

tC 0 is an extension. Let Ext
t
(C, A) denote the
set of elements in Ext(C, A) represented by t-extensions. In this paper, we show that
Ext
t
(C, A) is a subgroup of Ext(C, A) containing Pext(C, A). We now lay down
some notation and terminology to be used throughout the paper.
Speaker
2010 Mathematics Subject Classication. Primary 20K35; Secondary 20K27.
Key words and phrases. Abelian groups, extensions, pure extensions.
220
Denition 1.1. A sequence of groups A,B and C and homomorphisms and
0 A

B

C 0
is called exact if is monic, epic and Im = Ker.
Denition 1.2. Let A and C be two groups and E
1
: 0 A

1
B
1
1
C 0
and E
2
: 0 A

2
B
2
2
C 0 two t-extensions of A by C. Then the extension
E
1
E
2
is dened as follows:
0 A
A
(
1
2
)
B
1
B
2
(
1
2
)
C
C 0
Denition 1.3. Let E : 0 A

1
B

1
C 0 and E
: 0 A

2
X

2
C 0
be two extensions of A by C. E and E
are said to be equivalent if there is an

isomorphism : B X such that the following diagram
0
//
A
1
//
1
A
1
//
C
//
1
C
0
0
//
A
2
//
X
2
//
C
//
0
is commutative.

B

C 0 be an extension and : A A
a morphism. Then E : 0 A
C 0 where B
= (A
B)/N,N =
{((a), (a)) : a A},
(a
) = (a
, 0)+N and
((a
, b)+N) = (b). The extension

E is called a pushout of E.

B

C 0 be an extension and : C
C
a morphism. Then E : 0 A

0 where B
= {(b, c
) : b B, c
, (b) = (c
)},
(a) = ((a), 0) and
((b, c
)) = c
. The extension E is called a

pullback of E.
For each extension E of A by C, let [E] denote the class of all extensions E
of
A by C such that E
is equivalent to E.
Theorem 1.6. Let A and C be two groups. Then, the class Ext(C, A) of all
equivalence classes of extensions of A by C is an abelian group with respect to the
operation dened by
[E
1
] + [E
2
] = [
A
(E
1
E
2
)
C
]
where E
1
and E
2
are extensions of A by C and
A
: A A A,
A
(a
1
, a
2
) =
a
1
+ a
2
and
C
: C C
C,
C
(c) = (c, c) are the diagonal and codiagonal
homomorphism, respectively.
221
Proof. See [1].
Denition 1.7. A subgroup A of a group B is said to be a pure subgroup of B if
and only if nA = A nB for each positive integer n.
Denition 1.8. An extension 0 A

B

C 0 is called pure extension if
(A) is pure in B.
Remark 1.9. The set of all pure extensions of A by C denote by Pext(C, A) which
is a subgroup of Ext(C, A).
Denition 1.10. An extension of A by C is called split if it is equivalent to the
trivial extension 0 A

1
A
C

2
C 0 where
1
(a) = (a, 0) and
2
(a, c) = c
for all a A and c C.
Remark 1.11. Let A and C be two groups. Then Ext(C, A) = 0 if and only if
every extension of A by C splits.
Denition 1.12. A group A is called cotorsion if Ext(Q, A) = 0 where Q is the
group of rationales.
2 Main results
Denition 2.1. Let A,B and C be abelian groups. An extension 0 A

B

C 0 is called a t-extension if 0 tA

tB

tC 0 is an extension.
Lemma 2.2. A pushout of a t-extension is t-extension. A pullback of a t-extension
is t-extension.
Lemma 2.3. An extension equivalent to a t-extension is t-extension.
Theorem 2.4. Let A and C be two groups. Then, the class Ext
t
(C, A) of all
equivalence classes of t-extensions of A by C is an subgroup of Ext(C, A) with
respect to the operation dened by
[E
1
] + [E
2
] = [
A
(E
1
E
2
)
C
]
where E
1
and E
2
are t-extensions of A by C and
A
and
C
are the diagonal and
codiagonal homomorphisms,respectively.
Theorem 2.5. Let A and C be two groups. Then, Pext(C, A) Ext
t
(C, A).
Lemma 2.6. Let Abe a torsion-free group and C a torsion group. Then Ext
t
(C, A) =
0.
222
Corollary 2.7. Let A be a torsion-free group and C a torsion group. Then
Pext(C, A) = 0.
Theorem 2.8. Let A be a group. Then, Ext
t
(C, A) = 0 for every group C if
and only if A

= B
D where B is a torsion divisible group and D a torsion-free

cotorsion group.
Theorem 2.9. Let C be a group. Then, Ext
t
(C, A) = 0 for every group A if and
only if C is a free group.
References
[1] L. Fuchs, Innite Abelian Groups, Vol. I, Academic Press, New York, 1970.
223
The 6
th
OD-characterization of almost simple groups related to
L
2
(p
2
)
Masoumeh Sajjadi
1
, Masoumeh Bibak
2
and Gholamreza Rezaeezadeh
3
1,2
Department of Mathematics, Payame Noor University, Iran
masa.irsh@gmail.com, m.bibak62@gmail.com
3
Department of Mathematics, Faculty of Basic Science, Shahrekord University,
Shahrekord, Iran
Abstract
A group G is an almost simple group, if S G Aut(S),
for some non-abelian group S. In many articles it has
been shown that many nite almost simple groups are OD-
characterizable or k-fold OD-characterizable for certain k
2. In this paper we denote L
2
(p
2
) by L
p
, and we characterize
almost simple groups related to L
p
by the order and degree
pattern. In fact by Theorem 2.1 we prove that L
p
, L
p
: 2
1
,
L
p
: 2
2
and L
p
: 2
3
are OD-characterizable, and L
p
: 2
2
is 9-fold OD-characterizable, where p is a prime belongs to
{5, 11, 13, 17}.
1 Introduction
Throughout this article, all groups under consideration are nite. For any group
G, we denote by (G) the set of all prime devisors of |G| and the set of orders of
the elements of G is denoted by
e
(G). The prime graph (G) of a group G is a
simple graph whose vertex set is (G) and two distinct primes p and q are joined
by an edge if and only if G contains an element of order pq. For p (G), we put
Speaker
2010 Mathematics Subject Classication. Primary 20D05; Secondary 20D06, 20D60.
Key words and phrases. Almost simple group, Prime graph, Degree pattern.
224
deg(p) := |{q (G)|p q}|, which is called the degree of p. If |G| = p
1
1
p
2
2
...p
k
k
,
p
,
i
s dierent primes, we dene D(G) := (deg(p
1
), deg(p
2
), ..., deg(p
k
)), where p
1
<
p
2
< ... < p
k
, which is called the degree pattern of G.
Denition 1.1. The group G is called k-fold OD-characterizable if there exist ex-
actly k non-isomorphic groups H satisfying conditions |G| = |H| and D(G) = D(H).
In particular, a 1-fold OD-characterizable group is simply called OD-characterizable.
The interest in characterizing nite groups by degree pattern started in 2005 by
M.R. Darafsheh,et.al., that the authors proved that if G is a nite group such that
|G| = |M| and D(G) = D(M), where M is one of the following simple groups: (1)
sporadic simple groups, (2) alternating A
p
with p and p 2 primes, (3) some simple
groups of Lie type, then G

= M.
A group G is an almost simple group, if S G Aut(S), for some non-abelian
group S. In many articles it has been shown that many nite almost simple groups
are OD-characterizable or k-fold OD-characterizable for certain k 2, see [1, 2, 3,
4, 5].
In [1], for U := U
3
(17), it is shown that nite almost simple groups U and
U : 2 are OD-characterizable, U : 3 is 3-fold OD-characterizable, and U : S
3
is
5-fold OD-characterizable and in [3], for L := L
2
(49), it is shown that nite almost
simple groups L, L : 2
1
, L : 2
2
and L : 2
3
are OD-characterizable; L : 2
2
is 9-fold
OD-characterizable( 2
2
is the Klein
,
s four group).
In this article our main aim is to show the recognizability of the almost simple
groups related to L
p
:= L
2
(p
2
) by the degree pattern in the prime graph and the order
of the groups. By using Theorem 3.1 in [5], L
p
is OD-characterizable, so in this
paper we investigate the remainder cases.
2 Main results
Theorem 2.1. Let M be an almost simple group related to L
p
= L
2
(p
2
). If G is a
nite group such that D(G) = D(M) and |G| = |M|, then the following assertions
hold:
(a) If M = L
p
, then G

= L
p
;
(b) If M = L
p
: 2
1
, then G

= L
p
: 2
1
;
(c) If M = L
p
: 2
2
, then G

= L
p
: 2
2
;
(d) If M = L
p
: 2
3
, then G

= L
p
: 2
3
(e) If M = L
p
: 2
2
, then G

= L
p
: 2
2
, Z
2
(L
p
: 2
1
), Z
2
(L
p
: 2
2
), Z
2
(L
p
:
2
3
), Z
2
(L
p
: 2
1
), Z
2
(L
p
: 2
2
), Z
2
(L
p
: 2
3
), Z
4
L
p
or (Z
2
Z
2
) L
p
.
Conjecture Let M be an almost simple group related to L = L
2
(p
2
), where
p 5 is a prime. If G is a nite group such that D(G) = D(M) and |G| = |M|,
225
then L, L : 2
1
, L : 2
2
and L : 2
3
are OD-characterizable and L : 2
2
is 9-fold OD-
characterizable.
References
[1] M.R. Darafsheh, G.R. Rezaeezadeh, M. Sajjadi and M. Bibak, OD-
Characterization of almost simple groups related to U
3
(17), Quasigroups and
related Systems. 21 (2013), 4958.
[2] G.R. Rezaeezadeh, M.R. Darafsheh, M. Sajjadi and M. Bibak, OD-
Characterization of almost simple groups related to L
3
(25), Accepted in Bull.
Iranian Math. Soc.
[3] L.C. Zhang and W.J. Shi, OD-Characterization of almost simple groups related
to L
2
(49), Archivum Mathematicum. Masaryk Univ., Brno. 44 (2008), 191199.
[4] L.C. Zhang and W.J. Shi, OD-Characterization of almost simple groups related
to U
3
(5), Acta Mathematica Sinica, English Series. 26 (2010), no. 1, 161168 .
[5] L.C. Zhang and W.J. Shi, OD-Characterization of Projective Special Linear
Groups L
2
(q), Algebra Colloquium. 19 (2012), no 3, 509524.
226
The 6
th
A new characterization of A
p
where p and p 2 are
twin primes
Seyed Sadegh Salehi Amiri
Department of Mathematics, Babol Branch, Islamic Azad University, Babol, Iran
salehisss@baboliau.ac.ir
Abstract
Let G be a nite group and
e
(G) be the set of elements of
order G. Let k
e
(G) and m
k
be the number of elements
of order k in G. Set nse(G):={m
k
|k
e
(G)}. Assume p
and p 2 are twin primes. We prove that if G is a group
such that nse(G)=nse(A
p
) and p (G), then G

= A
p
. As
a consequence of our results we prove that, A
p
is uniquely
determined by its nse and order.
1 Introduction
If n is an integer, then we denote by (n) the set of all prime divisors of n. Let G be
a nite group. Denote by (G) the set of primes p such that G contains an element
of order p. Also the set of element orders of G is denoted by
e
(G).
Set m
i
= m
i
(G)=|{g G| the order of g is i}|. In fact m
i
is the number of
elements of order i in G, and nse(G):={m
i
| i
e
(G)}, the set of sizes of elements
with the same order.
For the set nse(G), the most important problem is related to Thompsons prob-
lem. In 1987, J. G. Thompson posed the following problem: ([3, Problem 12.37])
Problem 1: For each nite group G and each integer d 1, let G(d) = {x G|
2010 Mathematics Subject Classication. Primary 20D06, ; Secondary 20D20, 20D60.
Key words and phrases. Element order, set of the numbers of elements of the same order,
alternating group.
227
x
d
= 1}. G
1
and G
2
are called the same order type if and only if, |G
1
(d)| = |G
2
(d)|,
d = 1, 2, 3, . . . . Suppose G
1
and G
2
are nite group of the same order type. If G
1
is solvable, is G
2
necessarily solvable?
Unfortunately, as so far, no one can prove it completely, or even give a coun-
terexample. However, if groups G
1
and G
2
are of the same order type, we see clearly
that |G
1
| = |G
2
| and nse(G
1
) = nse(G
2
). So it is natural to investigate the Thomp-
sons Problem by |G| and nse(G).
In [2, 5], it is proved that the groups A
5
, A
6
, A
7
and A
8
are uniquely determined
only by nse(G). Also, In [1], it has been proved that the sporadic groups are charac-
terizable by their nse and order. In [5], the authors gave the following problem:
Problem 2: Is a group G isomorphic to A
n
(n 4) if and only if nse(G) =
nse(A
n
)?
In this paper, we give a positive answer to this problem for some type of the
alternating groups and show that the alternating groups A
p
with p and p 2 prime
are characterizable by nse(A
p
), when p (G). In fact the main theorem of our
paper is as follows:
Main Theorem: Let G be a group such that nse(G)=nse(A
p
), where p and p 2
are twin primes. If p (G), then G

= A
p
.
We note that there are nite groups which are not characterizable by nse(G) and
|G|. In 1987, Prof. G. J. Thompson gave an example as follows:
Let G
1
= (C
2
C
2
C
2
C
2
) A
7
and G
2
= L
3
(4) C
2
be the maximal subgroups
of M
23
. Then nse(G
1
) = nse(G
2
)= {1, 435, 2240, 5040, 5760, 6300, 6720, 8064} and
|G
1
| = |G
2
| = 40320, but G
1
G
2
. Also there is a another example as follow: Let
H
1
= C
4
C
4
and H
2
= C
2
Q
8
, where C
2
and C
4
are cyclic groups of orders 2
and 4, respectively and Q
8
is a quaternion group of order 8. It is easy to see that
nse(H
1
) = nse(H
2
)= {1, 3, 12} and |H
1
|=|H
2
| = 16, but H
1
is an abelian group and
H
2
is a non-abelian group. Therefore H
1
H
2
.
2 Preliminary Results
We rst quote some comments and lemmas that are used in deducing the main
theorem of this paper.
Let S
n
be a permutation and let have t
i
cycles of length i, i = 1, 2, ..., l,
in its cycle decomposition. The cycle structure of is denote by 1
t
1
2
t
2
...l
t
l
where
1t
1
+2t
2
... +lt
l
= n. One can easily show that two permutations in S
n
are conjugate
if and only if they have the same cycle structure. Let S
n
and assume that the
cycle decomposition of contains t
1
cycles of length 1, t
2
cycles of length 2, ..., t
l
cycles of length l. Then |cl
Sn
()| = n!/1
t
1
2
t
2
l
t
l
t
1
!t
2
! t
l
!.
228
Lemma 2.1. [5] Let G be a nite group and m be a positive integer dividing |G|.
If L
m
(G) = {g G|g
m
= 1}, then m | |L
m
(G)|.
Let m
n
be the number of elements of order n. We note that m
n
= k(n), where k
is the number of cyclic subgroups of order n in G and is the Euler totient function.
Also we note that if n > 2, then (n) is even. If n
e
(G), then by 2.1 and the
above notation we have:
_
_
(n) | m
n
()
n |
d|n
m
d
Lemma 2.2. [5] Let Gbe a group containing more than two elements. Let k
e
(G)
and m
k
be the number of elements of order k in G. If s = sup{m
k
|k
e
(G)} is
nite, then G is nite and |G| s(s
2
1).
Lemma 2.3. [4] Let G be a nite group and p (G) be odd. Suppose that P is
a Sylow psubgroup of G and n = p
s
m, where (p, m) = 1. If P is not cyclic and
s > 1, then the number of elements of order n is always a multiple of p
s
.
References
[1] A. K. Asboei, S. S. salehi Amiri, A. Iranmanesh, A. Tehranian, A new charac-
terization of sporadic simple groups by NSE and order, J. Algebra Appl, 12 (2),
(2013) 1-3.
[2] A. K. Asboei, S. S. salehi Amiri, A. Iranmanesh, A. Tehranian, A new charac-
terization of A
7
and A
8
, An. Stint. Univ. Ovidius Constanta, 21 (3), (2013),
43-50.
[3] V. D. Mazurov and E. I. Khukhro, Unsolved Problems in group theory: the
Kourovka Notebook, 16 ed. (Novosibirsk, Inst. Mat. Sibirsk. Otdel. Akad, 2006).
[4] G. Miller, Addition to a theorem due to Frobenius, Bull. Am. Math. Soc. 11,
(1904), 6-7.
[5] R. Shen, C. G. Shao, Q. Jiang, W. Shi, V. Mazuro, A New Characterization of
A
5
, Monatsh Math, (2010), 337-341.
229
The 6
th
Commuting graphs on conjugacy classes of nite
groups
Maryam Shadab
1
and Amin Saeidi
2
1
Islamic Azadi University, Shahr-e Rey branch, Tehran, Iran
shadab.maryam@gmail.com
2
Islamic Azadi University, Central branch, Tehran, Iran
saeidi.amin@gmail.com
Abstract
Let G be a nite group. We dene the commuting conjugacy
class graph of G as follows: the vertex set is the set of non-
central conjugacy classes of G and two distinct conjugacy
classes [x] and [y] in G are joint by an edge if x commutes
with an element of [y]. In this talk, we study the structure of
groups in which the commuting conjugacy class graph con-
tains an isolated vertex.
1 Introduction
Let G be a nite group. A usual way to study the structure of G is to attach cer-
tain graphs to it. By studying the structure of these graphs, we may obtain useful
information about G. In these talk, we x a nite group G and investigate a graph
dened on the set of the conjugacy classes of G. There are dierent ways to dene
the vertex set of a graph with conjugacy classes as edges (see an overview in [3]).
The graphs that we consider here have been introduced and studied in [2]: the ver-
tex set is the set of non-identity conjugacy classes of G and two distinct conjugacy
classes [x] and [y] in G are joint by an edge if x commutes with an element of [y].
In other words, if there exists an element g G such that [x, y
g
] = 1. Since every
Speaker
2010 Mathematics Subject Classication. Primary 20D10; Secondary 20F65.
Key words and phrases. Conjugacy class graphs, isolated vertex, special p-groups.
230
central element of G is a singleton set of conjugacy class of G, one observes that
central elements as vertices are joint to all other vertices of the graph. So for the
groups with a nontrivial center, the graph is connected and the diameter may not
exceed two. One may ask what can we say about a subgraph obtained by omitting the
conjugacy classes of central elements. Here we concentrate to these subgraph that
we denote by
cc
(G). We are mainly interested in the case when
cc
(G) cintains an
isolated vertex. All groups we consider are nite and non-abelian. We refer to [1]
for notations.
2 preliminaries
Lemma 2.1. [2, Theorem 19] If
cc
(G) is an empty graph, then G is one of the
groups D
8
, Q
8
or S
3
.
Lemma 2.2. If
cc
(G) has an isolated vertex, then |G| is even.
Lemma 2.3. Let G be a nilpotent group. If
cc
(G) has an isolated vertex, then
(i) G is a 2-group;
(ii) Z(G) is elementary abelian;
(iii) |Z
2
(G)| 2|Z(G)|
2
.
Lemma 2.4. Let [x] be an isolated vertex. Then x is a p-element, i.e |x| = p
for
a prime p and a positive integr .
3 Main results
We start with the following result which is a a generalization of Lemma 2.1.
Theorem 3.1. Let G be a p-group in which |G : Z(G)| = p
2
. Then it contains
exactly p+1 connected components. Moreover, each component is complete of type
K
m
where m =
p1
p
3
|G|.
Example 3.2. Let G be a non-abelian p-group of order p
3
. Then
cc
(G) =
p+1
i=1
K
i
,
where K
i
are complete graphs of order p 1.
Remark 3.3. The previous example implies that two non-isomorphic p-groups may
have isomorphic graphs.
231
Proposition 3.4. Let G be a 2-group. If [x] is an isolated vertex of
cc
(G), then
|C
G
(x) : Z(G)| = 2
Proposition 3.5. Let G be a nilpotent group of class 2, and let
cc
(G) has an
isolated vertex. Then G is a special 2-group.
Corollary 3.6. Let [x] be an isolated vertex. Then C
G
(x) is a p-group.
Acknowledgement
The authors gratefully acknowledge the nancial and other support of this research,
provided by the Islamic Azad University, Shahr-e Rey Branch, Tehran, Iran
References
[1] M. Aschbacher, Finite Group Theory, Cambridge Univ. Press, 1986.
[2] M. Herzog, P. Longobardi and M. Maj, On a commuting graph on conjugacy
classes of groups, Comm.Algebra, 37 (2009), 33693387.
[3] M.L. Lewis, An overview of graphs associated with character degrees and conju-
gacy class sizes in nite groups, Rocky Mountain J. Math. 38 (2008), 175-212.
232
The 6
th
A quotient oF topological fundamental groups
Hamid Torabi
1
Ali Pakdaman
2
and Behrooz Mashayekhy
3
1
Structures, Ferdowsi University of Mashhad, Mashhad, Iran
hamid torabi86@yahoo.com
2
Alipaky@yahoo.com
1
Structures, Ferdowsi University of Mashhad, Mashhad, Iran
bmashf@um.ac.ir
Abstract
In this talk, we discuss on the topological properties of a
quotient of topological fundamental groups via a new sub-
groups of fundamental group, namely small generated sub-
group, constructed by small loops which presence of them is
equivalent to absence of homotopically Hausdorness prop-
erties.
1 Introduction
In 2002, a work of Biss initiated the development of a theory in which the familiar
fundamental group
1
(X, x) of a topological space X becomes a topological space
denoted by
top
1
(X, x) by endowing it with the quotient topology inherited from the
path components of based loops in X with the compact-open topology. Among other
things, Biss claimed that
top
1
(X, x) is a topological group. However, there is a gap
in his proof. Brazas discovered some interesting counterexamples for continuity of
multiplication in
top
1
(X, x) (for more details, see [1]).
Speaker
2010 Mathematics Subject Classication. Primary 20F38; Secondary 20k45 , 20F34.
Key words and phrases. Topological fundamental group, SG subgroup, Semi-locally small
generated space.
233
In fact,
top
1
(X, x) was a quasitopological group, that is, a group with a topology
such that inversion and all translations are continuous. Althogh, Brazas by removing
some open subsets of
qtop
1
(X, x) make it a topological group, but it is an interesting
question that when these two topologies are equivalent. In the sequel, by introducing
some spaces, we give a partial answer to this question.
If a space X is not homotopically Hausdor, then there exist x X and a
nontrivial loop in X based at x which is homotopic to a loop in every neighborhood
U of x. Z. Virk [4] called these loops as small loops and showed that for every x X
they form a subgroup of
1
(X, x) which is named small loop group and denoted by
s
1
(X, x). In general, various points of X have dierent small loop groups and hence
in order to have a subgroup independent of the base point, Virk [4] introduced the
SG (small generated) subgroup, denoted by
sg
1
(X, x), as the subgroup generated by
the following set
{[
1
] | []
s
1
(X, (1)), P(X, x)},
where P(X, x) is the space of all paths from I into X with initial point x ((see [3]
for further details)).
Throughout this article, all the homotopies between two paths are relative to end
points, X is a topological space with the base point x X.
2 Main results
Denition 2.1. ([4]) The small loop group
s
1
(X, x) of (X, x) is the subgroup of the
fundamental group
1
(X, x) consisting of all homotopy classes of small loops. The
SG subgroup of
1
(X, x), denoted by
sg
1
(X, x), is the subgroup generated by the
following set
{[
1
] | []
s
1
(X, (1)), P(X, x)},
where P(X, x) is the space of all paths in X with initial point x.
Denition 2.2. We call a space X semi-locally small generated if and only if for each
x X there exists an open neighborhood U of x such that i
1
(U, x)
sg
1
(X, x),
where i : U X is the inclusion map.
Theorem 2.3. If (X, x) is a pointed topological space and U is an open neighbor-
hood of the identity element [e
x
]
top
1
(X, x), then
sg
1
(X, x) U.
Corollary 2.4. Every nonempty open or closed subset of
qtop
1
(X, x) is a disjoint
union of some cosets of
sg
1
(X, x).
234
Proof. Since
qtop
1
(X, x) is the disjoint union of all cosets of
sg
1
(X, x), it suces to
prove the theorem for open subsets of
qtop
1
(X, x). For this, let V be a nonempty
open subset of
qtop
1
(X, x) and g V . Then g
1
V is an open subset of
qtop
1
(X, x)
containing [e
x
] and hence by Theorem 2.3 ,
sg
1
(X, x) g
1
V which implies that
g
sg
1
(X, x) V . Hence V =
gV
g
sg
1
(X, x).
The natural quotient map p :
qtop
1
(X, x)

1
(X,x)
sg
1
(X,x)
induce the quotient topology
on the algebraic quotient group

1
(X,x)
sg
1
(X,x)
which we denote it by (

1
(X,x)
sg
1
(X,x)
)
top
. By the
previous corollary we can prove that:
Theorem 2.5. For a topological space X,
qtop
1
(X, x) is a topological group if an
only if (

1
(X,x)
sg
1
(X,x)
)
top
is topological group.
Theorem 2.6. For a topological space X,
qtop
1
(X, x) is a indiscrete topological
group if an only if (

1
(X,x)
sg
1
(X,x)
)
top
is indiscrete topological group.
Theorem 2.7. For a topological space X, (

1
(X,x)
sg
1
(X,x)
)
top
is discrete topological group
if and only if X is semi-locally small generated.
Corollary 2.8. If X is semi-locally small generated, then
qtop
1
(X, x) is topological
group.
By the following example, we use Theorem 2.5 to nd a non semi-locally small
generated space with topological fundamental group as a topological group.
Example 2.9. Let HA be the Harmonic Archipelago space and let X = [0, 1]
n
({1/n} HA
n+1
), where HA
n
is scaled Harminic Archipelago by the scaler 1/n.
qtop
1
(X, x) is topological group since (

1
(X,x)
sg
1
(X,x)
)
top
is topological group.
References
[1] J. Brazas, The fundamental group as a topological group, Topology Appl. 160
(2013), no. 1, 170188.
[2] E. H. Spanier, Algebraic Topology, McGraw-Hill Book Co., New York-Toronto,
Ont.-London 1966
[3] H. Torabi, A. Pakdaman, B. Mashayekhy, Topological fundamental groups and
small generated coverings, to appear in Mathematica Slovaca.
[4] Z. Virk, Small loop spaces, Topology and its Applications. 157 (2010) 451-455.
235
The 6
th
On 11 decomposable nite groups
M. Youse
and A. R. Ashra
Department of Pure Mathematics, Faculty of Mathematical Sciences,University of Kashan,
Kashan, I. R. Iran
s
youse68@yahoo.com
Abstract
Let G be a nite group and N
G
denote the set of non-trivial
proper normal subgroups of G. An element K of N
G
is said
to be n-decomposable if K is a union of n distinct conjugacy
classes of G. G is called ndecomposable, if N
G
= and
every element of N
G
is n-decomposable.
In this paper, we investigate the structure of non-solvable
non-perfect nite group G, when G is 11decomposable.
We prove that such a group is isomorphic to PSL(2, 16).2,
Aut(PSL(2, 19)), PSL(2, 25) : 2
2
, Aut(Sz(32)) or U
3
(5).2.
Here, PSL(2, 16).2 and U
3
(5).2 are extensions of the groups
PSL(2, 16) and U
3
(5) and PSL(2, 25) : 2
2
denotes one of the
third split extension of PSL(2, 25) in the small group library
of GAP [M. Schonert et al., GAP, Groups, Algorithms and
Programming, Lehrstuhl f ur Mathematik, RWTH, Aachen,
1992].
1 Introduction
Let G be a nite group and let N
G
be the set of non-trivial proper normal subgroups
of G. An element K of N
G
is said to be ndecomposable if K is a union of n distinct
conjugacy classes of G. If N
G
= and every element of N
G
is ndecomposable,
then we say that G is ndecomposable.
Speaker
2010 Mathematics Subject Classication. Primary 20E34; Secondary 20D10.
Key words and phrases. Conjugacy class, n-decomposable group.
236
Ashar and Sahraee [1] settled the problem of classifying n-decomposable nite
groups. They characterized the solvable ndecomposable nite groups under certain
conditions and also the structure of 2, 3 and 4decomposable nite groups. If G
is solvable, then the problem of classifying such groups is so dicult. In [2, 3, 4], the
authors continue this problem by characterization of n decomposable nite groups,
when 5 n 10. They applied some deep results of Wu Jie Shi in the eld of the
quantitative structure of nite groups [6]. It is merit to state here that such type of
problems in group theory is started by publishing some pioneering works of Wu Jie
Shi.
Throughout this paper, as usual, G
denotes the derived subgroup of G, Z(G) is

the center of G, x
G
, x G, denotes the conjugacy class of G with the representative
x and G is called non-perfect, if G
= G. Also, SmallGroup(n, i) denotes the

i
th
group of order n in the small group library of GAP. All groups considered are
assumed to be nite. Our notation is standard and can be taken from the standard
books of group theory.
2 Results and Discussions
Shahryari and Shahabi [5], investigated the structure of nite groups which contains a
2decomposable subgroup H. In this case, H G
, |H|(|H|1) divides |G| and H is

an elementary abelian normal subgroup of G. Moreover, they proved that, under cer-
tain conditions, G is a Frobenius group with kernel H. Ashra and Sahraei [1], used
the mentioned paper to characterize the structure of 2, 3 and 4decomposable
nite groups. Also, they obtained the structure of solvable ndecomposable nite
groups.
In this section, we rst report on recent results on our problem. We rst as-
sume that G is a non-perfect 5 or 6decomposable nite group. By [2, The-
orems 5 and 6], G is 5 or 6decomposable if and only if G {Z
5
A
5
, A
6

2
3
, Aut(PSL(2, 7)), Aut(PSL(2, 7))} or G {S
6
, A
6
2
2
}, respectively. In [3, The-
orem 2.5 and 2.6], the problem of classifying non-perfect 7 and 8decomposable
nite groups are considered into account. We assume that G is such a group. If
G is a non-perfect 7decomposable nite group then G is isomorphic to an abelian
group of order 49, Aut(PSL(2, 11)), Z
7
xA
6
, Aut(Sz(8)) or a Frobemus group of
order
1
6
p
r
(p
r
1), p > 5 is prime, and r is a positive integer, such that the kernel of
G is elementary abelian of order p
r
and its complement is cyclic. Let G be a non-
perfect 8decomposable nite group. Then G is isomorphic to Aut(PSL(2, 13)),
PSL(2, 27) : 3, PSL(3, 4) : 2 (including PSL(3, 4).21; PSL(3, 4).22 and PSL(3, 4).23);
PSL(3, 4) : 3, S
7
or a Frobenius group of order
1
7
2
r
(2
r
1), r is a positive integer, such
that the kernel of G is elementary abelian of order 2
r
and its complement is cyclic.
237
In [4, Theorems 2.6 and 2.7], the authors proved that if then G is isomorphic to
Aut(PSL(3, 3)), Aut(PSL(2, 32)), Z
3
(Z
5
Z
5
), or a non-abelian group of or-
der pq, where p and q are primes and p 1 = 8q. Moreover, it is proved that
a non-perfect 10decomposable nite group G is isomorphic to Aut(PSL(2, 17)),
Aut(U3(3)), PSL(2, 25).23 or D
38
.
In this paper we continue the study of this problem and classify the non-solvable
non-perfect 11decomposable nite groups. We prove that:
Mail Theorem: Suppose G is a nonsolvable nonperfect 11decomposable nite
group, then G is isomorphic to PSL(2, 16).2, Aut(PSL(2, 19)), PSL(2, 25) : 2
2
,
Aut(Sz(32)) or U
3
(5).2.
References
[1] A. R. Ashra and H. Sahraei, On Finite Groups Whose Every Normal Subgroup
is a Union of the Same Number of Conjugacy Classes, Vietnam J. Math., 30
(3) (2002) 289294.
[2] A. R. Ashra and Y. Q. Zhao, On 5 and 6decomposable nite groups, Math.
Slovaca 53 (4) (2003)373383.
[3] A. R. Ashra and W. J. Shi, On 7 and 8decomposable nite groups, Math.
Slovaca 55 (3) (2005) 253262.
[4] A. R. Ashra and W. J. Shi, On 9 and 10decomposable nite groups, J. Appl.
Math. Comput. (2008) 26 169182.
[5] M. Shahryari and M. A. Shahabi, Subgroups which are the union of two conju-
gacy classes, Bull. Iranian Math. Soc. Vol. 25, No. 1 (1999), 59-71.
[6] W. J. Shi, The Quantitative Structure of Groups and Related Topics, Group
Theory in China, Zhe-Xian Wan and Sheng-Ming Shi(Eds.), 163-181, Science
Press New York, Ltd. and Kluwer Academic Publishers, 1996.
238
The 6
th
The nonabelian tensor square of some nite groups
Rosita Zainal
1
2
, Nor Haniza Sarmin
3
,
Samad Rashid
4
and Adnin A Nawi
5
1,2,3,5
rosita.zainal@gmail.com
1
2
, nhs@utm.my
3
,
adnin
a@yahoo.com
5
4
Department of Mathematics, , Faculty of Science , Shahr-e-Rey Branch, Islamic Azad
University, Tehran, Iran
samadrashid@yahoo.com
Abstract
The nonabelian tensor square, GG, is a special case of the
nonabelian tensor product which has its origin in homotopy
theory. In this research, the nonabelian tensor square of
groups of order 8p, where p is and odd prime are determined.
1 Introduction
The nonabelian tensor square of a group G, denoted by GG, is the group generated
by the symbols g h and dened by the relations gg
h=(
g
g

g
h)(g h) and
g hh
= (g h)(
h
g
h
h
) for all g, g
, h, h
G, where G acts on itself by

conjugation, i.e.
g
g
=gg
g
1
.
Many researches on the nonabelian tensor square of various groups have been
conducted over the years. In 2011, Rashid et al. [1] determined the nonabelian
tensor square of groups of order p
2
q where p and q are primes. Recently, Basri
et al. in [2] computed the nonabelian tensor square of metacyclic p-groups.
Next, the classication of groups of order 8p, where p is an odd prime is stated
in the following theorem:
Speaker
2010 Mathematics Subject Classication. Primary 20D15; Secondary 20F99 , 20J05, 20J99.
Key words and phrases. Nonabelian tensor square, nite groups.
239
Theorem 1.1. [4] Let G be a group of order 8p, where p is an odd prime. Then
exactly one of the following holds:
(1.1) G

= D
4
Z
p
.
(1.2) G

= Q
2
Z
p
.
(1.3) G

= D
2p
Z
2
.
(1.4) G

= Q
p
Z
2
.
(1.5) G

= D
p
Z
4
.
(1.6) G

=
a, b|a
8
= b
p
= 1, a
1
ba = b
1
.
(1.7) G

= D
4p
.
(1.8) G

=
a, b, c|a
4
= b
2
= c
p
= 1, b
1
ab = a
1
, a
1
ca = c
1
, bc = cb
.
(1.9) G

= Q
2p
.
(1.10) G

=
a, b|a
8
= b
p
= 1, a
1
ba = b
,
where is a primitive root of
4
1(mod p), 4 divides p 1.
(1.11) G

=
a, b, c|a
4
= b
2
= c
p
= 1, ab = ba, a
1
ca = c
, bc = cb
,
4
(1.12) G

=
a, b|a
8
= b
p
= 1, a
1
ba = b
,
8
(1.13) G

= Z
4
A
4
.
(1.14) G

= SL(2, 3).
(1.15) G

= S
4
.
(1.11) G

= a, b, c, d|a
4
= b
2
= c
2
= d
p
= 1, ab = ba, ac = ca, bc = cb,
d
1
ad = b, d
1
bd = c, d
1
cd = ab.
Some basic results that are used to compute the nonabelian tensor square of nite
groups are stated in the following theorems.
Theorem 1.2. [3] Let G and H be groups. Then
(GH) (GH)

= (GG) (GH) (H G) (H H).
Theorem 1.3. [3] Let G be the metacyclic group, G = a, b|b
n
= a
m
= e, aba
1
=
b
l
, where l
m
1 (mod n) and n is an odd number. Then G G = Z
m
Z
m
1

Z
m
2
Z
m
3
where m
1
= (n, l 1), m
2
= (n, l 1, 1 + l + l
2
+ ... + l
m1
), m
3
=
(n, 1 +l +l
2
+... +l
m1
).
Theorem 1.4. [5] If G is a nite group such that the derived subgroup G
is cyclic
and (|G
|, |G
ab
|) = 1, then GG

= G
(G
ab
Z
G
ab
), where G
ab
is the abelianization
of a group G, G
ab
= G/G
.
Theorem 1.5. [6] Let G be a nite solvable group of derived length 2. Then
|GG| divides |G
ab
Z
G
ab
||G
||G

Z[G
ab
]
I(G
ab
)|, where I(G
ab
) is the kernel
of Z[G
ab
] Z.
240
Theorem 1.6. [6] Let G be a nite group and i 0. Then there is an exact
sequence 1 [G
, G
] (G, G) (G
ab
, G
ab
) 1 where : G G
is
an isomorphism, (G, G) is the subgroup [G, G
] of (G, G) = G, G
|[g, h
]
g
1
=
[g
g
1
, (h
g
1
)
], [g, h
]
h
1
= [g
h
1
, (h
h
1
)
] for all g
1
, g, h, h
1
G and [G
, G
] [G, G].
2 Main results
The nonabelian tensor square for all groups of order 8p are stated in the next theorem.
Theorem 2.1. Let G be a group of order 8p, where p is an odd prime. Then exactly
one of the following holds:
GG

=
_
_
Z
4p
Z
3
2
; if G is of type (1.1), (1.4),
(1.5), (1.7) or (1.11),
Z
4p
Z
4
Z
2
2
; if G is of type (1.2) or (1.9),
Z
8p
; if G is of type (1.6), (1.10) or (1.12),
Z
2p
Z
8
2
; if G is of type (1.3),
Z
4p
M ; if G is of type (1.8),
Z
6
Q
2
Z
3
Q
2
Z
3

A
4
Z
14
Z
2
2
where M is an abelian group of order 8.
Proof. Let G

= D
4
Z
p
. By Theorem 1.2,
GG

= (D
4
Z
p
) (D
4
Z
p
)

= Z
4p
Z
3
2
.
By using the same proof as group of type (1.1), we prove for a group of type (1.2),
then GG

= Z
4p
Z
4
Z
2
2
.
For the group of type (1.3), we consider the following cases:
Case 1: If p = 3, then GG

= (S
3
Z
2
2
) (S Z
2
2
)

= Z
6
Z
8
2
.
Case 2: If p = 3, then GG

= (D
2p
Z
2
2
) (D
2p
Z
2
2
)

= Z
2p
Z
8
2
.
Next, for the group of type (1.4), G = H Z
2
, where a, b|a
4
= b
p
= 1, a
1
ba =
b
1
. Then G G = Z
4p
Z
3
2
. For the group of type (1.5), we have G

= Z
p
and
G
ab
= Z
4
Z
2
and by using Theorem 1.2, GG

= Z
p
((Z
4
Z
2
)
Z
(Z
4
Z
2
))

=
Z
4p
Z
3
2
. The proof for the group of type (1.6) is similar with the group of type
(1.5). Now, Let G

= D
2p
, then GG

= Z
4p
Z
3
2
. The proof can be found in [3].
241
Since the proof for the groups of type (1.8) and (1.9) are similar, we will only show
the proof for the group of type (1.8). For this group, G

= Z
2p
and G
ab
= Z
2
Z
2
,
then G is a nite solvable group. By Theorem 1.5, |G G| divides 2
4
2p, where
G
ab
= Z
2
Z
2
, G
ab
G
ab
= Z
4
2
, G
= 1, G
Z[G
ab
]
I(G
ab
)

= Z
2p
and I(G
ab
) is the
kernel of Z[G
ab
] Z. The exact sequence 1 [G
, G
] (G, G) (G
ab
, G
ab
)
1 in Theorem 1.6 shows that |[G
, G
]| divides 2p. The commutative diagram shows

that (GG)/M(G)

= G
, that is, GG

= Z
4p
and the epimorphism GG GG
shows that GG has an element of order 4p. Since GG is abelian, |GG| divides
2
4
2p, |[G
, G
]| divides 2p and GG has an element of order 4p. Then, we obtain

|GG| = 2
4
2p and GG

= Z
4p
M, where M is an abelian group of order 8.
For the group of type (1.10), by choosing n = p, m = 8 and l = 1, thus G is a
metacyclic group. Then by using Theorem 1.3, G G

= Z
8p
. The computation of
the nonabelian tensor square for the group of type (1.12) is similar to that of the
group of type (1.10).
Next, for the group of type (1.11), G

= Z
p
and G
ab
= Z
4
Z
2
and by using
Theorem 1.4, we have GG

= Z
4p
Z
3
2
. The proof of GG for the groups of types
(1.13) until (1.15) have been computed in [3].
Lastly, for the group of type (1.6), G
ab
= Z
7
. We have |GG| = |G||M(G)| = 56.
The epimorphism G G G
ab
G
ab
= Z
7
and exp(G G) = 14, thus G G

=
Z
7
Z
3
2
= Z
14
Z
2
2
.
Acknowledgement
The authors would like to acknowledge Ministry of Education (MOE) Malaysia and
Universiti Teknologi Malaysia (UTM) for the nancial funding through the Research
University Grant (RUG) Vote No 04H13 and UTM Mobility Program. The rst
author is also indebted to MOE Malaysia for MyPhD Scholarship.
References
[1] S. Rashid, N.H. Sarmin, A. Erfanian and N.M. Mohd Ali, On The Nonabelian
Tensor Square and Capability of Groups of Order p
2
q, Arch. Math. 97(2011).
[2] A.M. Basri, N.H. Sarmin, N.M. Mohd Ali, J.R. Beuerle, On some metacyclic
p-groups and their nonabelian tensor square, Indian Journal of Science and Tech-
nology. 6 (2013), no.2, 6770.
242
[3] R. Brown, D.L. Johnson, and E.F Robertson, Some computations of nonabelian
tensor products of groups, J. Algebra. 111 (1987), 177202.
[4] S.H. Miah, On the isomorphism of group algebras of groups of order 8q, J. Lond.
Math. Soc. 2 (1975) no.9, 549556.
[5] I.N. Nakaoka, Nonabelian tensor square of solvable groups, J. Group Theory. 3
(2007), 157167.
[6] I.N. Nakaoka, N.R. Rocco, Nilpotent actions on nonabelian tensor products of
groups, Mat. Contemp. 21 (2001), 223238.
243
The 6
th
Epicenter of Lie rings and the Lazard correspondence
Seiran Zandi
Faculty of Mathematical Sciences and Computer, Kharazmi University, Tehran, Iran
seiran.zandi@gmail.com
Abstract
Let G be a nite p-group of nilpotency class less than p 1
and let L be the Lie ring corresponding to G via the Lazard
correspondence. We show that the epicenters of G and L are
isomorphic as abelian groups. Thus the group G is capable
if and only if the Lie ring L is capable.
1 Introduction
The Lazard correspondence establishes a natural equivalence between the category of
p-groups of nilpotency class less than p, and the category of Lie rings of prime power
order and nilpotency class less than p. For more details we refer the reader to [2]
and [4]. This means amongst other things that subgroups correspond to Lie subrings,
normal subgroups to ideals, and in general many properties transfer from the groups
to the Lie rings and vice versa.
A group G is capable if there exists a group H with H/Z(H)

= G.Similarly, a
Lie ring L is capable if there exists a Lie ring K with K/Z(K)

= L. Given a p-group
G of nilpotency class less than p and its associated Lie ring Lie(G), we show that
the epicenters of G and Lie(G) are isomorphic as abelian groups. Furthermore, the
group G is capable if and only if the Lie ring Lie(G) is capable.
2 Preliminary
The aim of this section is to collect some facts and results that will be applied in the
next section of the paper.
2010 Mathematics Subject Classication. Primary 20D15; Secondary 17B30, 20F40.
Key words and phrases. Lie rings, Epicenter of Lie rings, Lazard correspondence, p-groups.
244
A Lie ring L is an additive abelian group with a (not necessarily associative)
multiplication denoted by [, ] that satises the following properties:
[x, x] = 0 for all x L. (Anti-commutativity)
[x, [y, z]] + [z, [x, y]] + [y, [z, x]] = 0 for all x, y, z L. (Jacobi identity)
[x + y, z] = [x, z] + [y, z] and [x, y + z] = [x, y] + [x, z] for all x, y, z L.
(Bilinearity)
The product [x, y] is also called the commutator of x and y.
Given a Lie ring L and two subrings U and V , we dene [U, V ] as the subring of
L generated by all commutators [u, v] with u U and v V . This allows to dene
the lower central series L = L
1
L
2
L
3
. . . via L
i
= [L
i1
, L]. The Lie ring
L is nilpotent if this series terminates at {0}. In this case, the class c(L) is the
length of the lower central series of L. The center of L is Z(L) = {x L | [x, y] =
0 for all y L}.
In a group G we denote the multiplication with g h (or just gh for short) and
the commutator with g, h = g
1
h
1
gh. Generalized commutators are right-normed
throughout our paper; that is
[x, x, y] = [x, [x, y]] and x, x, y = x, x, y.
Denition 2.1. Let G be a group. We dene the epicenter Z
(G) of G as the
smallest normal subgroup of G such that G/Z
(G) is capable. Hence a group G is

capable if and only if Z
(G) is trivial.
It is clear that Z
(G) Z(G). So Z
(G) is abelian. Similarly, we dene the

epicenter of Lie rings.
Denition 2.2. Let L be a Lie ring. We dene the epicenter Z
(L) of L as the
smallest ideal of L such that L/Z
(L) is capable.
Proposition 2.3. Let G be a nite p-group of class less than p and let L be its
Lazard correspondent. Let X be a subset of G and hence of L.
1. The subring of L generated by X and the subgroup of G generated by X
coincide as sets and are in Lazard correspondence.
2. The ideal of L generated by X and the normal subgroup of G generated by X
Proposition 2.4. Let G be a nite p-group of class less than p and let L be its
Lazard correspondent.
245
1. Z(G) and Z(L) coincide as sets and are in Lazard correspondence. Hence
Z(G) and Z(L) are isomorphic as abelian groups.
2. G
and L
2
Finally, we also get a correspondence between the quotients.
Proposition 2.5. Let G be a nite p-group of class c < p and let L be its Lazard
correspondent. Let G
0
be a normal subgroup in G and L
0
the corresponding ideal
in L. Then : G/G
0
L/L
0
: xG
0
x + L
0
is a well-dened bijection and it
induces the Lazard correspondence between G/G
0
and L/L
0
.
3 Main results
In [1] it is proved that the epicenter Z
(G) of a group G is the intersection of all

normal subgroups N of G so that G/N is capable. Thus Z
(G) Z(G) holds. This

translates directly to Lie rings. We rst prove the following preliminary statement.
Lemma 3.1.
1. Let G be a nite p-group which is capable. Then there exists a nite p-group
H with H/Z(H)

= G.
2. Let L be a nite capable Lie ring with p
n
elements. Then there exists a nite
Lie ring K with K/Z(K)

= L and K has p
m
elements for some m n.
Note that a group G is capable if and only if Z
(G) = {1} and similar for a Lie

ring.
Theorem 3.2. Let G be a nite p-group of class less than p1 and let L = Lie(G).
Then Z
(G) and Z
(L) are isomorphic as abelian groups.

Proof. By Lemma 3.1 there exists a nite Lie ring K of p-power order so that
K/Z(K)

= L/Z
(L). By Proposition 2.3 the group G has a normal subgroup N so

that G/N corresponds to L/Z
(L) via the Lazard correspondence. As c(K) < p, we

can form H = Grp(K). This group H satises Z(H) = Z(K). Further, we obtain
that H/Z(H) and K/Z(K) are Lazard correspondents. Thus H/Z(H)

= G/N.
Hence Z
(G) N and |Z
(G)| |Z
(L)| = |N|. Similarly, one can show that

|Z
(L)| |Z
(G)|. Thus Z
(G) = N and Z
(G)

= Z
(L) as abelian groups.

246
References
[1] F. R. Beyl, U. Felgner and P. Schmid, On groups occurring as center factor
groups, J. Algebra. (1) 61 (1979), 161177.
[2] S. Cical`o, W. Graaf and M. R. Vaughan-Lee, An eective version of the Lazard
correspondence, J. Algebra, (1) 352 (2012), 430450.
[3] C. C. Sims, Computation with nitely presented groups, Encyclopedia of Math-
ematics and its Applications, Cambridge. Press, 1994.
[4] E. I. Khukhro, p-automorphisms of nite p-groups, London Mathematical Society
Lecture Note Series 246, Cambridge University Press, Cambridge, 1998.
247
The 6
th
A generalization of Mohress Theorem on groups with
all subnormal subgroups
Mohammad Zarrin
Department of Mathematics, University of Kurdistan, P.O. Box: 416, Sanandaj, Iran
m.zarrin@uok.ac.ir, zarrin@ipm.ir
Abstract
Mohress Theorem says that an arbitrary group whose proper
subgroups are all subnormal is solvable. Here we generalize
Mohress Theorem, by proving that every group with at most
56 non-subnormal subgroups is solvable. Also we show that
the derived length of a solvable group with a nite number k
of non-n-subnormal subgroups is bounded in terms of n and
k.
1 Introduction and results
Let G be a group. A subgroup H of G is said to be subnormal in G, if there exists
a nite series of subgroups of G, such that
H = H
0
H
1
. . . H
k
= G.
If H is subnormal in G, then the defect of H in G is the shortest length of such a
series. We shall say that a subgroup H of G is n-subnormal if H is subnormal of
defect at most n.
In a famous paper of 1965, J.E. Roseblade [8] proved that a group with all sub-
groups n-subnormal is nilpotent of class (n), where (n) is a function that depends
only on n (we can take (n) to be best possible for all n), and so it is solvable of
class at most
[log
2
((n))] + 1. ()
2010 Mathematics Subject Classication. 20E15.
Key words and phrases. Norm; Subnormal subgroup; Solvable group.
248
However, (n) is not explicitly given in [8] and the exact values are only known for
n {1, 2}. In fact, results of Heineken [2] and Mahdavianary [6] state that a group
with all cyclic subgroups 2-subnormal is nilpotent of class not exceeding 3. As a
corollary of this result, it follows that (2) 3. Moreover, it follows from [10] that
this bound is sharp. (In case n = 1, G is a Dedekind group and so (1) 2.)
In 1990 Mohres [7] proved that a group with all subgroups subnormal (or a
group without non-subnormal subgroups) is solvable. In this paper we study groups
with nitely many non-subnormal subgroups. Let k be a non-negative integer. We
say that a group G is an R
n
(k)-group (M(k)-group, resp.) if G has exactly k non-
n-subnormal (non-subnormal, resp.) subgroups. We note that (for xed k and n)
R
n
(k) is contained in M(l) for some l less than or equal to k. To prove this, let
n, k be xed and G be in R
n
(k). Then G has exactly k non-n-subnormal subgroups,
so certainly G has at most k non-n-subnormal subgroups, so G has at most k non-
subnormal subgroups and so G has exactly l non-subnormal subgroups for some l
less than or equal to k and so G lies in M(l) for some l less than or equal to k.
Clearly the R
n
(k)-groups G with k = 0 are those in which all subgroups are n-
subnormal, and the M(k)-groups G with k = 0 are those with all subgroups sub-
normal. We note that if G is an R
n
(k)-group (or M(k)-group), then k = 1. This is
because every conjugate of a non-n-subnormal subgroup is also a non-n-subnormal
subgroup. Therefore in considering R
n
(k)-groups (or M(k)-groups) we may assume
that k 2.
According to (), the derived length of a solvable R
n
(0)-group is [log
2
((n))]+
1. Here (see also [12]) we obtain a result which is of independent interest, namely,
the derived length of solvable R
n
(k)-groups is bounded in terms of n and k (2 k).
Theorem 1.1. Let G be an arbitrary solvable R
n
(k)-group and d be the derived
length of G . Then d [log
2
((n))] + k, where (n) is the function of Roseblades
theorem.
Also, we generalize Mohress Theorem as follows (note that Mohress Theorem
says that every M(0)-group is solvable).
Theorem 1.2. Suppose that G is an M(k)-group (R
n
(k)-group) for some n with
k 56. Then G is solvable.
2 Proofs
If G is an arbitrary group, the norm B
1
(G) of G is the intersection of all the
normalizers of subgroups of G (in fact, B
1
(G) is the intersection of all the normalizers
249
of non-1-subnormal subgroups of G). This concept was introduced by R. Baer, and
it is well-known ([5] and [9]) that Z(G) B
1
(G) Z
2
(G) . Now we dene B
n
(G)
as the intersection of all the normalizers of non-n-subnormal subgroups of G, i.e.,
B
n
(G) =
HRn(G)
N
G
(H),
where R
n
(G) =
_
H | H is a non-n-subnormal subgroup of G} (with the stipu-
lation that B
n
(G) = G if all subgroups of G are n-subnormal). Clearly B
i
(G)
B
i+1
(G). Moreover, in view of the proof of Theorem A, below, we can see that
B
n
(G) is a nilpotent normal subgroup of G of class (n), ()
where (n) is the function of Roseblades theorem. In fact B
n
(G) is a substantial
generalization of the norm B
1
(G).
Proof of Theorem 1.1. The group G acts on the set
R
n
(G) =
_
H | H is a non-n-subnormal subgroup of G}
by conjugation. By assumption |R
n
(G)| = k (note that k 2). Now the subgroup
B
n
(G) is the kernel of this action, so B
n
(G) is normal in G and G/B
n
(G) Sym
k
.
But it is surely well known that the derived length of every solvable subgroup of
the symmetric group S
n
of degree n (n 1) is at most n 1. Hence G/B
n
(G) has
derived length k 1. Therefore to complete the proof it is enough to show that
B
n
(G) is solvable of class at most [log
2
((n))] + 1. To see this, according to the
main result in [8], it is enough to show that every subgroup of B
n
(G) is n-subnormal.
Suppose on the contrary that there exists a non-n-subnormal, say H of B
n
(G). It
follows that H is a non-n-subnormal of G and so, by denition of B
n
(G), we obtain
that H B
n
(G), which is impossible. Hence B
n
(G) is a nilpotent group of class at
most (n) and so it is solvable of class at most [log
2
((n))] +1. This completes the
proof.
Combining the results quoted in the introduction and the above Theorem, we
obtain a nice corollary as follows:
Corollary 2.1. Let G be a solvable R
2
(k)-group, d the derived length of G and
k 2. Then d k + 1.
Remark 2.2. In view of the proof of Theorem A, we can see that if G is an arbitrary
group with a nite number k of non-n-subnormal subgroups, then the factor group
G
Bn(G)
is nite and
|
G
B
n
(G)
| k!.
250
This result suggests that the behaviour of non-n-subnormal subgroups has a strong
inuence on the structure of the group.
Remark 2.3. The Wielandt subgroup W(G) of a group G is dened to be the
intersection of all the normalizers of subnormal subgroups of G; this concept is
naturally analogous to the norm of a group. Also we shall denote by W
(G) the
intersection of all the normalizers of non-subnormal subgroups of G. Now by a
similar argument as in the proof of Theorem A, mentioned for B
n
(G), we can see
that every subgroup of W
(G) is subnormal and so, by Mohress Theorem,

W
(G) is a solvable normal subgroup of G.

Moreover, if G is an arbitrary group with nitely many, k of non-subnormal sub-
groups, then the factor group
G
W
(G)
is nite and
|
G
W
(G)
| k!.
In the sequel, we want to prove Theorem B.
Lemma 2.4. Let G be an M(n)-group and H G, then H is an M(t)-group for
some t n.
Lemma 2.5. Let G be an M(t)-group, K a normal subgroup of G,
G
K
M(n) and
K M(m). Then t m+n.
For any prime power q, we denote by L
n
(q) and Sz(q), respectively, the projec-
tive special linear group of degree n over the nite eld of size q and the Suzuki
group over the eld with q elements. If G is a nite group, then for each prime
divisor p of |G|, we denote by v
p
(G) the number of Sylow p-subgroups of G.
References
[1] D. J. Garrison and L.-C. Kappe, Metabelian groups with all cyclic subgroups
subnormal of bounded defect, in proccedings of innite groups 1994 (walter de
gruyter, 1996), PP. 73-85.
[2] H. Heineken, A class of three-Engel groups, J. Algebra 17 (1971), 341-345.
[3] B. Huppert and N. Blackburn, Finite groups, III (Springer-Verlag, New York,
1982).
251
[4] B. Huppert, Endliche Gruppen I, Springer-Verlag, Berlin, 1967.
[5] W. P. Kappe, Die A-Norm einer Gruppe, Illinois J. Math. 5 (1961), 187-197.
[6] S. K. Mahdavianary, A special class of three-Engel groups, Arch. Math. (Basel)
40 (1983), 193-199.
[7] W. Mohres, Auosbarkeit von Gruppen, deren Untergruppen alle subnormal
sind, Arch. Math. (Basel) 54 (1990), 232-235.
[8] J. E. Roseblade, On groups in which every subgroup is subnormal, J. Algebra
2 (1965), 402-412.
[9] E. Schenkman, On the norm of a group, Illinois J. Math. 4 (1960), 150-152.
[10] M. Stadelmann, Gruppen, deren Untergruppen subnormal vom Defekt zwei
sind, Arch. Math. 30 (1978), 364-371.
[11] J. G. Thompson, Nonsolvable nite groups all of whose local subgroups are
solvable (Part I), Bull. Amer. Math. Soc. (NS) 74 (1968), 383-437.
[12] M. Zarrin, Non-subnormal subgroups of groups, Journal of Pure and Applied
Algebra 217 (2013) 851-853.
252
Index
Abdollahi*, A., 28
Abdul Hamid*, M., 31
Aghabozorgi*, G. H., 35
Aghajari*, Z., 193
Ahanjideh, N., 50, 54, 157
Ahmadidelir*, K., 40
Akbarossadat*, S. N., 207
Alijani*, A. A., 220
Alizadeh Sanati, M., 46
Araskhan, M., 116
Asadian*, B., 50
Asgary*, S., 54
Ashra, A. R., 236
Babaei*, E., 58
Badrkhani Asl*, M., 123
Bahlekeh*, A., 63
Bibak*, M., 67
Bibak, M., 224
Davvaz, B., 35
Ercan*, G., 2
Erfanian, A., 31, 141
Faramarzi Salles*, A., 70
Farhami, N., 96
Farrokhi D. G.*, M., 73
Farrokhi D. G., M., 141, 212
Foroudi Ghasemabadi, M., 178
Ghanei, F., 119
Gholamian*, A., 76
Gholamian, A., 161
Ghoraishi*, S. M., 80
Ghorbany*, M., 84
Guloglu*,

I. S., 3
Hassanzadeh*, M., 181
Hatamian, R., 105
Hokmabadi, A., 88
Hoseini Ravesh, M., 127
Iranmanesh, A., 178
Jafari*, S. H., 92
Jafarpour, M., 35
Jahandideh*, M., 96
Johari*, F., 101
Kaheni*, A., 105
Kahkeshani, R., 109
Kayvanfar*, S., 9
Kayvanfar, S., 105
Kazemi Esfeh, H., 96
Khoddami*, A. R., 113
Khosravi*, H., 116
Khosravi, H., 70
Kuzucuoglu*, M., 16
Mahdipour*, Z., 46
Mashayekhi, B., 165, 174
Mashayekhy, B., 233
Mirdamadi*, S. E., 196
Mirebrahimi*, H., 119
Mirebrahimi, H., 165
Moghaddam, M. R. R., 123, 127, 132, 136
Mohammadian*, A., 141
Mohammadzadeh*, E., 88
Mohammadzadeh*, H., 144
Mohammadzadeh, F., 88
Mohd Ali, N. M., 31, 169, 239
Mousavi, H., 149
Naja*, A., 153
Naja*, M., 157
Nasrabadi*, M. M., 161
253
Nasrabadi, M. M., 76
Nasri*, T., 165
Nawi*, A. A., 169
Nawi, A. A., 239
Niroomand, P., 101
Pakdaman*, A., 174
Pakdaman, A., 233
Parvizi Mosaed*, H., 178
Parvizi, M., 101
Pourmirzaei, A., 181
Rashid, S., 169, 239
Rasouli, H., 153
Rastgoo*, T., 149
Razzaghmaneshi*, B., 185, 189
Rezaeezadeh, G., 67, 193, 196, 224
Rezaei*, M., 199
Robati*, S. M., 203
Rostamyari*, A., 132
Sadeghifard*, M. J., 136
Saeedi*, F., 212
Saeedi, F., 73, 207
Saeidi*, A., 230
Safa*, H., 217
Saarnia*, S., 127
Sahleh, H., 220
Sajjadi*, M., 224
Sajjadi, M., 67
Salehi Amiri*, S. S., 227
Sarmin, N. H., 31, 169, 239
Shadab, M., 230
Shahryari*, M., 20
Shum*, K. P., 26
Torabi*, H., 233
Torabi, H., 174
Yazdany Moghaddam*, M., 109
Youse*, M., 236
Zainal*, R., 239
Zainal, R., 169
Zamani, Y., 58
Zandi*, S., 244
Zarrin*, M., 248
Zenkov, V., 149
254

6 GTC Proceedings

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

6 GTC Proceedings

Uploaded by

Copyright:

Available Formats

Golestan University

and complement isomorphic to

Ismail S.G uloglu

= F and [F, h] = F for all

are cyclic of coprime orders,

y = 1 for some y H where H

is Frobenius with Frobenius complement isomorphic to

y = 1. On the other hand the group H has a unique subgroup of order p

of characters of the abelian group H/H

, which is not possible. So if necessary by reindexing the orbits, we can assume

for any i = 1, 2, . . . , b 1 and

2 are all nonzero if

is the regular character of H

{1, 1}. Then |H

Z(H) and hence H is abelian, which is not the case.

| divides e. In particular e > 1 and so e +

> 0 which shows that

which is not possible. Then t

is H-invariant. This yields that

| divides the greatest common divisor of e and m

is a 2-group. This contradiction shows that =

. One can check that (|) is a nonsingular

be an element of order 5 and c GF(3

(G) which is minimal subject

(G) is the smallest central subgroup of G

(G) , which is minimal subject to being the image in G of

(G) is dened to be the

(G) is characteristic and it is also proved in [9] that (V

(G) is the small-

(G) is V-capable. In other words;

-group can be embedded in a simple Q

which has many rare properties; for any non-zero elements

and it is possible to describe the derivation algebra of any nite

is algebraically closed in the class X.

-groups for any set of primes . Our

with only two conjugacy classes. Further |G

-group, i for any x and y and any

-number n, we have the implication

-number n, there exists y G, such that

-group and -divisible, then there is a

-number n. So, we denote this element by

-group and -divisible, can be regarded as an

-group for short) via x

-group and -divisible.

-group. Then there exists a Q

is not nitely generated,

X with the following properties,

is algebraically closed in the class X.

with the presentation

= L, t : [t, a] = (a); (a A).

. Similar constructions are also introduced for Lie p-algebras

having the following properties,

such that [x, a] = b,

the derivation ad x is never nilpotent,

is not nitely generated,

of M with the same number

has a block of size 1

(H) be the set of all non-empty subsets of

(H). If (a, b) H H, its image under in P

the derived subpolygroup of P.

= {e} if and only if P

H = G then (G//H) is a perfect polygroup;