A Generalization of Ruscheweyh's Univalence Criterion
โ Scribed by Horiana Ovesea
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 81 KB
- Volume
- 258
- Category
- Article
- ISSN
- 0022-247X
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we obtain, by the method of subordination chains, a sufficient condition for the analyticity and the univalence of the functions defined by an integral operator. In particular cases, I find the well-known conditions for univalency established by Ruscheweyh [7], Ahlfors [1], Becker [2], and Lewandowski [3].
๐ SIMILAR VOLUMES
## Abstract In this paper, we obtain an asymptotic generalization of Turรกn's theorem. We prove that if all the nonโtrivial eigenvalues of a __d__โregular graph __G__ on __n__ vertices are sufficiently small, then the largest __K__~__t__~โfree subgraph of __G__ contains approximately (__t__โโโ2)/(__
In this paper we are concerned with the following conjecture. Conjecture: Let L be a collection of k positive integers and In particular, we show this conjecture is true when L consists of k consecutive positive integers. This generalizes a well-known inequality of Fisher's. Our proof simplifies an