2012
DOI: 10.1080/17476933.2010.487211
|View full text |Cite
|
Sign up to set email alerts
|

Convolutions of harmonic convex mappings

Abstract: Abstract. The first author proved that the harmonic convolution of a normalized right half-plane mapping with either another normalized right halfplane mapping or a normalized vertical strip mapping is convex in the direction of the real axis. provided that it is locally univalent. In this paper, we prove that in general the assumption of local univalency cannot be omitted. However, we are able to show that in some cases these harmonic convolutions are locally univalent. Using this we obtain interesting exampl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
85
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 67 publications
(86 citation statements)
references
References 9 publications
1
85
0
Order By: Relevance
“…Clearly V ⊂ U. In [13], Goodman proved that U ⊂ S * and V ⊂ K. It is easy to see that U ⊂ R and V ⊂ W. In fact, if f ∈ U is given by (9), then…”
Section: Class Wmentioning
confidence: 99%
See 3 more Smart Citations
“…Clearly V ⊂ U. In [13], Goodman proved that U ⊂ S * and V ⊂ K. It is easy to see that U ⊂ R and V ⊂ W. In fact, if f ∈ U is given by (9), then…”
Section: Class Wmentioning
confidence: 99%
“…In the harmonic case, with f = h +ḡ and F = H +Ḡ belonging to H, their harmonic convolution is defined as f * F = h * H +g * G. Harmonic convolutions are investigated in [7,8,9,12,33]. Suppose that I and J are subclasses of H. We say that a class I is closed under convolution if I * I ⊂ I, that is, if f , g ∈ I then f * g ∈ I.…”
Section: Letmentioning
confidence: 99%
See 2 more Smart Citations
“…Theorem B ( [7]). Let f = h + g ∈ R 0 H with the dilatation ω(z) = e iθ z n , where n ∈ Z + and θ ∈ R. If n = 1, 2, then f 0 * f ∈ S 0 H and is convex in the direction of the real axis.…”
Section: Introductionmentioning
confidence: 99%