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

Results & Lemmas (8)

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 8.4 · coeff Theorem 8.4]). The best upper bounds for univalent functions’ logarithmic coefficients for n ≥3 remain a conundrum, though, apparently. If…
Theorem 8.4]). The best upper bounds for univalent functions’ logarithmic coefficients for n ≥3 remain a conundrum, though, apparently. If f is given by (1) then, by matching the coefficients of zn in (2) for n = 1, 2, 3 it concludes 2γ1 = a2, 2γ2 = a3 −1 2a2 2, 2γ3 = a4 −a2a3 + 1 3a3 2. (3) Further, due to the significance of the recent studies about the logarithmic coefficients, the problem obtaining the sharp bounds for the second Hankel determinant of these coefficients, that is H2,1(Ff/2) w
Lemma 1 Lemma 1 ([6], Lemma 2.1). If ϑ(z) = P∞ n=1 ϑnzn ∈Ω, then for some p, q, with |p| ≤1 and |q| ≤1 ϑ2 = p 1 −ϑ2 1 , ϑ3 = 1 −ϑ2 1  1 −|p|2…
Lemma 1 ([6], Lemma 2.1). If ϑ(z) = P∞ n=1 ϑnzn ∈Ω, then for some p, q, with |p| ≤1 and |q| ≤1 ϑ2 = p 1 −ϑ2 1  , ϑ3 = 1 −ϑ2 1  1 −|p|2 q −ϑ1 1 −ϑ2 1
Theorem 1. Theorem 1. If f ∈S∗ s(ψ), with ψ(z) = 1 + P∞ n=1 Gnzn, then |H2,1(Ff/2)| ≤|G1| 16 ·    4MO −N 2 4M, if M < 0 and M ≤−N 2 ≤0; max O; M +…
Theorem 1. If f ∈S∗ s(ψ), with ψ(z) = 1 + P∞ n=1 Gnzn, then |H2,1(Ff/2)| ≤|G1| 16 ·    4MO −N 2 4M , if M < 0 and M ≤−N 2 ≤0; max {O; M + N + O} ,
Corollary 1. Corollary 1. If f ∈S∗ s(σ), then |H2,1(Ff/2)| ≤(1 −σ)2 4. This result is sharp for f(z) = z (1−z2)(1−σ) = z + (1 −σ)z3 +..., z ∈D.
Corollary 1. If f ∈S∗ s(σ), then |H2,1(Ff/2)| ≤(1 −σ)2 4 . This result is sharp for f(z) = z (1−z2)(1−σ) = z + (1 −σ)z3 + . . . , z ∈D.
Corollary 2. Corollary 2. If f ∈S∗ s,L, then |H2,1(Ff/2)| ≤1 64. This bound is sharp for the function f2 ∈A given by 2zf ′ 2(z) f2(z) −f2(−z) = √ 1 +…
Corollary 2. If f ∈S∗ s,L, then |H2,1(Ff/2)| ≤1 64. This bound is sharp for the function f2 ∈A given by 2zf ′ 2(z) f2(z) −f2(−z) = √ 1 + z2, that is for f2(z) = z + z3/4 + . . . .
Corollary 3. Corollary 3. If S∗ s 1+z 1−z α, then |H2,1(Ff/2)| ≤α2 4. This bound is sharp for the function fα ∈A given by 2zf ′ α(z) fα(z) −fα(−z)…
Corollary 3. If S∗ s 1+z 1−z α , then |H2,1(Ff/2)| ≤α2 4 . This bound is sharp for the function fα ∈A given by 2zf ′ α(z) fα(z) −fα(−z) = 1 + z2 1 −z2 α
Theorem 2. Theorem 2. If f ∈Cs(ψ) with ψ(z) = 1 + ∞ P n=1 Gnzn, then |H2,1(Ff/2)| ≤1 4 · ( 4WY −X2 4W, if W < 0 and W ≤−X 2 ≤0; max Y; W + X + Y,…
Theorem 2. If f ∈Cs(ψ) with ψ(z) = 1 + ∞ P n=1 Gnzn, then |H2,1(Ff/2)| ≤1 4 · ( 4WY −X2 4W , if W < 0 and W ≤−X 2 ≤0; max {Y ; W + X + Y } , otherwise,
Corollary 4 · coeff Corollary 4 ([1], Theorem 2.4). If f ∈Ks, then |H2,1(Ff/2)| ≤ 1 36. This result is sharp for f(z) = 1 2 log 1+z 1−z. REFERENCES 1. V. Allu,…
Corollary 4 ([1], Theorem 2.4). If f ∈Ks, then |H2,1(Ff/2)| ≤ 1 36. This result is sharp for f(z) = 1 2 log 1+z 1−z. REFERENCES 1. V. Allu, V. Arora, A. Shaji, On the second Hankel determinant of logarithmic coefficients for certain univalent functions, Mediterr. J. Math., 20 (2023), 81. https://doi.org/10.1007/s00009-023-02272-x 2. S.Z.H. Bukhari, T. Bulboac˘a,
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
✦ 293 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