SlideShare une entreprise Scribd logo
1  sur  5
Télécharger pour lire hors ligne
Mathematical Theory and Modeling                                                                                        www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.4, 2012


                          The Univalence of Some Integral Operators
                                                           Deborah O. Makinde
                      Department of Mathematics, Obafemi Awolowo University, Ile-Ife, Osun State, Nigeria
                          E-mail : domakinde.comp@gmail.com;           domakinde@oauife.edu.ng


Abstract
In this paper, we obtain the conditions for univalence of the integral operators of
the form:
And                                             1/ 
                             g (s) 
                          z             k
     F ( z )    t   i  1/𝜆
                               1
                                         ds
𝐻(𝑧) = {𝜆      𝑡          (
                             ) 𝜆−1 𝑑𝑠}
                 0 ∏ 𝑘 i 1 𝑔 𝑖 (𝑠) s
              𝑧 𝜆−1
                     ∫0            𝑖=1      𝑠
AMS Mathematics Subject Classification: 30C45.
Key Words: Integral operator, Univalent.
        1.         Introduction
Let 𝐴 be the class of the functions in the unit disk 𝑈 = {𝑍 ∈ 𝐶: |𝑧| < 1 such that 𝑓(0) = 𝑓 ′ (0) − 1 = 0.
Let 𝑆 be the class of functions 𝑓 ∈ 𝐴 which are univalent in 𝑈. Ozaki and Nunokawa [2] showed the
condition for the univalence of the function 𝑓 ∈ 𝐴 as given in the lemma below.
Lemma 1 [3]: Let 𝑓 ∈ 𝐴 satisfy the condition
     𝑧 2 𝑓 ′ (𝑧)
 |                 − 1| ≤ 1                                                                                                        (1)
      𝑓 2(𝑧)

For all 𝑧 ∈ 𝑈, then 𝑓 is univalent in 𝑈
Lemma 2 [2]: Let 𝛼 be a complex number,                     𝛼 > 0 , and 𝑓 ∈ 𝐴. If
                                                       1 − |𝑧|2𝑅𝑒𝛼 𝑧𝑓 ′′ (𝑧)
                                                                  | ′       |≤1
                                                           𝑅𝑒𝛼      𝑓 (𝑧)

                                                            𝑧              1⁄
                                                                              𝛼
For all 𝑧 ∈ 𝑈, then the function 𝐹 𝛼 (𝑧) = [𝛼 ∫ 𝑈 𝛼−1 𝑓 ′ (𝑢)𝑑𝑢]
                                               0

Is in the class 𝑆.
The Schwartz lemma [1] : Let the analytic function 𝑓 be regular in the unit disk and let 𝑓(0) = 0. If
|𝑓(𝑧)| ≤ 1, then
 |𝑓(𝑧)| ≤ |𝑧|
For all 𝑧 ∈ 𝑈, where equality can hold only if |𝑓(𝑧)| ≡ 𝐾𝑧 and 𝑘 = 1
Lemma 3 [4]: Let 𝑔 ∈ 𝐴 satisfies (1) and 𝑎 + 𝑏 𝑖 a complex number, 𝑎, 𝑏 satisfies the conditions
          3 3                  1
𝑎 ∈ [ , ] ; 𝑏 ∈ [0,                 ]                                                                                             (2)
          4 2                 2√2

8𝑎2 + 𝑎9 𝑏 2 − 18𝑎 + 9 ≤ 0                                                                                                         (3)
                                                                                                                 1
                                                                                  𝑧   𝑔(𝑢)     𝑎+𝑏 𝑖 −1         𝑎+𝑏 𝑖
If |𝑔(𝑧) ≤ 1| for all 𝑧 ∈ 𝑈 then the function 𝐺(𝑧) = {𝑎 + 𝑏 𝑖 ∫ (
                                                               0
                                                                                           )              𝑑𝑢}
                                                                                       𝑢



                                                                 91
Mathematical Theory and Modeling                                                                                                                            www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.4, 2012

Is univalent in 𝑈
     1.        MAIN RESULTS

Theorem 1: Let 𝑔 ∈ 𝐴 satisfies (1) and 𝜆 is a complex number, 𝜆 satisfies the conditions
 𝑅𝑒𝜆 ∈ (0, √𝑘 + 2], 𝑘 ≥ 1                                                                                                                                             (4)
(𝑅𝑒𝜆)4 (𝑅𝑒𝜆)2 (𝐼𝑚𝜆)2                                 − (𝑘 + 2) ≥ 0             2
                                                                                                                                                                      (5)
If |𝑔(𝑧)| ≤ 1 for all 𝑧 ∈ 𝑈 then the function
                                                                               1/ 
                                                   g (s) 
                            z                    k

                                              is 
                                     1
    F ( z)    t                                                                    ds Is univalent in 𝑈
                            0                i 1        
Proof: Let
                                    z                 k                             1/ 
                                                          g ( s)
                                                      ( is )
                                              1
         F ( z)    t                                                                    ds
                                    0                i 1


                    𝑘                    𝑧                     𝑔 𝑖 (𝑠) 1/𝜆
And let 𝑓(𝑧) = ∫ ∏ 𝑖=1 (
                0
                                                                       )           𝑑𝑠                                                                                 (6)
                                                                   𝑠




                          𝑘                          𝑔 𝑖 (𝑧) 1/𝜆
Then         𝑓 ′ (𝑧) = ∏ 𝑖=1 (                                 )
                                                          𝑧

                                        𝑔1 (𝑠) 1/𝜆                 𝑔2 (𝑠) 1/𝜆                   𝑔 𝑘 (𝑠) 1/𝜆
                         =(                      )            (            )          …(                )
                                             𝑠                         𝑠                           𝑠
                                                                               1                       1 ′                                  1          1
                                    𝑔1 (𝑠) 1/𝜆                     𝑔2 (𝑠) 𝜆                𝑔 𝑘 (𝑠)      𝜆         𝑔1 (𝑠) 1/𝜆            𝑔2 (𝑠) 𝜆  𝑔 (𝑠) 𝜆
           𝑓 ′′ (𝑧) = (                          )            [(         )         …(                ) ] + [(            )     ] ′ [(         ) …( 𝑘 ) ]
                                         𝑠                            𝑠                       𝑠                      𝑠                     𝑠        𝑠

          𝑧𝑓 ′′ (𝑧)         1           𝑧𝑔′ 1 (𝑧)                          1       𝑧𝑔′ 2 (𝑧)                 1    𝑧𝑔′ 𝑘 (𝑧)
                      = (                             − 1) + (                                    − 1) … (                    − 1)
           𝑓 ′ (𝑧)              𝜆        𝑔1 (𝑧)                            𝜆        𝑔1 (𝑧)                    𝜆    𝑔1 (𝑧)

                            1
                            𝑘                        𝑧𝑔′ 𝑖 (𝑧)
                       = ∑ 𝑖=1 (                                       − 1)
                                𝜆                     𝑔1 (𝑧)

This implies that
1−|𝑧|2𝑅𝑒𝜆 𝑧𝑓 ′′ (𝑧)                      1−|𝑧|2𝑅𝑒𝜆 1                   𝑘              𝑧𝑔′ 𝑖 (𝑧)
              |             |=                                     |∑ 𝑖=1                         − 1|
    𝑅𝑒𝜆           𝑓 ′ (𝑧)                        𝑅𝑒𝜆           |𝜆|                     𝑔1 (𝑧)

                                         1−|𝑧|2𝑅𝑒𝜆 1                        𝑘           𝑧𝑔′ 𝑖 (𝑧)
                                    ≤                                  (|∑ 𝑖=1                       | + 1)
                                                 𝑅𝑒𝜆           |𝜆|                       𝑔1 (𝑧)

                                         1−|𝑧|2𝑅𝑒𝜆 1                        𝑘           𝑧 2 𝑔′ 𝑖 (𝑧)   𝑔 (𝑧)
                                    ≤                                  (|∑ 𝑖=1                       || 𝑖 |       + 1)                                               (7)
                                                 𝑅𝑒𝜆           |𝜆|                        𝑔2 1 (𝑧)       𝑧



Using Schwartz-lemma in (7), we have
 1−|𝑧|2𝑅𝑒𝜆 𝑧𝑓 ′′ (𝑧)                         1−|𝑧|2𝑅𝑒𝜆 1                    𝑘              𝑧 2 𝑔′ 𝑖 (𝑧)
                  |                 |≤                                 (|∑ 𝑖=1                            − 1| + 2)
     𝑅𝑒𝜆              𝑓 ′ (𝑧)                        𝑅𝑒𝜆           |𝜆|                      𝑔2 1 (𝑧)

But 𝑔 satisfies (1), thus
    𝑘     𝑧 2 𝑔′ 𝑖 (𝑧)
|∑ 𝑖=1                   − 1| ≤ 𝑘
            𝑔2 1 (𝑧)



                                                                                                                   92
Mathematical Theory and Modeling                                                                                         www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.4, 2012

This implies that
     𝑧𝑓 ′′ (𝑧)        1−|𝑧|2𝑅𝑒𝜆 1                                     𝑘+2
 |               |≤                        (𝑘 + 2) ≤                                                                               (8)
      𝑓 ′ (𝑧)                 𝑅𝑒𝜆    |𝜆|                          𝑅𝑒𝜆|𝜆|

From (4) and (5), we have
     𝑘+2
                ≤1                                                                                                                 (9)
  𝑅𝑒𝜆|𝜆|


                                                 1−|𝑧|2𝑅𝑒𝜆 𝑧𝑓 ′′ (𝑧)
Using (9) in (8), we obtain                                           |             |≤1
                                                        𝑅𝑒𝜆               𝑓 ′ (𝑧)


                          𝑘                             𝑔 𝑘 (𝑠) 1/𝜆
And from (6) 𝑓 ′ (𝑧) = ∏ 𝑖=1 (                                   )
                                                            𝑠

And by lemma 2 𝐹(𝑧) is univalent                                                                                                  ∎


Theorem 2                           Let 𝑔 ∈ 𝐴 satisfies (1) and let 𝜆 be a complex number with 𝑅𝑒𝜆, 𝐼𝑚𝜆 satisfying (2)
and (3). If |𝑔(𝑧)| ≤ 1 for all 𝑧 ∈ 𝑈 then the function
                                                                                                     𝑘             1/𝜆
                                                                                          𝑧
                                                                                              𝜆−1
                                                                                                       𝑔 𝑖 (𝑠) 𝜆−1
                                                                  𝐻(𝑧) = {𝜆 ∫ 𝑡                     ∏(        ) }
                                                                                      0                    𝑠
                                                                                                    𝑖=1

Is univalent in 𝑈.
Proof: Let
                         𝑧                    𝑔 𝑖 (𝑠)       𝜆−1 1/𝜆
                      𝑘
 𝐻(𝑧) = {𝜆 ∫ 𝑡 𝜆−1 ∏ 𝑖=1 (
            0
                                                        )         }                                                               (10)
                                                𝑠

Following the procedure of the proof of theorem 1, we obtain
                                                                                                              𝑘
                                     1 − |𝑧|2𝑅𝑒𝜆 𝑧ℎ′′ (𝑧)   1 − |𝑧|2𝑅𝑒𝜆            𝑧 2 𝑔′ (𝑧)
                                                | ′      |≤             |𝜆 − 1| (|∑ 2 𝑖       − 1| + 2)
                                         𝑅𝑒𝜆     ℎ (𝑧)          𝑅𝑒𝜆                  𝑔 1 (𝑧)
                                                                                                             𝑖=1

But 𝑔 satisfies (1), thus
                                     1 − |𝑧|2𝑅𝑒𝜆 𝑧ℎ′′ (𝑧)    1 − |𝑧|2𝑅𝑒𝜆                  |𝜆 − 1|(𝑘 + 2)
                                                | ′       |≤             |𝜆 − 1|(𝑘 + 2) ≤
                                         𝑅𝑒𝜆     ℎ (𝑧)           𝑅𝑒𝜆                            𝑅𝑒𝜆
From (2) and (3) we have
|𝜆−1|(𝑘+2)
                     ≤1
       𝑅𝑒𝜆

This implies that
1−|𝑧|2𝑅𝑒𝜆 𝑧ℎ′′ (𝑧)
                 |            | ≤ 1 for all 𝑧 ∈ 𝑈
      𝑅𝑒𝜆            ℎ′ (𝑧)


                                                 𝑔(𝑧)           𝜆−1
                       𝑘
From (10), ℎ′ (𝑧) = ∏ 𝑖=1 (                             )
                                                    𝑧

And by lemma 2, 𝐻(𝑧) is univalent in 𝑈                                                                                            ∎
Remark: Theorem 1and theorem 2 gives a generalization of theorem 1[4] and lemma 3 respectively,.




                                                                                                93
Mathematical Theory and Modeling                                                               www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.4, 2012

References
Mayer O, (1981). The function theory of one complex variable Bucuresti
Oaaki, S., & Nunokawa, M. (1972). The Schwarzian derivative and univalent function.Proc. Amer. Math.
    Soc. 33(2), 392-394
Pescar, V., (2006). Univalence of certain integral operators. . Acta Universitatis Apulensis, 12, 43-48
Pescar, V., & Breaz, D. (2008). Some integral and their univalence. Acta Universitatis Apulensis, 15,
     147-152




                                                      94
International Journals Call for Paper
The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals
usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should
send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org

Business, Economics, Finance and Management               PAPER SUBMISSION EMAIL
European Journal of Business and Management               EJBM@iiste.org
Research Journal of Finance and Accounting                RJFA@iiste.org
Journal of Economics and Sustainable Development          JESD@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Developing Country Studies                                DCS@iiste.org
Industrial Engineering Letters                            IEL@iiste.org


Physical Sciences, Mathematics and Chemistry              PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Chemistry and Materials Research                          CMR@iiste.org
Mathematical Theory and Modeling                          MTM@iiste.org
Advances in Physics Theories and Applications             APTA@iiste.org
Chemical and Process Engineering Research                 CPER@iiste.org


Engineering, Technology and Systems                       PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems              CEIS@iiste.org
Innovative Systems Design and Engineering                 ISDE@iiste.org
Journal of Energy Technologies and Policy                 JETP@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Control Theory and Informatics                            CTI@iiste.org
Journal of Information Engineering and Applications       JIEA@iiste.org
Industrial Engineering Letters                            IEL@iiste.org
Network and Complex Systems                               NCS@iiste.org


Environment, Civil, Materials Sciences                    PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science                  JEES@iiste.org
Civil and Environmental Research                          CER@iiste.org
Journal of Natural Sciences Research                      JNSR@iiste.org
Civil and Environmental Research                          CER@iiste.org


Life Science, Food and Medical Sciences                   PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare            JBAH@iiste.org
Food Science and Quality Management                       FSQM@iiste.org
Chemistry and Materials Research                          CMR@iiste.org


Education, and other Social Sciences                      PAPER SUBMISSION EMAIL
Journal of Education and Practice                         JEP@iiste.org
Journal of Law, Policy and Globalization                  JLPG@iiste.org                       Global knowledge sharing:
New Media and Mass Communication                          NMMC@iiste.org                       EBSCO, Index Copernicus, Ulrich's
Journal of Energy Technologies and Policy                 JETP@iiste.org                       Periodicals Directory, JournalTOCS, PKP
Historical Research Letter                                HRL@iiste.org                        Open Archives Harvester, Bielefeld
                                                                                               Academic Search Engine, Elektronische
Public Policy and Administration Research                 PPAR@iiste.org                       Zeitschriftenbibliothek EZB, Open J-Gate,
International Affairs and Global Strategy                 IAGS@iiste.org                       OCLC WorldCat, Universe Digtial Library ,
Research on Humanities and Social Sciences                RHSS@iiste.org                       NewJour, Google Scholar.

Developing Country Studies                                DCS@iiste.org                        IISTE is member of CrossRef. All journals
Arts and Design Studies                                   ADS@iiste.org                        have high IC Impact Factor Values (ICV).

Contenu connexe

Tendances

11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...Alexander Decker
 
Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...Alexander Decker
 
3.common fixed point theorem for compatible mapping of type a -21-24
3.common fixed point theorem for compatible mapping of type a -21-243.common fixed point theorem for compatible mapping of type a -21-24
3.common fixed point theorem for compatible mapping of type a -21-24Alexander Decker
 
11.0003www.iiste.org call for paper.common fixed point theorem for compatible...
11.0003www.iiste.org call for paper.common fixed point theorem for compatible...11.0003www.iiste.org call for paper.common fixed point theorem for compatible...
11.0003www.iiste.org call for paper.common fixed point theorem for compatible...Alexander Decker
 
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...Leo Asselborn
 
On The Zeros of Certain Class of Polynomials
On The Zeros of Certain Class of PolynomialsOn The Zeros of Certain Class of Polynomials
On The Zeros of Certain Class of PolynomialsIJMER
 
Generalization of Tensor Factorization and Applications
Generalization of Tensor Factorization and ApplicationsGeneralization of Tensor Factorization and Applications
Generalization of Tensor Factorization and ApplicationsKohei Hayashi
 
The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)theijes
 
tensor-decomposition
tensor-decompositiontensor-decomposition
tensor-decompositionKenta Oono
 
NIPS2010: optimization algorithms in machine learning
NIPS2010: optimization algorithms in machine learningNIPS2010: optimization algorithms in machine learning
NIPS2010: optimization algorithms in machine learningzukun
 
1 hofstad
1 hofstad1 hofstad
1 hofstadYandex
 
Principal component analysis and matrix factorizations for learning (part 3) ...
Principal component analysis and matrix factorizations for learning (part 3) ...Principal component analysis and matrix factorizations for learning (part 3) ...
Principal component analysis and matrix factorizations for learning (part 3) ...zukun
 
11.[95 103]solution of telegraph equation by modified of double sumudu transf...
11.[95 103]solution of telegraph equation by modified of double sumudu transf...11.[95 103]solution of telegraph equation by modified of double sumudu transf...
11.[95 103]solution of telegraph equation by modified of double sumudu transf...Alexander Decker
 
The multilayer perceptron
The multilayer perceptronThe multilayer perceptron
The multilayer perceptronESCOM
 
Mac331 complex analysis_mfa_week6_16-10-20 (1)
Mac331 complex analysis_mfa_week6_16-10-20 (1)Mac331 complex analysis_mfa_week6_16-10-20 (1)
Mac331 complex analysis_mfa_week6_16-10-20 (1)KINGSHUKMUKHERJEE11
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
 
11.solution of linear and nonlinear partial differential equations using mixt...
11.solution of linear and nonlinear partial differential equations using mixt...11.solution of linear and nonlinear partial differential equations using mixt...
11.solution of linear and nonlinear partial differential equations using mixt...Alexander Decker
 

Tendances (19)

11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...11.fixed point theorem of discontinuity and weak compatibility in non complet...
11.fixed point theorem of discontinuity and weak compatibility in non complet...
 
Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...Fixed point theorem of discontinuity and weak compatibility in non complete n...
Fixed point theorem of discontinuity and weak compatibility in non complete n...
 
Fdtd
FdtdFdtd
Fdtd
 
3.common fixed point theorem for compatible mapping of type a -21-24
3.common fixed point theorem for compatible mapping of type a -21-243.common fixed point theorem for compatible mapping of type a -21-24
3.common fixed point theorem for compatible mapping of type a -21-24
 
11.0003www.iiste.org call for paper.common fixed point theorem for compatible...
11.0003www.iiste.org call for paper.common fixed point theorem for compatible...11.0003www.iiste.org call for paper.common fixed point theorem for compatible...
11.0003www.iiste.org call for paper.common fixed point theorem for compatible...
 
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...
Robust Control of Uncertain Switched Linear Systems based on Stochastic Reach...
 
On The Zeros of Certain Class of Polynomials
On The Zeros of Certain Class of PolynomialsOn The Zeros of Certain Class of Polynomials
On The Zeros of Certain Class of Polynomials
 
Generalization of Tensor Factorization and Applications
Generalization of Tensor Factorization and ApplicationsGeneralization of Tensor Factorization and Applications
Generalization of Tensor Factorization and Applications
 
The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)The International Journal of Engineering and Science (The IJES)
The International Journal of Engineering and Science (The IJES)
 
Md2521102111
Md2521102111Md2521102111
Md2521102111
 
tensor-decomposition
tensor-decompositiontensor-decomposition
tensor-decomposition
 
NIPS2010: optimization algorithms in machine learning
NIPS2010: optimization algorithms in machine learningNIPS2010: optimization algorithms in machine learning
NIPS2010: optimization algorithms in machine learning
 
1 hofstad
1 hofstad1 hofstad
1 hofstad
 
Principal component analysis and matrix factorizations for learning (part 3) ...
Principal component analysis and matrix factorizations for learning (part 3) ...Principal component analysis and matrix factorizations for learning (part 3) ...
Principal component analysis and matrix factorizations for learning (part 3) ...
 
11.[95 103]solution of telegraph equation by modified of double sumudu transf...
11.[95 103]solution of telegraph equation by modified of double sumudu transf...11.[95 103]solution of telegraph equation by modified of double sumudu transf...
11.[95 103]solution of telegraph equation by modified of double sumudu transf...
 
The multilayer perceptron
The multilayer perceptronThe multilayer perceptron
The multilayer perceptron
 
Mac331 complex analysis_mfa_week6_16-10-20 (1)
Mac331 complex analysis_mfa_week6_16-10-20 (1)Mac331 complex analysis_mfa_week6_16-10-20 (1)
Mac331 complex analysis_mfa_week6_16-10-20 (1)
 
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...IJCER (www.ijceronline.com) International Journal of computational Engineerin...
IJCER (www.ijceronline.com) International Journal of computational Engineerin...
 
11.solution of linear and nonlinear partial differential equations using mixt...
11.solution of linear and nonlinear partial differential equations using mixt...11.solution of linear and nonlinear partial differential equations using mixt...
11.solution of linear and nonlinear partial differential equations using mixt...
 

En vedette

Real time web kent geen bestemmingen
Real time web kent geen bestemmingenReal time web kent geen bestemmingen
Real time web kent geen bestemmingenEdwin Mijnsbergen
 
Harmonious volunteer center orientation presentation 2014
Harmonious volunteer center orientation presentation 2014Harmonious volunteer center orientation presentation 2014
Harmonious volunteer center orientation presentation 2014Irvin Shannon
 
Research into roducts
Research into roducts Research into roducts
Research into roducts paris12346
 
Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...
Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...
Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...André de Boer
 
Подъем контентного проекта.
Подъем контентного проекта. Подъем контентного проекта.
Подъем контентного проекта. Gulim Amirkhanova
 
Inventarisatie innovatie-openbaar-biblitheekwerk-2013
Inventarisatie innovatie-openbaar-biblitheekwerk-2013Inventarisatie innovatie-openbaar-biblitheekwerk-2013
Inventarisatie innovatie-openbaar-biblitheekwerk-2013Edwin Mijnsbergen
 

En vedette (8)

Real time web kent geen bestemmingen
Real time web kent geen bestemmingenReal time web kent geen bestemmingen
Real time web kent geen bestemmingen
 
Closing the Loop: Funding Comprehensive Internationalization through Inbound ...
Closing the Loop: Funding Comprehensive Internationalization through Inbound ...Closing the Loop: Funding Comprehensive Internationalization through Inbound ...
Closing the Loop: Funding Comprehensive Internationalization through Inbound ...
 
BTL Advertising in Mumbai - Global Advertisers
BTL Advertising in Mumbai - Global AdvertisersBTL Advertising in Mumbai - Global Advertisers
BTL Advertising in Mumbai - Global Advertisers
 
Harmonious volunteer center orientation presentation 2014
Harmonious volunteer center orientation presentation 2014Harmonious volunteer center orientation presentation 2014
Harmonious volunteer center orientation presentation 2014
 
Research into roducts
Research into roducts Research into roducts
Research into roducts
 
Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...
Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...
Koningsdag voorstelling kinderen schoolgoochelaar Aarnoud Agricola Koningsspe...
 
Подъем контентного проекта.
Подъем контентного проекта. Подъем контентного проекта.
Подъем контентного проекта.
 
Inventarisatie innovatie-openbaar-biblitheekwerk-2013
Inventarisatie innovatie-openbaar-biblitheekwerk-2013Inventarisatie innovatie-openbaar-biblitheekwerk-2013
Inventarisatie innovatie-openbaar-biblitheekwerk-2013
 

Similaire à 11.the univalence of some integral operators

Doering Savov
Doering SavovDoering Savov
Doering Savovgh
 
Cosmin Crucean: Perturbative QED on de Sitter Universe.
Cosmin Crucean: Perturbative QED on de Sitter Universe.Cosmin Crucean: Perturbative QED on de Sitter Universe.
Cosmin Crucean: Perturbative QED on de Sitter Universe.SEENET-MTP
 
Session02 review-laplace and partial fractionl
Session02 review-laplace and partial fractionlSession02 review-laplace and partial fractionl
Session02 review-laplace and partial fractionlAhmad Essam
 
第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法
第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法
第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法Computational Materials Science Initiative
 
Density theorems for Euclidean point configurations
Density theorems for Euclidean point configurationsDensity theorems for Euclidean point configurations
Density theorems for Euclidean point configurationsVjekoslavKovac1
 
Strong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappingsStrong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappingsAlexander Decker
 
Exponentials integrals
Exponentials integralsExponentials integrals
Exponentials integralsTarun Gehlot
 
publisher in research
publisher in researchpublisher in research
publisher in researchrikaseorika
 
A Szemeredi-type theorem for subsets of the unit cube
A Szemeredi-type theorem for subsets of the unit cubeA Szemeredi-type theorem for subsets of the unit cube
A Szemeredi-type theorem for subsets of the unit cubeVjekoslavKovac1
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
 
Redundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systemsRedundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systemsSpringer
 
Very brief highlights on some key details 2
Very brief highlights on some key details 2Very brief highlights on some key details 2
Very brief highlights on some key details 2foxtrot jp R
 
A Szemerédi-type theorem for subsets of the unit cube
A Szemerédi-type theorem for subsets of the unit cubeA Szemerédi-type theorem for subsets of the unit cube
A Szemerédi-type theorem for subsets of the unit cubeVjekoslavKovac1
 
Strong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductorsStrong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductorsIAEME Publication
 
Strong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductorsStrong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductorsIAEME Publication
 
The Analytical Nature of the Greens Function in the Vicinity of a Simple Pole
The Analytical Nature of the Greens Function in the Vicinity of a Simple PoleThe Analytical Nature of the Greens Function in the Vicinity of a Simple Pole
The Analytical Nature of the Greens Function in the Vicinity of a Simple Poleijtsrd
 
PhD_Theory_Probab.Appl
PhD_Theory_Probab.ApplPhD_Theory_Probab.Appl
PhD_Theory_Probab.ApplAndrey Lange
 

Similaire à 11.the univalence of some integral operators (20)

Doering Savov
Doering SavovDoering Savov
Doering Savov
 
Cosmin Crucean: Perturbative QED on de Sitter Universe.
Cosmin Crucean: Perturbative QED on de Sitter Universe.Cosmin Crucean: Perturbative QED on de Sitter Universe.
Cosmin Crucean: Perturbative QED on de Sitter Universe.
 
Funcion gamma
Funcion gammaFuncion gamma
Funcion gamma
 
Session02 review-laplace and partial fractionl
Session02 review-laplace and partial fractionlSession02 review-laplace and partial fractionl
Session02 review-laplace and partial fractionl
 
第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法
第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法
第5回CCMSハンズオン(ソフトウェア講習会): AkaiKKRチュートリアル 1. KKR法
 
Density theorems for Euclidean point configurations
Density theorems for Euclidean point configurationsDensity theorems for Euclidean point configurations
Density theorems for Euclidean point configurations
 
Strong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappingsStrong convergence of an algorithm about strongly quasi nonexpansive mappings
Strong convergence of an algorithm about strongly quasi nonexpansive mappings
 
Exponentials integrals
Exponentials integralsExponentials integrals
Exponentials integrals
 
publisher in research
publisher in researchpublisher in research
publisher in research
 
A Szemeredi-type theorem for subsets of the unit cube
A Szemeredi-type theorem for subsets of the unit cubeA Szemeredi-type theorem for subsets of the unit cube
A Szemeredi-type theorem for subsets of the unit cube
 
lec23.ppt
lec23.pptlec23.ppt
lec23.ppt
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
 
Redundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systemsRedundancy in robot manipulators and multi robot systems
Redundancy in robot manipulators and multi robot systems
 
Very brief highlights on some key details 2
Very brief highlights on some key details 2Very brief highlights on some key details 2
Very brief highlights on some key details 2
 
A Szemerédi-type theorem for subsets of the unit cube
A Szemerédi-type theorem for subsets of the unit cubeA Szemerédi-type theorem for subsets of the unit cube
A Szemerédi-type theorem for subsets of the unit cube
 
Strong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductorsStrong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductors
 
Strong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductorsStrong coupling model for high tc copper-oxide superconductors
Strong coupling model for high tc copper-oxide superconductors
 
The Analytical Nature of the Greens Function in the Vicinity of a Simple Pole
The Analytical Nature of the Greens Function in the Vicinity of a Simple PoleThe Analytical Nature of the Greens Function in the Vicinity of a Simple Pole
The Analytical Nature of the Greens Function in the Vicinity of a Simple Pole
 
Legendre
LegendreLegendre
Legendre
 
PhD_Theory_Probab.Appl
PhD_Theory_Probab.ApplPhD_Theory_Probab.Appl
PhD_Theory_Probab.Appl
 

Plus de Alexander Decker

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inAlexander Decker
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksAlexander Decker
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dAlexander Decker
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceAlexander Decker
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifhamAlexander Decker
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaAlexander Decker
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenAlexander Decker
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget forAlexander Decker
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabAlexander Decker
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalAlexander Decker
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesAlexander Decker
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloudAlexander Decker
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveragedAlexander Decker
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenyaAlexander Decker
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health ofAlexander Decker
 

Plus de Alexander Decker (20)

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale in
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websites
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banks
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized d
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistance
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifham
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibia
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school children
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banks
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget for
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjab
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incremental
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniques
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo db
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloud
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveraged
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenya
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health of
 

Dernier

"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek SchlawackFwdays
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Scott Keck-Warren
 
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupFlorian Wilhelm
 
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLDeveloper Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLScyllaDB
 
From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .Alan Dix
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Enterprise Knowledge
 
Ensuring Technical Readiness For Copilot in Microsoft 365
Ensuring Technical Readiness For Copilot in Microsoft 365Ensuring Technical Readiness For Copilot in Microsoft 365
Ensuring Technical Readiness For Copilot in Microsoft 3652toLead Limited
 
SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024Lorenzo Miniero
 
DSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningDSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningLars Bell
 
Vertex AI Gemini Prompt Engineering Tips
Vertex AI Gemini Prompt Engineering TipsVertex AI Gemini Prompt Engineering Tips
Vertex AI Gemini Prompt Engineering TipsMiki Katsuragi
 
Scanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL CertsScanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL CertsRizwan Syed
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brandgvaughan
 
What's New in Teams Calling, Meetings and Devices March 2024
What's New in Teams Calling, Meetings and Devices March 2024What's New in Teams Calling, Meetings and Devices March 2024
What's New in Teams Calling, Meetings and Devices March 2024Stephanie Beckett
 
Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024BookNet Canada
 
H2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo Day
H2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo DayH2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo Day
H2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo DaySri Ambati
 
Advanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionAdvanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionDilum Bandara
 
"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii SoldatenkoFwdays
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024Lonnie McRorey
 

Dernier (20)

"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
"Subclassing and Composition – A Pythonic Tour of Trade-Offs", Hynek Schlawack
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024
 
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
 
Streamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project SetupStreamlining Python Development: A Guide to a Modern Project Setup
Streamlining Python Development: A Guide to a Modern Project Setup
 
Developer Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQLDeveloper Data Modeling Mistakes: From Postgres to NoSQL
Developer Data Modeling Mistakes: From Postgres to NoSQL
 
From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024
 
Ensuring Technical Readiness For Copilot in Microsoft 365
Ensuring Technical Readiness For Copilot in Microsoft 365Ensuring Technical Readiness For Copilot in Microsoft 365
Ensuring Technical Readiness For Copilot in Microsoft 365
 
SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024SIP trunking in Janus @ Kamailio World 2024
SIP trunking in Janus @ Kamailio World 2024
 
DSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine TuningDSPy a system for AI to Write Prompts and Do Fine Tuning
DSPy a system for AI to Write Prompts and Do Fine Tuning
 
DMCC Future of Trade Web3 - Special Edition
DMCC Future of Trade Web3 - Special EditionDMCC Future of Trade Web3 - Special Edition
DMCC Future of Trade Web3 - Special Edition
 
Vertex AI Gemini Prompt Engineering Tips
Vertex AI Gemini Prompt Engineering TipsVertex AI Gemini Prompt Engineering Tips
Vertex AI Gemini Prompt Engineering Tips
 
Scanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL CertsScanning the Internet for External Cloud Exposures via SSL Certs
Scanning the Internet for External Cloud Exposures via SSL Certs
 
WordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your BrandWordPress Websites for Engineers: Elevate Your Brand
WordPress Websites for Engineers: Elevate Your Brand
 
What's New in Teams Calling, Meetings and Devices March 2024
What's New in Teams Calling, Meetings and Devices March 2024What's New in Teams Calling, Meetings and Devices March 2024
What's New in Teams Calling, Meetings and Devices March 2024
 
Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
Transcript: New from BookNet Canada for 2024: BNC CataList - Tech Forum 2024
 
H2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo Day
H2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo DayH2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo Day
H2O.ai CEO/Founder: Sri Ambati Keynote at Wells Fargo Day
 
Advanced Computer Architecture – An Introduction
Advanced Computer Architecture – An IntroductionAdvanced Computer Architecture – An Introduction
Advanced Computer Architecture – An Introduction
 
"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko"Debugging python applications inside k8s environment", Andrii Soldatenko
"Debugging python applications inside k8s environment", Andrii Soldatenko
 
TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024TeamStation AI System Report LATAM IT Salaries 2024
TeamStation AI System Report LATAM IT Salaries 2024
 

11.the univalence of some integral operators

  • 1. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.4, 2012 The Univalence of Some Integral Operators Deborah O. Makinde Department of Mathematics, Obafemi Awolowo University, Ile-Ife, Osun State, Nigeria E-mail : domakinde.comp@gmail.com; domakinde@oauife.edu.ng Abstract In this paper, we obtain the conditions for univalence of the integral operators of the form: And 1/   g (s)  z k F ( z )    t   i  1/𝜆  1 ds 𝐻(𝑧) = {𝜆 𝑡 (  ) 𝜆−1 𝑑𝑠} 0 ∏ 𝑘 i 1 𝑔 𝑖 (𝑠) s 𝑧 𝜆−1 ∫0 𝑖=1 𝑠 AMS Mathematics Subject Classification: 30C45. Key Words: Integral operator, Univalent. 1. Introduction Let 𝐴 be the class of the functions in the unit disk 𝑈 = {𝑍 ∈ 𝐶: |𝑧| < 1 such that 𝑓(0) = 𝑓 ′ (0) − 1 = 0. Let 𝑆 be the class of functions 𝑓 ∈ 𝐴 which are univalent in 𝑈. Ozaki and Nunokawa [2] showed the condition for the univalence of the function 𝑓 ∈ 𝐴 as given in the lemma below. Lemma 1 [3]: Let 𝑓 ∈ 𝐴 satisfy the condition 𝑧 2 𝑓 ′ (𝑧) | − 1| ≤ 1 (1) 𝑓 2(𝑧) For all 𝑧 ∈ 𝑈, then 𝑓 is univalent in 𝑈 Lemma 2 [2]: Let 𝛼 be a complex number, 𝛼 > 0 , and 𝑓 ∈ 𝐴. If 1 − |𝑧|2𝑅𝑒𝛼 𝑧𝑓 ′′ (𝑧) | ′ |≤1 𝑅𝑒𝛼 𝑓 (𝑧) 𝑧 1⁄ 𝛼 For all 𝑧 ∈ 𝑈, then the function 𝐹 𝛼 (𝑧) = [𝛼 ∫ 𝑈 𝛼−1 𝑓 ′ (𝑢)𝑑𝑢] 0 Is in the class 𝑆. The Schwartz lemma [1] : Let the analytic function 𝑓 be regular in the unit disk and let 𝑓(0) = 0. If |𝑓(𝑧)| ≤ 1, then |𝑓(𝑧)| ≤ |𝑧| For all 𝑧 ∈ 𝑈, where equality can hold only if |𝑓(𝑧)| ≡ 𝐾𝑧 and 𝑘 = 1 Lemma 3 [4]: Let 𝑔 ∈ 𝐴 satisfies (1) and 𝑎 + 𝑏 𝑖 a complex number, 𝑎, 𝑏 satisfies the conditions 3 3 1 𝑎 ∈ [ , ] ; 𝑏 ∈ [0, ] (2) 4 2 2√2 8𝑎2 + 𝑎9 𝑏 2 − 18𝑎 + 9 ≤ 0 (3) 1 𝑧 𝑔(𝑢) 𝑎+𝑏 𝑖 −1 𝑎+𝑏 𝑖 If |𝑔(𝑧) ≤ 1| for all 𝑧 ∈ 𝑈 then the function 𝐺(𝑧) = {𝑎 + 𝑏 𝑖 ∫ ( 0 ) 𝑑𝑢} 𝑢 91
  • 2. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.4, 2012 Is univalent in 𝑈 1. MAIN RESULTS Theorem 1: Let 𝑔 ∈ 𝐴 satisfies (1) and 𝜆 is a complex number, 𝜆 satisfies the conditions 𝑅𝑒𝜆 ∈ (0, √𝑘 + 2], 𝑘 ≥ 1 (4) (𝑅𝑒𝜆)4 (𝑅𝑒𝜆)2 (𝐼𝑚𝜆)2 − (𝑘 + 2) ≥ 0 2 (5) If |𝑔(𝑧)| ≤ 1 for all 𝑧 ∈ 𝑈 then the function 1/   g (s)  z k  is   1 F ( z)    t ds Is univalent in 𝑈 0 i 1   Proof: Let z k 1/  g ( s)  ( is )  1 F ( z)    t ds 0 i 1 𝑘 𝑧 𝑔 𝑖 (𝑠) 1/𝜆 And let 𝑓(𝑧) = ∫ ∏ 𝑖=1 ( 0 ) 𝑑𝑠 (6) 𝑠 𝑘 𝑔 𝑖 (𝑧) 1/𝜆 Then 𝑓 ′ (𝑧) = ∏ 𝑖=1 ( ) 𝑧 𝑔1 (𝑠) 1/𝜆 𝑔2 (𝑠) 1/𝜆 𝑔 𝑘 (𝑠) 1/𝜆 =( ) ( ) …( ) 𝑠 𝑠 𝑠 1 1 ′ 1 1 𝑔1 (𝑠) 1/𝜆 𝑔2 (𝑠) 𝜆 𝑔 𝑘 (𝑠) 𝜆 𝑔1 (𝑠) 1/𝜆 𝑔2 (𝑠) 𝜆 𝑔 (𝑠) 𝜆 𝑓 ′′ (𝑧) = ( ) [( ) …( ) ] + [( ) ] ′ [( ) …( 𝑘 ) ] 𝑠 𝑠 𝑠 𝑠 𝑠 𝑠 𝑧𝑓 ′′ (𝑧) 1 𝑧𝑔′ 1 (𝑧) 1 𝑧𝑔′ 2 (𝑧) 1 𝑧𝑔′ 𝑘 (𝑧) = ( − 1) + ( − 1) … ( − 1) 𝑓 ′ (𝑧) 𝜆 𝑔1 (𝑧) 𝜆 𝑔1 (𝑧) 𝜆 𝑔1 (𝑧) 1 𝑘 𝑧𝑔′ 𝑖 (𝑧) = ∑ 𝑖=1 ( − 1) 𝜆 𝑔1 (𝑧) This implies that 1−|𝑧|2𝑅𝑒𝜆 𝑧𝑓 ′′ (𝑧) 1−|𝑧|2𝑅𝑒𝜆 1 𝑘 𝑧𝑔′ 𝑖 (𝑧) | |= |∑ 𝑖=1 − 1| 𝑅𝑒𝜆 𝑓 ′ (𝑧) 𝑅𝑒𝜆 |𝜆| 𝑔1 (𝑧) 1−|𝑧|2𝑅𝑒𝜆 1 𝑘 𝑧𝑔′ 𝑖 (𝑧) ≤ (|∑ 𝑖=1 | + 1) 𝑅𝑒𝜆 |𝜆| 𝑔1 (𝑧) 1−|𝑧|2𝑅𝑒𝜆 1 𝑘 𝑧 2 𝑔′ 𝑖 (𝑧) 𝑔 (𝑧) ≤ (|∑ 𝑖=1 || 𝑖 | + 1) (7) 𝑅𝑒𝜆 |𝜆| 𝑔2 1 (𝑧) 𝑧 Using Schwartz-lemma in (7), we have 1−|𝑧|2𝑅𝑒𝜆 𝑧𝑓 ′′ (𝑧) 1−|𝑧|2𝑅𝑒𝜆 1 𝑘 𝑧 2 𝑔′ 𝑖 (𝑧) | |≤ (|∑ 𝑖=1 − 1| + 2) 𝑅𝑒𝜆 𝑓 ′ (𝑧) 𝑅𝑒𝜆 |𝜆| 𝑔2 1 (𝑧) But 𝑔 satisfies (1), thus 𝑘 𝑧 2 𝑔′ 𝑖 (𝑧) |∑ 𝑖=1 − 1| ≤ 𝑘 𝑔2 1 (𝑧) 92
  • 3. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.4, 2012 This implies that 𝑧𝑓 ′′ (𝑧) 1−|𝑧|2𝑅𝑒𝜆 1 𝑘+2 | |≤ (𝑘 + 2) ≤ (8) 𝑓 ′ (𝑧) 𝑅𝑒𝜆 |𝜆| 𝑅𝑒𝜆|𝜆| From (4) and (5), we have 𝑘+2 ≤1 (9) 𝑅𝑒𝜆|𝜆| 1−|𝑧|2𝑅𝑒𝜆 𝑧𝑓 ′′ (𝑧) Using (9) in (8), we obtain | |≤1 𝑅𝑒𝜆 𝑓 ′ (𝑧) 𝑘 𝑔 𝑘 (𝑠) 1/𝜆 And from (6) 𝑓 ′ (𝑧) = ∏ 𝑖=1 ( ) 𝑠 And by lemma 2 𝐹(𝑧) is univalent ∎ Theorem 2 Let 𝑔 ∈ 𝐴 satisfies (1) and let 𝜆 be a complex number with 𝑅𝑒𝜆, 𝐼𝑚𝜆 satisfying (2) and (3). If |𝑔(𝑧)| ≤ 1 for all 𝑧 ∈ 𝑈 then the function 𝑘 1/𝜆 𝑧 𝜆−1 𝑔 𝑖 (𝑠) 𝜆−1 𝐻(𝑧) = {𝜆 ∫ 𝑡 ∏( ) } 0 𝑠 𝑖=1 Is univalent in 𝑈. Proof: Let 𝑧 𝑔 𝑖 (𝑠) 𝜆−1 1/𝜆 𝑘 𝐻(𝑧) = {𝜆 ∫ 𝑡 𝜆−1 ∏ 𝑖=1 ( 0 ) } (10) 𝑠 Following the procedure of the proof of theorem 1, we obtain 𝑘 1 − |𝑧|2𝑅𝑒𝜆 𝑧ℎ′′ (𝑧) 1 − |𝑧|2𝑅𝑒𝜆 𝑧 2 𝑔′ (𝑧) | ′ |≤ |𝜆 − 1| (|∑ 2 𝑖 − 1| + 2) 𝑅𝑒𝜆 ℎ (𝑧) 𝑅𝑒𝜆 𝑔 1 (𝑧) 𝑖=1 But 𝑔 satisfies (1), thus 1 − |𝑧|2𝑅𝑒𝜆 𝑧ℎ′′ (𝑧) 1 − |𝑧|2𝑅𝑒𝜆 |𝜆 − 1|(𝑘 + 2) | ′ |≤ |𝜆 − 1|(𝑘 + 2) ≤ 𝑅𝑒𝜆 ℎ (𝑧) 𝑅𝑒𝜆 𝑅𝑒𝜆 From (2) and (3) we have |𝜆−1|(𝑘+2) ≤1 𝑅𝑒𝜆 This implies that 1−|𝑧|2𝑅𝑒𝜆 𝑧ℎ′′ (𝑧) | | ≤ 1 for all 𝑧 ∈ 𝑈 𝑅𝑒𝜆 ℎ′ (𝑧) 𝑔(𝑧) 𝜆−1 𝑘 From (10), ℎ′ (𝑧) = ∏ 𝑖=1 ( ) 𝑧 And by lemma 2, 𝐻(𝑧) is univalent in 𝑈 ∎ Remark: Theorem 1and theorem 2 gives a generalization of theorem 1[4] and lemma 3 respectively,. 93
  • 4. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.4, 2012 References Mayer O, (1981). The function theory of one complex variable Bucuresti Oaaki, S., & Nunokawa, M. (1972). The Schwarzian derivative and univalent function.Proc. Amer. Math. Soc. 33(2), 392-394 Pescar, V., (2006). Univalence of certain integral operators. . Acta Universitatis Apulensis, 12, 43-48 Pescar, V., & Breaz, D. (2008). Some integral and their univalence. Acta Universitatis Apulensis, 15, 147-152 94
  • 5. International Journals Call for Paper The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org Business, Economics, Finance and Management PAPER SUBMISSION EMAIL European Journal of Business and Management EJBM@iiste.org Research Journal of Finance and Accounting RJFA@iiste.org Journal of Economics and Sustainable Development JESD@iiste.org Information and Knowledge Management IKM@iiste.org Developing Country Studies DCS@iiste.org Industrial Engineering Letters IEL@iiste.org Physical Sciences, Mathematics and Chemistry PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Chemistry and Materials Research CMR@iiste.org Mathematical Theory and Modeling MTM@iiste.org Advances in Physics Theories and Applications APTA@iiste.org Chemical and Process Engineering Research CPER@iiste.org Engineering, Technology and Systems PAPER SUBMISSION EMAIL Computer Engineering and Intelligent Systems CEIS@iiste.org Innovative Systems Design and Engineering ISDE@iiste.org Journal of Energy Technologies and Policy JETP@iiste.org Information and Knowledge Management IKM@iiste.org Control Theory and Informatics CTI@iiste.org Journal of Information Engineering and Applications JIEA@iiste.org Industrial Engineering Letters IEL@iiste.org Network and Complex Systems NCS@iiste.org Environment, Civil, Materials Sciences PAPER SUBMISSION EMAIL Journal of Environment and Earth Science JEES@iiste.org Civil and Environmental Research CER@iiste.org Journal of Natural Sciences Research JNSR@iiste.org Civil and Environmental Research CER@iiste.org Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Journal of Biology, Agriculture and Healthcare JBAH@iiste.org Food Science and Quality Management FSQM@iiste.org Chemistry and Materials Research CMR@iiste.org Education, and other Social Sciences PAPER SUBMISSION EMAIL Journal of Education and Practice JEP@iiste.org Journal of Law, Policy and Globalization JLPG@iiste.org Global knowledge sharing: New Media and Mass Communication NMMC@iiste.org EBSCO, Index Copernicus, Ulrich's Journal of Energy Technologies and Policy JETP@iiste.org Periodicals Directory, JournalTOCS, PKP Historical Research Letter HRL@iiste.org Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Public Policy and Administration Research PPAR@iiste.org Zeitschriftenbibliothek EZB, Open J-Gate, International Affairs and Global Strategy IAGS@iiste.org OCLC WorldCat, Universe Digtial Library , Research on Humanities and Social Sciences RHSS@iiste.org NewJour, Google Scholar. Developing Country Studies DCS@iiste.org IISTE is member of CrossRef. All journals Arts and Design Studies ADS@iiste.org have high IC Impact Factor Values (ICV).