🧭 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.

engineering
Abstract

In this paper we give sharp bounds of the difference of the moduli of the second and the first logarithmic coefficient for Bazilevič class of univalent functions.

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 Theorem 1. Let for some. Then The right estimation is sharp for all, while the left is sharp for, where and are the positive roots of the…
Theorem 1. Let $f \in \mathcal{B}_1(\alpha)$ for some $\alpha > 0$ . Then $$-\frac{1}{\sqrt{(\alpha+1)^2+1}} \le |\gamma_2| - |\gamma_1| \le \frac{1}{\alpha+2}.$$ The right estimation is sharp for all $\alpha > 0$ , while the left is sharp for $\alpha_1 \le \alpha \le \alpha_2$ , where $\alpha_1 = \frac{1}{2} \left( \sqrt{6} - 2 \right) = 0.2247 \dots$ and $\alpha_2 = \sqrt{2} - 1 = 0.4142 \dots$ are the positive roots of the equation $$2\alpha^4 + 8\alpha^3 + 5\alpha^2 - 6\alpha + 1 = 0.$$
Function classes studied:

Related Papers

On the logarithmic coefficients of Ma-Minda type convex functions
2026
Moduli difference of initial inverse logarithmic coefficients for starlike and c
2026
On Certain Classes of Bi-Bazilevic Functions Defined by q-Ruscheweyh Differentia
2025
Second Hankel determinant of logarithmic coefficients of inverse strongly starli
2024
A Class of Non-Bazilevic Functions Subordinate to Gegenbauer Polynomials
2024
↑↓ 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