FUNCTIONS STARLIKE WITH RESPECT TO N-PLY SYMMETRIC, CONJUGATE AND SYMMETRIC CONJUGATE POINTS V. RAVICHANDRAN

Abstract. We introduce certain classes of starlike, convex and close to convex functions with respect to n-ply symmetric points, conjugate points and symmetric conjugate points and discuss their convolution properties. AMS subject classification: 30C45 Keywords and phrases: convex, starlike, close-to-convex functions; subordination, convolution; symmetric, conjugate, symmetric conjugate points.

1. Introduction P n Let A be the class of all analytic functions f (z) = z + ∞ n=2 an z defined on the unit disk U = {z : |z| < 1}. A function f ∈ A is said to be starlike if zf 0 (z)/f (z) is subordinate to (1 + z)/(1 − z) and convex if 1 + zf 00 (z)/f 0 (z) is subordinate to (1 + z)/(1 − z). Clearly the function (1 + z)/(1 − z) is univalent and convex in the unit disk. Therefore we can replace the function (1 + z)/(1 − z) by some convex function h(z) with h(0) = 1 to define the unified classes   zf 0 (z) ∗ ≺ h(z) S (h) = f ∈ A| f (z) and   zf 00 (z) C(h) = f ∈ A|1 + 0 ≺ h(z) f (z) where ≺ denotes subordination. Similarly we see that the function f is z z is starlike and convex, if f ∗ (1−z) starlike, if f ∗ 1−z 2 is starlike. These ideas lead to the study of the class of all functions f such that f ∗ g is starlike for some fixed function g in A. In this direction, the studies were made already by Padmanabhan and Parvatham[6], Manjini and Padmanabhan [7], and Shanmugam[11]. In this paper, certain classes of analytic functions with respect to n-ply symmetric points, conjugate points and symmetric conjugate points are 1

2

V RAVICHANDRAN

introduced and their convolution properties are discussed. See [5, 8] for related results. P P∞ n n Let f (z) = z + ∞ in A, n=2 an z , g(z) = z + n=2 bn z be functions P n then their convolution is the functions (f ∗ g)(z) = z + ∞ a n=2 n bn z . ∗ We denote by S (α), the class of all starlike functions of order α. The class Rα of prestarlike functions of order α is defined by   z ∗ Rα = f ∈ A|f ∗ ∈ S (α) (1 − z)2−2α for α < 1 and   f (z) R1 = f ∈ A|Re > 1/2 . z The following results are used to prove our main results: Theorem A [10] If f ∈ Rα and g ∈ S ∗ (α), then for any analytic function H(z) in U , we have f ∗ (Hg) (U ) ∈ Co(H(U )), f ∗g where Co(H(U )) denote the closed convex hull of H(U ). Theorem B [4] If G and Hare analytic and H is convex univalent in U with the range in some convex set D, then the range of the numbers G(z2 ) − G(z1 ) , H(z2 ) − H(z1 ) for z1 , z2 ∈ U, is also contained in D.

2. Definitions and Main Results Let g be a fixed function in A and h denote a convex function on U with h(0) = 1, Reh(z) > α for all z ∈ U , P 0 ≤ α < 1. Let n ≥ 1 be any n−1 n−k 1 n integer and  = 1,  6= 1. Let fn (z) = n k=0  f (k z). Definition 1. Let Sgn (h) denote the class of all functions f ∈ A satisfying (g ∗ f )n (z)/z 6= 0 in U and z(g ∗ f )0 (z) ≺ h(z). (g ∗ f )n (z)

STARLIKE FUNCTIONS

3

Definition 2. Let Kgn (h) denote the class of all functions f ∈ A such that (g ∗ f )0n (z) 6= 0 in U and satisfying (z(g ∗ f )0 (z))0 ≺ h(z). (g ∗ f )0n (z) Remark 1. (i) If n = 1 and α = 0, the classes introduced in the definitions 1 and 2 coincide with the classes introduced by Shanmugam[11]. (ii) If g(z) = z/(1 − z) and h(z) = (1 + (1 − 2β)z)/(1 − z), then we have the classes introduced by Chand and Singh[1]. Let S n (h) denote the class Sgn (h) with g(z) = z/(1 − z). Then we have the following Theorem 1. If f ∈ S n (h) and g ∈ Rα , then f ∈ Sgn (h). Proof. Since f ∈ S n (h), zf 0 (z) ≺ h(z) fn (z) and therefore, we have

zf 0 (z) > α. fn (z) It follows easily that fn (z) is in S ∗ (α). More generally one can prove, by using the convexity of h(z), that zfn0 (z) ≺ h(z). fn (z) Let H(z) = zf 0 (z)/fn (z). Then H is analytic in U . A computation shows that z(g ∗ f )0 (z) g ∗ (Hfn )(z) = . (g ∗ f )n (z) (g ∗ fn )(z) Using Theorem A, we have g ∗ (Hf )(z) ≺ h(z). (g ∗ f )n (z) This proves the result.  Re

Theorem 2. (i) Kgn (h) ⊂ Sgn (h) (ii) f ∈ Kgn (h) if and only if zf 0 ∈ Sgn (h). 0

0

) (z)] ≺ h(z). Replacing z by k z, k = Proof. Let f ∈ Kgn (h). Then [z(g∗f (g∗f )0n (z) 0, 1, . . . , n − 1, adding the results and simplifying using the convexity, we get [z(g ∗ f )0n (z)]0 ≺ h(z). (g ∗ f )0n (z)

4

V RAVICHANDRAN

This implies that the function (f ∗ g)n (z) is convex univalent function. Let M = z(f ∗ g)0 (z) and N (z) = (f ∗ g)n (z). Then M and N are analytic and N is convex univalent and M 0 /N 0 lies in the convex domain h(U ). Using Theorem B, we see that M/N lies in the domain h(U ). This proves that z(g ∗ f )0 (z) ≺ h(z) (g ∗ f )n (z) and therefore f ∈ Sgn (h). Part (ii) follows easily from the identity z(g ∗ zf 0 )0 (z) (z(g ∗ f )0 (z))0 = . (g ∗ zf 0 )n (z) (g ∗ f )0n (z)  Theorem 3. If f ∈ Sgn (h) and φ ∈ Rα , then φ ∗ f ∈ Sgn (h). Proof. Since f ∈ Sgn (h), we have z(g ∗ f )0 (z) ≺ h(z). (g ∗ f )n (z) We can show that, as in Theorem 2, (g ∗ f )n (z) ∈ S ∗ (α). Let H(z) =

z(g ∗ f )0 (z) . (g ∗ f )n (z)

Then z(g ∗ φ ∗ f )0 (z) φ ∗ z(g ∗ f )0 (z) φ ∗ H(g ∗ f )n (z) = = . (g ∗ φ ∗ f )n (z) φ ∗ (g ∗ f )n (z) φ ∗ (g ∗ f )n (z) By an application of Theorem A, we have φ ∗ H(g ∗ f )n (z) ≺ h(z). φ ∗ (g ∗ f )n (z) From the above equation we see that z(g ∗ φ ∗ f )0 (z) ≺ h(z). (g ∗ φ ∗ f )(z) This proves the result.



Remark 2. The above result reduces to a recent result of Rønning[9] about the class of uniformly convex functions of order α and the corresponding class of starlike functions of order α for the proper choice of n, g(z) and h(z). n Theorem 4. Sgn (h) ⊂ Sφ∗g (h) for every function φ ∈ Rα .

Proof. The result follows easily from the Theorem 3.



STARLIKE FUNCTIONS

5

Corollary 1. (i) If f ∈ Kgn (h) and φ ∈ Rα , then φ ∗ f ∈ Kgn (h). n (h) for every function φ ∈ Rα . (ii) Kgn (h) ⊂ Kφ∗g

Proof. The results follow from Theorems 2, 3 and 4.



Definition 3. Let Cgn (h) denote the class of all functions f ∈ A such that (g ∗ φ)(z)/z 6= 0 in U and satisfying z(g ∗ f )0 (z) ≺ h(z) (g ∗ φ)n (z) for some φ ∈ Sgn (h). Definition 4. Let Qng (h) denote the class of all functions f ∈ A such that (g ∗ f )(z)/z 6= 0 in U and satisfying, for some φ ∈ Kgn (h), [z(g ∗ f )0 (z)]0 ≺ h(z). (g ∗ φ)0n (z) Remark 3. (i) If n = 1 and α = 0, the classes introduced in the definitions 3 and 4 coincide with the classes introduced by Shanmugam[11]. Theorem 5. Let f ∈ Cgn (h) with respect to a functions f1 ∈ Sgn (h) and assume that φ ∈ Rα . Then φ∗f ∈ Cgn (h) with respect to φ∗f1 ∈ Sgn (h). Proof. By Theorem 3, φ ∗ f1 ∈ Sgn (h). As in the proof of Theorem 2, we can show that (g ∗ f1 )n (z) is in S ∗ (α). Let H(z) =

z(g ∗ f )0 (z) . (g ∗ f1 )n (z)

Using Theorem A, we see that φ ∗ H(g ∗ f1 )n (z) ≺ h(z). φ ∗ (g ∗ f1 )n (z) But we have φ ∗ H(g ∗ f1 )n (z) φ ∗ z(g ∗ f )0 (z) z(g ∗ φ ∗ f )0 (z) = = . φ ∗ (g ∗ f1 )n (z) φ ∗ (g ∗ f1 )n (z) (g ∗ φ ∗ f1 )n (z) This shows that φ ∗ f ∈ Cgn (h) with respect to φ ∗ f1 ∈ Sgn (h). n Corollary 2. Cgn (h) ⊂ Cφ∗g for every function φ ∈ Rα .

Theorem 6. (i) Kgn (h) ⊂ Qng (h) ⊂ Cgn (h). (ii) f ∈ Qng (h) if and only if zf 0 ∈ Cgn (h).



6

V RAVICHANDRAN

Proof. Let f ∈ Kgn (h). Then taking φ = f , we have φ ∈ Kgn (h) and [z(g ∗ f )0 (z)]0 ≺ h(z). (g ∗ φ)0n (z) This shows that f ∈ Qng (h). Now, suppose that f ∈ Qng (h). Then there exists φ ∈ Kgn (h) satisfying [z(g ∗ f )0 (z)]0 ≺ h(z). (g ∗ f )0n (z) Then it is easy to verify that the function (g ∗ φ)n (z) is a convex univalent function. Using Theorem B, it is seen that z(g ∗ f )0 (z) ≺ h(z) (g ∗ φ)n (z) where φ is in Sgn (h). This proves part (i). Part (ii) follows from the following identity: z(g ∗ zf 0 )0 (z) (z(g ∗ f )0 (z))0 = . (g ∗ zφ)n (z) (g ∗ φ)0n (z)  Theorem 7. (i) If f ∈ Qng (h) and φ ∈ Rα , then φ ∗ f ∈ Qng (h). (ii) Qng (h) ⊂ Qnφ∗g (h) for every function φ ∈ Rα . Proof. The results follow from Theorems 5 and 6.



Definition 5. Let SSgn (h) denote the class of all functions f ∈ A such that [(g ∗ f )n (z) − (g ∗ f )n (−z)]/z 6= 0 and 2z(g ∗ f )0 (z) ≺ h(z). (g ∗ f )n (z) − (g ∗ f )n (−z) Definition 6. SCgn (h) denote the class of all functions f ∈ A such that [(g ∗ f )0n (z) + (g ∗ f )0n (−z)]/z 6= 0 and satisfying 2[z(g ∗ f )0 (z)]0 ≺ h(z). (g ∗ f )0n (z) + (g ∗ f )0n (−z) Definition 7. Let CSgn (h) denote the class of all functions f ∈ A such that [(g ∗ f )n (z) + (g ∗ f )n (z)]/z 6= 0 and 2z(g ∗ f )0 (z) (g ∗ f )n (z) + (g ∗ f )n (z)

≺ h(z).

STARLIKE FUNCTIONS

7

Definition 8. Let CCgn (h) denote the class of all functions f ∈ A such 0

that (g ∗ f )0n (z) + (g ∗ f )n (z) 6= 0 and satisfying 2[z(g ∗ f )0 (z)]0 0

(g ∗ f )0n (z) + (g ∗ f )n (z)

≺ h(z).

Definition 9. Let SCSgn (h) denote the class of all functions f ∈ A such that [(g ∗ f )n (z) − (g ∗ f )n (−z)]/z 6= 0 and 2z(g ∗ f )0 (z) ≺ h(z). (g ∗ f )n (z) − (g ∗ f )n (−z) Definition 10. Let SCCgn (h) denote the class of all functions f ∈ A 0 such that (g ∗ f )0n (z) + (g ∗ f n (−z) 6= 0 and satisfying 2[z(g ∗ f )0 (z)]0 ≺ h(z). (g ∗ f )0n (z) + (g ∗ f )0n (−z) Remark 4. If n = 1, g(z) = z/(1−z), and h(z) = (1+(1−2α)/(1−z) then the classes introduced in the definition 5 and 6 are the familiar classes SS ∗ (α), CS(α) of starlike functions, convex functions with respect to symmetric points in U by Das and Singh[2]. If n = 1, α = 0 and g(z) = z/(1 − z), and h(z) = (1 + z)/(1 − z), then the classes introduced in the definitions 7 through 10 are the classes of starlike/convex functions with respect to conjugate and symmetric conjugate points in U introduced by El-Ashwah and Thomas[3]. Theorem 8. (i) If f ∈ SSgn (h) and φ ∈ Rα , then φ ∗ f ∈ SSgn (h). n (ii) SSgn (h) ⊂ SSφ∗g (h) for every function φ ∈ Rα .

Proof. Let f ∈ SSgn (h). Then 2z(g ∗ f )0 (z) ≺ h(z). (g ∗ f )n (z) − (g ∗ f )n (−z) Replacing z by k z(k = 0, 1, . . . , n − 1) and adding all these relations we get, using the convexity of h(z), that 2z(g ∗ f )0n (z) ≺ h(z). H(z) = (g ∗ f )n (z) − (g ∗ f )n (−z) This shows that (g ∗ f )n (z) is in SS ∗ (α) and therefore 1 G(z) = [(g ∗ f )n (z) − (g ∗ f )n (−z)] 2 ∗ is in S (α). A computation shows that φ ∗ (HG) 2z(φ ∗ g ∗ f )0 (z) = . φ∗G (φ ∗ g ∗ f )n (z) − (φ ∗ g ∗ f )n (−z)

8

V RAVICHANDRAN

Applying Theorem A, we have φ ∗ (HG) ≺ h(z) φ∗G and the result follows. Part (ii) can be proved easily and hence the proof is omitted.



Theorem 9. (i) SCgn (h) ⊂ SSgn (h) (ii) f ∈ SCgn (h) if and only if zf 0 ∈ SSgn (h). Proof. Let f ∈ SCgn (h). Let G(z) be the function defined in Theorem 8. Then one can easily show that G(z) is convex function in U . Then  Theorem B can be used to show f ∈ SSgn (h). Corollary 3. (i) If f ∈ SCgn (h) and φ ∈ Rα , then φ ∗ f ∈ SCgn (h). n (ii) SCgn (h) ⊂ SCφ∗g (h) for every function φ ∈ Rα .

Proof. The result follows easily from Theorems 8 and 9.



We state the following theorems without proof; a proof can be given as in Theorem 8 and 9 with appropriate modifications in the corresponding functions. Theorem 10. (i) CCgn (h) ⊂ CSgn (h) (ii) f ∈ CCgn (h) if and only if zf 0 ∈ CSgn (h). Theorem 11. Let the function φ ∈ Rα has real coefficients. (i) If f ∈ CSgn (h) and φ ∈ Rα , then φ ∗ f ∈ CSgn (h). n (ii) CSgn (h) ⊂ CSφ∗g (h) for every function φ ∈ Rα .

(iii) If f ∈ CCgn (h) and φ ∈ Rα , then φ ∗ f ∈ CCgn (h). n (iv) CCgn (h) ⊂ CCφ∗g (h) for every function φ ∈ Rα .

Theorem 12. (i) SCCgn (h) ⊂ SCSgn (h) (ii) f ∈ SCCgn (h) if and only if zf 0 ∈ SCSgn (h).

STARLIKE FUNCTIONS

9

Theorem 13. Let the function φ ∈ Rα has real coefficients. (i) If f ∈ SCSgn (h) and φ ∈ Rα , then φ ∗ f ∈ SCSgn (h). n (ii)SCSgn (h) ⊂ SCSφ∗g (h) for every function φ ∈ Rα .

(iii) If f ∈ SCCgn (h) and φ ∈ Rα , then φ ∗ f ∈ SCCgn (h). n (h) for every function φ ∈ Rα . (iv) SCCgn (h) ⊂ SCCφ∗g

References [1] R. Chand, and S. Singh, On Certain Schlicht Mappings, Indian J. pure appl. Math., 1979, 1167-1174. [2] R. N. Das, and P. Singh, On subclasses of schlicht mappings, Indian J. pure appl. Math, 8 (1977), 864–872. [3] R. M. El-Ashwah, and D. K. Thomas, Some subclasses of close to convex functions, J. Ramanujan Math. Soc., 2(1)(1987), 85–100. [4] T. H. MacGregor, A subordination for convex functions of order α, J. London Math. Soc., II, Ser. 2, (1975), 530-536. [5] I. Nezhmetdinov and S. Ponnusamy, On the class of univalent functions starlike with respect to N-symmetric points, Hokkaido Math. J., 31(2002), 61–77. [6] K. S. Padmanabhan, and R. Manjini, Certain applications of differential subordination, Pubi de L’Institut Mathe’Matique, 39(53) (1986), 107–118. [7] K. S. Padmanabhan, and R. Parvatham, Some applications of differential subordination, Bull. Austral Math. Soc., 32(3)(1985), 321–330. [8] S. Ponnusamy, Some applications of differential subordinations and convolution techniques to univalent functions, Ph. D. thesis, IIT-Kanpur, 1988. [9] F. Rønning, A survey on uniformly convex functions and uniformly starlike functions, Ann. Univ. Mariae Curie-Sklodowowska, Sect. A, 47(1993), 123– 134. [10] St. Ruscheweyh, Convolutions in Geometric Function Theory, Sem. Math. Sup, 83, Presses Univ. de Montreal, 1982. [11] T. N. Shanmugam, Convolution and Differential subordination, Inernat. J. Math & Math. Sci, 12(2)(1989), 333–340.

Department of Computer Applications, Sri Venkateswara College of Engineering, Sriperumbudur 602 105

FUNCTIONS STARLIKE WITH RESPECT TO N-PLY ...

J. Math & Math. Sci, 12(2)(1989), 333–340. Department of Computer Applications, Sri Venkateswara College of. Engineering, Sriperumbudur 602 105.

156KB Sizes 1 Downloads 194 Views

Recommend Documents

On Starlike Functions with Respect to N-Ply Conjugate ...
convex and close to convex functions of order a 0 < q, < I respectively ... inition 2.3 : A function f e A is close to convex rvith respect to n -ply cortjugatc poittts of.

On Starlike Functions with Respect to N-Ply Conjugate ...
?'tr:Y). (l+rn7 ". The results are sltarp. Proof:Let f -5':'''". Define p(z)--W. ' .f ,(z) + .f .... St. Ruscheweyh, Covolutions in Geonretric l'turctions theory, Sen. lvlatlt .Sap.

on starlike functions with negati\ze coefficients
r + zf "(z)f f'(") or zf '(z)lf e) lying in a given region in the right half plane; the region is often convex and symmetric with respect to the real axis [2]' Recently Ma and ...

Respect to the Environment Respect For Human - Infopack ...
0090 541 451 6234 (Whatsapp and Viber software is available for fast contact). [email protected] – [email protected]. https://www.facebook.com/profile.php?id=565804930. Page 2 of 2. Respect to the Environment Respect For Human -

Conceptualizing leadership with respect to its historical ...
Alternatively, transformational leadership theory argued that ''good'' leadership is achieved through more ... Theorists such as Clegg and Hardy (1996b) offer some interesting insights into how such an ...... Manz, C. C., & Sims, H. P. (1991).

A Review of Decision Support Formats with Respect to ... - CiteSeerX
Dept. of Computer Science and Computer Engineering, La Trobe University. Abstract ... On a micro level, computer implemented guidelines. (CIG) have the ...

A Review of Decision Support Formats with Respect to ... - CiteSeerX
best decision. This is difficult. The amount of medical information in the world is increasing. Human brain capacity is not. Computers have the potential to help ...

Direct Visual Servoing with respect to Rigid Objects - IEEE Xplore
Nov 2, 2007 - that the approach is motion- and shape-independent, and also that the derived control law ensures local asymptotic stability. Furthermore, the ...

Fun with Functions Accounts
Microsoft Excel: Fun with Functions. J. Dee Itri, Excel Maze. ○ Cell referencing. ○ Row numbers and column letters (E7, G4, BZ12). ○ =5+5 vs =A1+A2. ○ Ranges (A:A, 1:4, A5:B14). ○ The great and powerful “$” sign. ○ Relative (B5). ○

Statistics of wave functions in disordered systems with applications to ...
Our results are in good agreement with random matrix theory or its extensions for simple statistics such as the probability distribution of energy levels or spatial ...

Estimating Production Functions with Robustness ...
The literature on estimating production functions on panel data using control functions has focused mainly ... ∗We thank James Levinsohn for providing us with the Chilean manufacturing industry survey data. We also ...... analytical in the paramete

Counting with generating functions in MAXIMA - GitHub
In this paper we describe implementations of two counting methods which are based on generating func- ... Pólya theory [2] is an important counting method when some objects that are ...... [9] http://www.tcs.hut.fi/Software/bliss/index.html. 19.

A Review of Decision Support Formats with Respect ...
A Review of Decision Support Formats with Respect to Therapeutic. Guidelines Limited ... stakeholders in the Australian healthcare scene gain agreement on a generic decision support language, considering the .... is designed according to established

Law No. (02) for the year 2008 with respect to Food within the Emirate ...
(02) for the year 2008 with respect to Food within the Emirate of Abu Dhabi. Definitions. Article (1). The state of the United Arab Emirates. The State. The Emirate ...

Guidelines for Providing Certain Facilities in respect of persons with ...
Saya telah mengirimkan komplain ke Wa- hana melalui situs, email, whatsapp ke customer service pusat,. namun tidak ada solusi. Mohon tanggapan Wahana ...

Strong iISS: combination of iISS and ISS with respect to ...
u : R≥0 → Rm. |·| stands for the Euclidean norm. For a given u ∈ Um and and set I ⊂ R≥0, u := ess supt≥0 |u(t)| and uI := ess supt∈I |u(t)|. Given a constant R ...

Climate Surveys: Useful Tools to Help Colleges ... - Culture of Respect
However, surveys not based on science and best practices may not accurately measure the .... CHAPTER 1: GUIDELINES FOR CONDUCTING A CLIMATE SURVEY .... interviews, computer-assisted interviews, paper and pencil surveys, and online surveys. ... only m

Submodular Functions: from Discrete to Continuous Domains
Extension to continuous domains. – Application: proximal operator for non-convex regularizers. • Preprint available on ArXiv, second version (Bach, 2015) ...

Introduction to number theoretic functions
Jan 14, 2018 - generated by relatives of the Riemann zeta function, but there is a somewhat breathtaking general- ization that takes in all of these at a single ...

Applications of Homogeneous Functions to Geometric Inequalities ...
Oct 11, 2005 - natural number, f(x) ≥ 0, yields f(tx) ≥ 0 for any real number t. 2. Any x > 0 can be written as x = a b. , with a, b ... s − b, x3 = √ s − c, yields f. √ s(. √ s − a,. √ s − b,. √ s − c) = △. Furthermore, usi