Você está na página 1de 7

Bonfring International Journal of Data Mining, Vol. 2, No.

2, June 2012 6

ISSN 2277 - 5048 | 2012 Bonfring
Abstract--- Following the works of [2, 4, 7, 9] of analytic
and univalent functions in this paper we introduce two new
classes ) , , , , ( S T

p n
and T
n
V

(, , , , ), |z| < 1,0 <


1, 0, 1/2 1, 0 1/2 , 1/2 < 1, 0for a
family of analytic functions of the form
. z 2,3,..., n for 0, a , z a z f(z)
n
2 n
n
n
= =

=

We have obtained coefficient estimates, growth &
distortion theorems, extremal properties for these two classes.
The determination of extreme points of a family of univalent
functions leads to solve many extremal points.
Keywords--- Al-Oboudi Operator, Convex Functions,
Starlike Functions, Univalent Functions.

I. INTRODUCTION
ET S denote the class of functions of the form

=
+ =
2 n
n
n
z a z f(z) (1)
that are analytic and univalent in the disk |z| < 1.
For 0 < 1 let S
*
() and K() denote the subfamilies of S
consisting of functions starlike of order and convex of order
respectively.
The subfamily T of S consists of functions of the form
. z 2,3,..., n for 0, a , z a z f(z)
n
2 n
n
n
= =

=
(2)
Silverman [6] investigated function in the classes
T
*
() = T S
*
() and C() = T K().
Let n N and 0. Denote by
n

D the Al-Oboudi operator


[3] defined by
n

D : A A,
f(z)]. [D D f(z) D
f(z) D (z) f z )f(z) (1 f(z) D
f(z) f(z) D
1 n

n

=
= + =
=


Note that for f(z) is given by (1),
1, when , z a 1)) (j [1 z f(z) D
2 j
j
j
n

= + + =

=

n

D is the Slgean differential operator.


n

D : A A, n

T.V. Sudharsan, Department of Mathematics, SIVET College,
Chennai - 600 073, India. E-mail: tvsudharsan@rediffmail.com
S.P. Vijayalakshmi, Department of Mathematics, SIVET College,
Chennai - 600 073, India.
N defined as:
f(z)]. D[D f(z) D
(z) f z Df(z) f(z) D
f(z) f(z) D
1 n n
1
0

=
= =
=


Definition 1.1: [8] Let, R, 0, 0 and

=
+ =
2 j
j
j
z a z f(z) we denote by

D the linear operator


defined by

D : A A

=
+ + =
2 j
j
j

z a ) 1) (j (1 z f(z) D
Remark 1.1: If f T, , z a z f(z)
2 j
j
j

=
= a
j
0, j = 2, 3,
,
z then
. z a ) 1) (j (1 z f(z) D
2 j
j
j

=
+ =
In this paper using the operator

D we introduce the
classes ) , , , , ( S T

p n
and T
n
V

(, , , , ) and obtain
coefficient estimates for these classes when the functions have
negative coefficients. We also obtain growth and distortion
theorems, closure theorem for functions in these classes.
Definition 1.2: We say that a function f(z) T is in the
class ) , , , , ( S T

p n
if and only if

1
f(z) D
f(z) D

f(z) D
f(z) D
2
1
f(z) D
f(z) D

<

+ +
+

where |z| < 1, 0 < 1, 1/2 1, 0, 0 1/2 ,
1/2 < 1, 0.

Definition 1.3: A function f(z) T is said to belong to the
class ) , , , , ( S T

p n
if and only if

1
f(z) D
f(z) D

f(z) D
f(z) D
2
1
f(z) D
f(z) D
1

<

+
+
+
+
+
+

On Certain Classes of Analytic and Univalent
Functions Based on Al-Oboudi Operator
T.V. Sudharsan and S.P. Vijayalakshmi


L
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 7

ISSN 2277 - 5048 | 2012 Bonfring

where |z| < 1, 0 < 1, 1/2 1, 0, 0 1/2 ,
1/2 < 1, 0.

If we replace = 0, = 1 we obtain the corresponding
results of S.M. Khairnar and Meena More [4]. If we replace
= 0, = 1 and = 1 we obtain the results of Aghalary and
Kulkarni [2] and Silverman and Silvia [7]. If we replace
= 0, = 1 and by 1, we obtain the corresponding results of
[9].
II. MAIN RESULTS COEFFICIENT ESTIMATES
Theorem 2.1: A function

=
=
2 j
n
n
z a z f(z) (a
n
0) is in
) , , , , ( S T

p n
if and only if
) (1 2
)]a (1 2 } 1 {2 1) [(j ) 1) (j (1
2 j
j


+ + +

=

Proof. Suppose,
) (1 2
)]a (1 2 } 1 {2 1) [(j ) 1) (j (1
2 j
j


+ + +

=

we have
0 f(z)) D f(z) (D f(z)) D f(z) (D 2
f(z) D f(z) D

<

+ +
+


With the provision,
0 z a ) 1) (j (1 z z a ) 1) (j (1 z
z a ) 1) (j (1 z z a ) 1) (j (1 z 2
z a ) 1) (j (1 z z a ) 1) (j (1 z
2 j
j
j

2 j
j
j
1
2 j
j
j

2 j
j
j
1
2 j
j
j

2 j
j
j
1
<

+ + +

+ + +
+ + +


=
+

=
+

=
+


For |z| = r < 1 it is bounded above by

) (1 2
r }a 1) (j 1) (j 2 2 {2 ) 1) (j (1
) r(1 2 r a 1) (j ) 1) (j (1
2 j
j
j

2 j
j
j


+ +
+

=


f(z) ). , , , , ( S T

p n


Now we prove the converse result.
Let

1
f(z) D
f(z) D

f(z) D
f(z) D
2
1
f(z) D
f(z) D

<

+ +
+

1
z a ) 1) (j (1 z
z a ) 1) (j (1 z

z a ) 1) (j (1 z
z a ) 1) (j (1 z
2
1
z a ) 1) (j (1 z
z a ) 1) (j (1 z
2 j
j
j

2 j
j
j
1
2 j
j
j

2 j
j
j
1
2 j
j
j

2 j
j
j
1
<

+
+

+
+

+
+
=

=
+

=
+

=
+

z }a 1) (j 1) (j 2 1) ( {2 ) 1) (j (1
)z (1 2
z a 1) (j ) 1) (j (1
2 j
j
j

2 j
j
j

<
+ + +

+
=

=



As |Re f(z)| |z| for all z, we have

z }a 1) (j 1) (j 2 1) ( {2 ) 1) (j (1
)z (1 2
z a 1) (j ) 1) (j (1
Re
2 j
j
j

2 j
j
j

<
+ + +

+

=


We choose values of z on real axis such that

D
D
+
is real
and clearing the denominator of above expression and
allowing
z 1 through real values, we obtain
[
] 0 ) (1 2
)}a (1 2 ) 1 (2 1) {(j ) 1) (j (1
) (1 2
)}a (1 2 ) 1 (2 1) {(j ) 1) (j (1
2 j
j

2 j
j


+ + +

+ + +

=


Remark : If f(z) ) , , , , ( S T

p n
then
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 8

ISSN 2277 - 5048 | 2012 Bonfring
2,3,4,... j
,
)} (1 2 ) 1 (2 1) {(j ) 1) (j (1
) (1 2
a

j
=
+ + +


and equality holds for
. z
)} (1 2 ) 1 (2 1) {(j ) 1) (j (1
) (1 2
z f(z)
j

+ + +

=

Corollary 2.1: If f(z) ), , , ,0, ( S T
1
p n
that is, replacing
= 0, = 1 we get
2,3,4,... j ,
) j j 2 (2 1) (j
) (1 2
a
j
=
+


and equality holds for
. z
) j j 2 (2 1) (j
) (1 2
z f(z)
j
+

=
This corollary is due to [4].

Corollary 2.2: If f(z) ), ,1, ,0, ( S T
1
p n
that is, replacing
= 0, = 1, = 1 we get
2,3,4,... j ,
) 1 j j 2 (2 1) (j
) (1 2
a
j
=
+



and equality holds for
. z
) 1 j j 2 (2 1) (j
) (1 2
z f(z)
j
+

=

This corollary is due to [2] and [7].

Corollary 2.3: If f(z) ) ,0,1,1, ( S T
1
p n
we get
2,3,4,... j ,
) 1 j (2 1) (j
) (1 2
a
j
=



and equality holds for
. z
) 1 j (2 1) (j
) (1 2
z f(z)
j


=
This corollary is due to [9].

Corollary 2.4: f(z) ,0,1,1,1) ( S T
1
p n
if and only if
) (1 )a (j
2 j
j

=


Theorem 2.2: A function

=
=
2 j
n
n
z a z f(z) (a
n
0) is in
) , , , , ( S T

p n
if and only if
). (1 2
)}a (1 2 } 1 {2 1) {(j ] 1) (j [1
2 j
j
1

+ + +

=
+

Proof: The proof of this theorem is analogous to that of
Theorem [1], because a function f(z) T
n
V

(, , , , ) if
and only if (z) f z ). , , , , ( S T

p n
So it is enough that
in Theorem 2.1 is replaced with +1.

Remark 2.2: If f(z) T
n
V

(, , , , ) then
2,3,4,... j
,
)} (1 2 ) 1 (2 1) {(j ) 1) (j (1
) (1 2
a
1
j
=
+ + +

+

and equality holds for
j
1
z
)} (1 2 ) 1 (2 1) {(j ) 1) (j (1
) (1 2
z f(z)
+ + +

=
+

Corollary 2.5: If f(z) T
n
V
1
(, , , , ), that is,
replacing
= 0, = 1 we get
2,3,4,... j ,
)} j j 2 (2 1) j{(j
) (1 2
a
j
=
+



and equality holds for
j
z
)} j j 2 (2 1) j{(j
) (1 2
z f(z)
+

=
This corollary is due to [4].
Corollary 2.6: If f(z) T
n
V
1
(, 0, , 1, ), that is,
replacing
= 0, = 1, = 1 we get
2,3,4,... j ,
)} 1 j j 2 (2 1) j{(j
) (1 2
a
j
=
+


and equality holds for
j
z
)} 1 j j 2 (2 1) j{(j
) (1 2
z f(z)
+

=
This corollary is due to [2] and [7].

Corollary 2.7: If f(z) T
n
V
1
(, 0, 1, 1, ), then
2,3,4,... j ,
1)} j (2 1) j{(j
) (1 2
a
j
=



and equality holds for
j
z
1)} j (2 1) j{(j
) (1 2
z f(z)


=

Corollary 2.8: f(z) T
n
V
1
(, 0, 1, 1, 1), if and only if
). (1 )a j(j
2 j
j

=

Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 9

ISSN 2277 - 5048 | 2012 Bonfring
III. GROWTH AND DISTORTION THEOREM
Theorem 3.1: If f(z) ) , , , , ( S T

p n
then

+ + +

+

+ + +

)} (1 2 2 { ) (1
) (1 2
r r
f(z) r
)} (1 2 2 { ) (1
) (1 2
r

2
2


equality holds for
r. z at z
) 2 ( 4 1
) (1 2
z f(z)
2
=
+ +

=
Proof: By Theorem 2.1, we have f(z) ) , , , , ( S T

p n

if and only if
). (1 2
)}a (1 2 } 1 {2 1) {(j ) 1) (j (1
2 j
j


+ + +

=

Let .
2
) (1 2
1 t
+

=
f(z) ) , , , , ( S T

p n
if and only if
t 1 t) (j a ) 1) (j (1
2 j
j

=
(3)
When j = 2
t 1 t) (j a ) 1) (j (1 a t) (2 ) (1
2 j
j

2 j
j

+ +


=

=

This last inequality follows from (3) we obtain

+

+ + +


=

=
t) (2 ) (1
t 1
r r a r r r a r f(z)

2
2 j
n
2
2 j
n
n

Similarly

+




=

=
t) (2 ) (1
t 1
r r a r r r a r f(z)

2
2 j
n
2
2 j
n
n

So,

+

+

t) (2 ) (1
t 1
r r f(z)
t) (2 ) (1
t 1
r r

2

2

that is,

+ + +

+

+ + +

)} (1 2 2 { ) (1
) (1 2
r r
f(z)
)} (1 2 2 { ) (1
) (1 2
r r

2

Hence the result.
Corollary 3.1: If f ), , , ,0, ( S T
1
p n
that is, replacing
= 1 and = 0, then

+ + +

+

+ + +



2 2 2 1
) (1 2
r r
f(z)
2 2 2 1
) (1 2
r r
2
2

that is,

+ +

+

+ +

) 2 ( 4 1
) (1 2
r r
f(z)
) 2 ( 4 1
) (1 2
r r
2
2



and equality for
r. z at z
) 2 ( ) 4 (1
) (1 2
z f(z)
2
=
+ +

=
This corollary is due to [4].

Corollary 3.2: If f(z) ), ,1, ,0, ( S T
1
p n
that is, replacing
= 1, = 0 and = 1, then

+ +

+

+ +

) 2 (1 4 1
) (1 2
r r
f(z)
) 2 (1 4 1
) (1 2
r r
2
2

with equality for,
r. z at z
) 2 (1 4 1
) (1 2
z f(z)
j
=
+ +

=
This corollary is due to [2] and [7].

Corollary 3.3: If f(z) ), ,0,1,1, ( S T
1
p n
then

+ +

+

+ +

) 2 (1 4 1
) (1 2
r r
f(z)
) 2 (1 4 1
) (1 2
r r
2
2

with equality for,
r. z at z
) 2 (1 ) 4 (1
) (1 2
z f(z)
j
=
+ +

=

Theorem 3.2: If f(z) T
n
V

(, , , , ) then

+ + +

+

+ + +

+
+
)} (1 2 ) 2 {( ) (1
) (1 2
r r
f(z)
)} (1 2 ) 2 {( ) (1
) (1 2
r r
1
2
1
2


Proof: The proof of this theorem is analogous to that of
Theorem 3.1, because a function f(z) T
n
V

(, , , , ) if
and only if (z) f z ). , , , , ( S T

p n
So it is enough that
in Theorem 2.1 is replaced with +1.
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 10

ISSN 2277 - 5048 | 2012 Bonfring

Corollary 3.4: If f(z) T
n
V
1
(, 0, , , ) then

+ +

+

+ +

) 2 ( 4 (1
) (1
r r
f(z)
) 2 ( 4 (1
) (1
r r
2
2

with equality for
r. z at z
) 2 ( ) 4 (1
) (1
z f(z)
j
=
+ +

=
This corollary is due to [4].
Corollary 3.5: If f(z) T
n
V
1
(, 0, , 1, ) then

+ +

+

+ +

) 2 (1 4 (1
) (1
r r
f(z)
) 2 (1 4 (1
) (1
r r
2
2

with equality for
r. z at z
) 2 (1 ) 4 (1
) (1
z f(z)
j
=
+ +

=
This corollary is due to [2] and [7].
Corollary 3.6: If f(z) T
n
V
1
(, 0, 1, 1, ) then

+

+

2 3 1
) (1
r r
f(z)
2 3 1
) (1
r r
2
2

with equality for
r. z at z
2 3 1
) (1
z f(z)
j
=
+

=
This corollary is due to [9].

Theorem 3.3: If f(z) ) , , , , ( S T

p n
then
r
)} 1 ( 2 ) (1 { ) (1
) (1 4
1
(z) f r
)} 1 ( 2 ) (1 { ) (1
) (1 4
1

+ + +

+

+ + +


Proof. Since f ) , , , , ( S T

p n
we have
t 1 t) (j a ) 1) (j (1
2 j
j

=

where .
2
) (1 2
1 t
+

=
In view of Theorem 3.1, we have


=

=
+ =
2 j
j
2 j
j
2 j
j
a t t)a (j ja (4)
.
t) (2 ) (1
t) 2(1

+

+ + +


=

t) (2 ) (1
t) 2(1
r 1 na r 1 z na 1 f

2 n
n
2 n
1 n
n

Similarly

+




=

t) (2 ) (1
t) 2(1
r 1 na r 1 z na 1 f

2 n
n
2 n
1 n
n

So,
.
t) (2 ) (1
t) 2(1
r 1 (z) f
t) (2 ) (1
t) 2(1
r 1

+

+

+



Substituting t, we have

r
)} 1 ( 2 ) (1 { ) (1
) (1 4
1
(z) f r
)} 1 ( 2 ) (1 { ) (1
) (1 4
1

+ + +

+

+ + +



Corollary 3.7: If f ) , , ,0, ( S T
1
p n
) then
r
) (2 2 ) (1
) (1 4
1
(z) f r
) (2 2 ) (1
) (1 4
1

+

+



for |z| = r. This corollary is due to [4].

Corollary 3.8: If f ) ,1, ,0, ( S T
1
p n
then
r
) (2 2 ) (1
) (1 4
1
(z) f r
) (2 2 ) (1
) (1 4
1

+

+


This corollary is due to [2] and [7].

Corollary 3.9: If f ) ,0,1,1, ( S T
1
p n
then
r
) (2 2 ) (1
) (1 4
1
(z) f r
) (2 2 ) (1
) (1 4
1

+

+


that is,
r
2 3 1
) (1 4
1
(z) f r
2 3 1
) (1 4
1

+

+


This corollary is due to [9].

Theorem 3.4: If f T
n
V

(, , , , ) then
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 11

ISSN 2277 - 5048 | 2012 Bonfring

+ + +

+

+ + +

+
+
)} 1 ( 2 ) (1 { ) (1
) (1 4
r 1
(z) f r
)} 1 ( 2 ) (1 { ) (1
) (1 4
1
1
1

for |z| = r.

Proof: The proof of this theorem is similar to that of
Theorem 3.3 because a function f(z) T
n
V

(, , , , ) if
and only if (z) f z ). , , , , ( S T

p n
So it is enough that
in Theorem 3.3 is replaced with +1.

Corollary 3.10: If f T
n
V
1
(, 0, , , ) then

+

+

) (2 2 ) (1
) (1 2
r 1
(z) f r
) (2 2 ) (1
) (1 2
1

for |z| = r. This corollary is due to [4].

Corollary 3.11: If f T
n
V
1
(, 0, , 1, ) then

+

+

) (2 2 ) (1
) (1 2
r 1
(z) f r
) (2 2 ) (1
) (1 2
1

for |z| = r. This corollary is due to [2] and [7].

Corollary 3.12: If f T
n
V
1
(, 0, 1, 1, ) then

+

+

) (2 2 ) (1
) (1 2
r 1
(z) f r
) (2 2 ) (1
) (1 2
1

+

+

2 3 1
) (1 2
r 1
(z) f r
2 3 1
) (1 2
1

for |z| = r. This corollary is due to [9].
IV. CLOSURE THEOREM
Theorem 4.1: Let f
1
(z) = z and
j

j
z
)] (1 2 } 1 {2 1) [(j ] 1) (j [1
) (1 2
(z) f
+ + +

=
for j = 2, 3, 4, .
Then f(z) T
n
V

(, , , , ) if and only if f(z) can be


expressed in the forms

=
=
1 j
j j
(z) f f(z) where
j
0 and
1.
1 j
j
=

=

Proof: Let , (z) f f(z)
1 j
j j

=
=
j
0, j = 1, 2, with
1
1 j
j
=

=
we have

+ + +

=
+ =
=
2 j
j

j
2 j
j j 1 1
1 j
j j
z
)] (1 2 } 1 {2 1) [(j ] 1) (j [1
) (1 2
z
(z) f (z) f
(z) f f(z)

Then
1 1
) (1 2
)] (1 2 } 1 {2 1) [(j ] 1) (j [1
)] (1 2 } 1 {2 1) [(j ] 1) (j [1
) (1 2

1
2 j
j

2 j

j
= =

+ + +

+ + +

=

f(z) T
n
V

(, , , , ).
Conversely, suppose f(z) T
n
V

(, , , , ) then remark of
Theorem 2.1 gives us
)] (1 2 } 1 {2 1) [(j ] 1) (j [1
) (1 2
a

j
+ + +


we take
2,3,4,... j
, a
) (1 2
)] (1 2 } 1 {2 1) [(j ] 1) (j [1

j
=

+ + +
=

and . 1
1 j
j 1

=
=
Then . (z) f f(z)
1 j
j j

=
=

Corollary 4.1: If f
1
(z) = z and
2,3,... j for , z
) j j 2 (2 1) (j
) (1 2
z (z) f
j
j
=
+

=
Then f(z) T
n
V
1
(, 0, , , ) if and only if f(z) can be
expressed in the form

=
=
1 j
j j
(z) f f(z) where
j
0,
j = 1, 2, , 1.
1 j
j
=

=

This corollary is due to [4].
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 12

ISSN 2277 - 5048 | 2012 Bonfring

Corollary 4.2: If f
1
(z) = z and
2,3,... j for , z
) 1 j j 2 (2 1) (j
) (1 2
z (z) f
j
j
=
+

=
Then f(z) T
n
V
1
(, 0, , 1, ) if and only if f(z) can be
expressed in the form

=
=
1 j
j j
(z) f f(z) where
j
0,
j = 1, 2, , 1.
1 j
j
=

=

This corollary is due to [2] and [7].

Corollary 4.3: If f
1
(z) = z and
2,3,... j for , z
) 1 j (2 1) (j
) (1 2
z (z) f
j
j
=


=
Then f(z) T
n
V
1
(, 0, 1, 1, ) if and only if f(z) can be
expressed in the form

=
=
1 j
j j
(z) f f(z) where
j
0,
j = 1, 2, , 1.
1 j
j
=

=

This corollary is due to [9].

Corollary 4.4: If f
1
(z) = z and
j
z
z z
2j
2
z (z) f
j
j
j
= =
Then f(z) T
n
V
1
(0, 0, 1, 1, 1) if and only if f(z) can be
expressed in the form

=
=
1 j
j j
(z) f f(z) where
j
0,
j = 1, 2, , 1.
1 j
j
=

=

V. CONCLUSION
In this paper making use of Al-oboudi operator two new
subclasses of analytic and univalent functions are introduced
for the functions with negative coefficients. Many subclasses
which are already studied by various researchers are obtained
as special cases of our two new subclasses. We have obtained
various properties such as coefficient estimates, growth
distortion theorems. Further new subclasses may be possible
from the two classes introduced in this paper.
REFERENCES
[1] M. Acu, S. Owa, Note on a class of starlike functions, Proceeding of
the International short work on study on calculus operators in univalent
function theory, Kyoto, Pp. 110, 2006.
[2] R. Aghalary and S. Kulkarni, Some theorems on univalent functions,
J. Indian Acad. Math., Vol. 24, No. 1, Pp. 8193, 2002.
[3] F.M. Al-Oboudi, On univalent functions defined by a generalized
Slgean operator, Ind. J. Math. Sci., No. 25-28, 14291436, 2004.
[4] S.M. Khairnar and Meena More, Certain family of analytic and
univalent functions, Acta Mathematica Academiae Paedogical, Vol. 24,
Pp. 333344, 2008.
[5] S.R. Kulkarni, Some problems connected with univalent functions,
Ph.D. Thesis, Shiraji University, Kolhapur, 1981.
[6] H. Silverman, Univalent functions with negative coefficients.
[7] H. Silverman and E. Silvia, Subclasses of prestarlike functions, Math.
Japon, Vol. 29, No. 6, Pp. 929935, 1984.
[8] T.V. Sudharsan, R. Thirumalaisamy, K.G. Subramanian, Mugur Acu, A
class of analytic functions based on an extension of Al-Oboudi
operator, Acta Universitatis Apulensis, Vol. 21, Pp. 7988, 2010.
[9] S. Owa and J. Nishiwaki, Coefficient Estimates for certain classes of
analytic functions, JIPAM, J. Inequal. Pure Appl. Math., Vol. 315,
Article 72, 5pp (electonic), 2002.

Você também pode gostar