Certain subclasses of analytic and bi-univalent functions. (English) Zbl 1201.30020

Summary: We introduce and investigate two interesting subclasses of normalized analytic and univalent functions in the open unit disk \[ \mathbb U := \{z : z \in \mathbb C \quad \text{and} \quad |z| <1\}, \] whose inverse have univalent analytic continuations to \(\mathbb U\). Among other results, bounds for the Taylor-Maclaurin coefficients \(|a_{2}|\) and \(|a_{3}|\) are found in our investigation.


30C45 Special classes of univalent and multivalent functions of one complex variable (starlike, convex, bounded rotation, etc.)
Full Text: DOI


[1] Duren, P.L., ()
[2] Breaz, D.; Breaz, N.; Srivastava, H.M., An extension of the univalent condition for a family of integral operators, Appl. math. lett., 22, 41-44, (2009) · Zbl 1163.30304
[3] Srivastava, H.M.; Eker, S.S., Some applications of a subordination theorem for a class of analytic functions, Appl. math. lett., 21, 394-399, (2008) · Zbl 1138.30014
[4] Lewin, M., On a coefficient problem for bi-univalent functions, Proc. amer. math. soc., 18, 63-68, (1967) · Zbl 0158.07802
[5] ()
[6] Netanyahu, E., The minimal distance of the image boundary from the origin and the second coefficient of a univalent function in \(| z | < 1\), Arch. rational mech. anal., 32, 100-112, (1969) · Zbl 0186.39703
[7] Brannan, D.A.; Taha, T.S., On some classes of bi-univalent functions, (), Studia univ. babeş-bolyai math., 31, 2, 70-77, (1986), see also · Zbl 0614.30017
[8] T.S. Taha, Topics in Univalent Function Theory, Ph.D. Thesis, University of London, 1981.
[9] Brannan, D.A.; Clunie, J.; Kirwan, W.E., Coefficient estimates for a class of star-like functions, Canad. J. math., 22, 476-485, (1970) · Zbl 0197.35602
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.