🧭 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

The authors consider the class $\F$ of normalized functions $f$ analytic in the unit disk $\ID$ and satisfying the condition $${\rm Re}\left(1+\frac{zf''(z)}{f'(z)}\right)>-\frac{1}{2},\quad z\in\D. $$ Recently, Ponnusamy et al. \cite{samy-hiroshi-swadesh} have shown that $1/6$ is the uniform sharp bound for the radius of convexity of every section of each function in the class $\F$. They conjectured that $1/3$ is the uniform univalence radius of every section of $f\in \F$. In this paper, we sol

Results & Lemmas (1)

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.

Theorem 1. · radius Theorem 1. Every section sn(f) of f ∈F satisfies Re (sn(f)′(z)) > 0 in the disk |z| < 1/3. In particular every section is close-to-convex in…
Theorem 1. Every section sn(f) of f ∈F satisfies Re (sn(f)′(z)) > 0 in the disk |z| < 1/3. In particular every section is close-to-convex in the disk |z| < 1/3. The radius 1/3 cannot be replaced by a greater one. We remark that this result is much stronger than the original conjecture. The following lemma is useful in the proof of Theorem 1. Lemma E. [12, Lemma 1] If f(z) = z+P∞ n=2 anzn ∈F, then the following estimates hold: (a) |an| ≤n + 1 2 for n ≥2. Equality holds for f0(z) given by (3) or it
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