🧭 New here?
Take a guided tour of the site.
← Back to Papers

Continue from this paper

Indexing is not verification. Extracted statements should be checked against the source.

Abstract

In this paper, we obtain various conditions on the parameters $a,\, b,\, c\,, d$ and $e$ for which the hypergeometric functions $z\,_3F_2(a,b,c;d,e;z)$ to be in the class of all close-to-convex function with respect to some well known convex functions.

Results & Lemmas (7)

Each result is auto-extracted from the paper via OCR - the math is shown verbatim and may carry occasional transcription artifacts. Click to expand the full statement.

Lemma 5. Lemma 5. [7] If An ≥0, nAn and nAn −(n + 1)An+1 both are non-increasing, i.e., nAn is monotone of order 2, then f defined by (3) is in S∗.
Lemma 5. [7] If An ≥0, {nAn} and {nAn −(n + 1)An+1} both are non-increasing, i.e., {nAn} is monotone of order 2, then f defined by (3) is in S∗.
Lemma 6. Lemma 6. [8] Suppose that 1 ≥2A2 ≥· · · ≥nAn ≥· · · ≥0 or 1 ≦2A2 ≤· · · ≤nAn ≤· · · ≤2 Then f(z) is defined by (3) is close-to-convex with…
Lemma 6. [8] Suppose that 1 ≥2A2 ≥· · · ≥nAn ≥· · · ≥0 or 1 ≦2A2 ≤· · · ≤nAn ≤· · · ≤2 Then f(z) is defined by (3) is close-to-convex with respect to −log(1 −z).
Lemma 7. Lemma 7. [8] Suppose that f is an odd function ( i.e., the value of A2n in (3) is zero for each n ≥1 ) such that 1 ≥3A3 ≥· · · ≥(2n +…
Lemma 7. [8] Suppose that f is an odd function ( i.e., the value of A2n in (3) is zero for each n ≥1 ) such that 1 ≥3A3 ≥· · · ≥(2n + 1)A2n+1 ≥· · · ≥0 or 1 ≤3A3 ≤· · · ≤(2n + 1)A2n+1 ≤· · · ≤2 Then f ∈S. In fact, f(z) is close-to-convex with respect to the convex function 1 2 log((1+ z)/(1 −z)). In 1986, Ruscheweyh and Singh [3] obtained the sufficient conditions on the parame- ters a, b and c for z 2F1(a, b; c; z) to be starlike of order β < 1. Further the year 1995, Ponnusamy and Vourinen [4] h
Theorem 8. Theorem 8. If a, b, c > 0, de ≥2 a b c and d + e ≥Max  a + b + c, 1 2(ab + bc + ac + 2(a + b + c) −1 −2abc), 2[ab + bc + ac] −3abc , then…
Theorem 8. If a, b, c > 0, de ≥2 a b c and d + e ≥Max  a + b + c, 1 2(ab + bc + ac + 2(a + b + c) −1 −2abc), 2[ab + bc + ac] −3abc  , then z 3F2(a, b, c; d, e; z) is close-to-convex with respect to −log(1 −z).
Theorem 10. Theorem 10. If a, b, c > 0, de ≥3abc and d + e ≥Max a + b + c, α(a, b, c), 3(a b + b c + a c) −7a b c (11) where α(a, b, c) = 1 3 ((2(a b +…
Theorem 10. If a, b, c > 0, de ≥3abc and d + e ≥Max {a + b + c, α(a, b, c), 3(a b + b c + a c) −7a b c} (11) where α(a, b, c) = 1 3 ((2(a b + b c + a c) + 3(a + b + c) −6 a b c −1) then z 3F2(a, b, c; d, e; z2) is close-to-convex with respect to 1 2 log((1 + z)/(1 −z)).
Theorem 13. Theorem 13. Let a, b, and c > 0, d + e ≥Max T1(a, b, c), T2(a, b, c), T3(a, b, c), T4(a, b, c)
Theorem 13. Let a, b, and c > 0, d + e ≥Max {T1(a, b, c), T2(a, b, c), T3(a, b, c), T4(a, b, c)}
Theorem 16. Theorem 16. Let a, b, and c > 0. Suppose that d + e ≥max T1(a, b, c), T2(a, b, c), T3(a, b, c) where T1(a, b, c) = (e + d −c −b −a + 1) (e…
Theorem 16. Let a, b, and c > 0. Suppose that d + e ≥max{T1(a, b, c), T2(a, b, c), T3(a, b, c)} where T1(a, b, c) = (e + d −c −b −a + 1) (e + d −c −b −a + 2) , T2(a, b, c) = 2 (e + d −c −b −a + 2) (d e + 2 e + 2 d −b c −a c −c −a b −b −a + 1) , T3(a, b, c) = d2 + 7 d + 5  e2 + 7 d2 + ((−2 b −2 a −4) c + (−2 a −4) b −4 a + 21) d
Function classes studied:

Related Papers

Zalcman Conjecture for Starlike Mappings in Higher Dimensions
2026
Generalized Zalcman Conjecture for Starlike Mappings in Several Complex Variable
2026
On the logarithmic coefficients of Ma-Minda type convex functions
2026
Logarithmic Coefficients Problems of Geometric Subclass of Closed-to-convex Func
2026
The sharp refined Bohr inequalities for a subclass of close-to-convex harmonic m
2026
↑↓ navigate↵ openesc closeall results
✦ 291 explorers have wandered the registry - thanks for stopping by. Tell us what you'd like to see →
Usage & privacy

We use first-party site metrics to improve navigation: page visits, internal clicks, search result counts (not search terms), and approximate active time. A random tab ID groups events for seven days; GPC/DNT turns this off. The separate visitor count uses a self-hosted pseudonymous fingerprint and also respects GPC/DNT.

💬 Feedback