• No results found

Uniqueness of Meromorphic Functions Whose Differential Polynomials Share One Value

N/A
N/A
Protected

Academic year: 2020

Share "Uniqueness of Meromorphic Functions Whose Differential Polynomials Share One Value"

Copied!
9
0
0

Loading.... (view fulltext now)

Full text

(1)

ISSN Online: 2327-4379 ISSN Print: 2327-4352

DOI: 10.4236/jamp.2018.611188 Nov. 19, 2018 2264 Journal of Applied Mathematics and Physics

Uniqueness of Meromorphic Functions Whose

Differential Polynomials Share One Value

Jin Tao, Xinli Wang

College of Science, University of Shanghai for Science and Technology, Shanghai, China

Abstract

In this paper, we prove a uniqueness theorem of meromorphic functions whose some nonlinear differential shares 1 IM with powers of the meromor-phic functions, where the degrees of the powers are equal to those of the non-linear differential polynomials. This result improves the corresponding one given by Zhang and Yang, and other authors.

Keywords

Differential Polynomials, Meromorphic Functions, Uniqueness Theorems

1. Introduction

The meromorphic function mentioned in this paper refers to the meromorphic function over the entire complex plane. Let f and g be two non-constant mero-morphic functions. E

(

0,∞

)

means Linear measure finite set. S r f

(

,

)

means S r f

(

,

)

=o T r f

{

(

,

)

}

,

(

r→ ∞ ∉,r E

)

. CM is the abbreviation of com-mon multiplicities. And IM is the abbreviation of ignored multiplicities. These concepts can be found in the literature [1]. Let a be a finite complex number, if

f a and g a− have the same zero point and the same number of weights, then f and gCM share a. If f a and g a− have the same zero point without counting the number, then f and gIM share a[2]. In addition, the following de-finitions are required: let p be a positive integer, and a C∈ ∪ ∞

{ }

. Next

) , 1

p

N r f a

 

  means f has a weight less than p count function of the weight of

the value point a within z r< . Np) r, 1

f a

 

  means corresponding reduced

count function; N(p r, 1

f a

 

  means the weight of f is not less than p count

How to cite this paper: Tao, J. and Wang, X.L. (2018) Uniqueness of Meromorphic Functions Whose Differential Polynomials Share One Value. Journal of Applied Ma-thematics and Physics, 6, 2264-2272.

https://doi.org/10.4236/jamp.2018.611188

Received: September 29, 2018 Accepted: November 16, 2018 Published: November 19, 2018

Copyright © 2018 by authors and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY 4.0).

http://creativecommons.org/licenses/by/4.0/

(2)

DOI: 10.4236/jamp.2018.611188 2265 Journal of Applied Mathematics and Physics function of the weight of the value point a within z r< . N(p r, f a1

 

  means

corresponding reduced count function. Suppose k is a non-negative number. Mark N rk ,f a1

 

  defined as follows. See the literature [3] for details.

(2 (

1 1 1 1

, , , ,

k k

N r N r N r N r

f a f a f a f a

       

= + + ⋅⋅⋅ +

     

       

Before, Xiaomin Li and Zhitao Wen expanded Jilong Zhang’s theorem, where

( )

fn changes to f fn−1 ( )k , so when k=1, that is Zhang’s theorem. Similarly, in this paper, we continuously change f fn−1 ( )k to fn−1

(

f 1

)

f( )k , which

con-tained f −1. So we expended Xiaomin Li and Zhitao Wen’s theorem.

In 2008, Lianzhong Yang and Jilong Zhang proved the following theorems: Theorem A [4] Suppose f is a non-constant entire function, n≥7 is a posi-tive integer, if fn and

( )

fnCM share 1, then fn=

( )

fn.

Theorem B [4] Suppose f is a non-constant meromorphic function, n≥12 is a positive integer, if fn and

( )

fnCM share 1, then fn=

( )

fn.

Recently Zhang Jilong improved the above theorem. Get the following result: TheoremC [5] Suppose f is a non-constant entire function, n≥3 is a posi-tive integer, if fn and

( )

fnCM share 1, then fn=

( )

fn.

Theorem D [5] Suppose f is a non-constant meromorphic function, n≥4 is a positive integer, if fn and

( )

fnCM share 1, then fn=

( )

fn.

Li Xiaomin and Wen Zhitao have improved on the basis of Zhang Jilong’s theorem, as follows.

Theorem E [5] Suppose f is a non-constant meromorphic function, k is a pos-itive integer, n is a positive integer and satisfies 2n k≥ + +3 k2+2k+9, if fn and

( )

fnCM share 1, then fn =

( )

fn.

Theorem F [5] Suppose f is a non-constant meromorphic function, k is a pos-itive integer, n is a positive integer and satisfies 2n3k+ +8 9k2+40k+64, if

n

f and

( )

fnIM share 1, then fn =

( )

fn.

Now we mainly improve the theorem of Li Xiaomin. Which that changes fn and f fn−1 ( )k to fn

(

f 1

)

and fn−1

(

f 1

)

f( )k . We get the following

theo-rem:

Theorem 1 Suppose f is a non-constant meromorphic function, k is a positive integer, n is a positive integer and satisfies 2n3 13k+ + 9k2+62k+129, if

(

1

)

n

f f andfn−1

(

f 1

)

f( )k IM share 1, and the zeros of f 1 with

mul-tiplicity 2 at least., then f = f( )k .

2. Some Lemmas

Lemma 1 [6] Suppose F and G are non-constant meromorphic functions, let

2 2

1 1

F F G G

H

F F G G

′′ ′ ′′ ′

   

= − −

′ − ′ −

   

(3)

DOI: 10.4236/jamp.2018.611188 2266 Journal of Applied Mathematics and Physics

(

)

(

)

(

)

1) , 1 , , ,

1 E

N r N r H S r F S r G G

 ≤ + +

 

Lemma 2 [7] Let f be a non-constant meromorphic function, and

( )

1

1 1

n n

n n

P f a f a fa f

= + + ⋅⋅⋅ +

where a a1, , ,2 an−1,an

( )

≠0 are constants, then

( )

(

,

)

(

,

)

( )

1

T r P f =nT r f +O .

Lemma 3 Let f be a non-constant meromorphic function, k

( )

≥1 and

( )

2

n are two positive integers. Let F = fn

(

f 1

)

and G f= n−1

(

f 1

)

f( )k .

If F and G IM share 1, then S r F

(

,

)

=S r G

(

,

)

=S r f

(

,

)

.

Proof According to Lemma 2, we obtain

(

,

) (

1

) (

,

)

( )

1

T r F = n+ T r f +O (1)

It can be seen from the above formula,

(

,

)

(

,

)

S r F =S r f (2)

due to G f= n−1

(

f 1

)

f( )k , we have

(

) (

) (

)

(

)

(

( )

)

(

) (

)

(

)

(

) (

)

(

) (

) (

)

, 1 , , 1 ,

1 , , , ,

, ,

k

T r G n T r f T r f T r f

n T r f T r f kN r f S r f n k T r f S r f

≤ − + − +

≤ − + + +

≤ + +

(3)

According to the second basic theorem and (2)

(

)

(

)

(

)

(

)

(

)

(

)

(

)

(

)

1 1

, , , , ,

1

1 1

, , , ,

1

, 2 , ,

T r F N r N r N r F S r F

F F

N r N r N r f S r f

G f

T r G T r f S r f

   

+ + +

   

 

 

= + + +

   

≤ + +

The above formula is combined with (1) to get

(

,

) (

1

) (

,

) (

,

)

T r GnT r f +S r f (4)

According to (3) and (4), we have

(

,

)

(

,

)

S r G =S r f (5)

According to (2) and (5), we can get the conclusion of Lemma 3.

Lemma 4 [8] Let f be a non-constant meromorphic function, k p, are two positive integers. The zero point of f −1 is at least 2, then

( )

( )

( )

1 1

, , , ,

p k p k

N r kN r f N r S r f

f

f +

  +  +

   

 

 

(

)

(

)

1 1

, , , , ,

1

f

N r N r N r f N r S r f

f f f

     

≤ ≤ + +

    

     

Lemma 5 Let f be a non-constant meromorphic function, n

( )

≥2 , p are two

positive integers. The zero point of f −1 is at least 2. Let F f= n

(

f 1

)

and

(

)

( )

1 1 k

n

G f=f f , if F

(4)

DOI: 10.4236/jamp.2018.611188 2267 Journal of Applied Mathematics and Physics a) N r,1

(

k 3

)

N r,1

(

k 1

) (

N r f,

)

S r f

(

,

)

G f

 

 ≤ + + + +

 

 

   

b) , 1 2 ,1 2

(

,

)

(

,

)

1 L

N r N r N r f S r f

F f

 

 ≤ + +

 

    ;

c) , 1

(

3

)

,1

(

2

) (

,

)

(

,

)

1 L

N r k N r k N r f S r f

G f

 

 ≤ + + + +

 

    .

Proof According to Lemma 4, we have

( )

(

)

(

)

(

)

(

)

(

)

(

) (

)

(

)

1

1

1 1 1 1

, , , , ,

1

1 1 1

, , , , , ,

1

3 , 1 , ,

k

k

N r N r N r N r S r f

G f f f

N r N r f N r N r kN r f S r f

f f f

k N r k N r f S r f f

+

 

   

 ≤ + + +

 

   

 

       

     

+ + + + +

     

 

≤ + + + +

 

This leads to the conclusion (a), obtained from the definition of the

1 ,

1 L

N r F

 

  and Lemma 3:

( )

( )

(

)

(

)

(

)

(

)

1

, , , 1 , , 1

1

1 1

, , , 2 , 2 , ,

L F F F F

N r N r T r O m r N r O

F F F F F

N r F N r S r F N r f N r S r f

F f

′ ′ ′

     + =  +  +

        

         

 

 

= + + = + +

   

This leads to conclusions (b), the same reason

(

)

(

)

1 1

, , , ,

1 L

N r N r N r G S r f

G G

   + +

  

   

Combine G f= n−1

(

f 1

)

f( )k

and the q form in Lemma 5, we can get (c). Lemma 6 Suppose F and G are non-constant meromorphic functions, and sa-tisfy N r F

(

,

)

N r,1 S r F

(

,

)

F

 

+ =

  and

(

)

(

)

1

, , ,

N r G N r S r G G

 

+ =

  . If F and

G IM share a non-zero constant a, then F G= or FG=1.

Proof

Suppose F f= n

(

f 1

)

, G f= n−1

(

f 1

)

f( )k . (6)

Let H be defined by Lemma 1. The following two discussions, Case 1 Suppose H≠0, then F G, let

1 1

F F G G

V

F F G G

′ ′ ′ ′

   

= − −

− −

    (7)

If V =0,

1

1 B B

F G

− = − (8)

where B≠0 is a constant, if N r f

(

,

)

S r f

(

, .

)

By (6) and (8), we get B=1.

(5)

DOI: 10.4236/jamp.2018.611188 2268 Journal of Applied Mathematics and Physics Therefore, N r f

(

,

)

=S r f

(

,

)

.

So B≠1, by (8), we get

(

1

)

1 1 11

1

BF BF

G

B F F B

B

 

= =

− +  − 

(9)

(

)

1

, 1 , 1

N r S r f

F B

 

 

=

 

 

 − 

(10)

According to the second basic theorem and (6) (8) (9) (10) we get

(

)

(

)

(

)

(

)

(

)

(

)

1 1

, , , 1 , ,

1

1 1

, , ,

1

2 , ,

T r F N r N r N r F S r F

F F

B

N r N r S r f

f f

N r f S r f

 

 

 

+ + +

 

 − 

   

+ +

   

≤ +

(11)

By lemma 2, we have

(

,

) (

1

) (

,

)

( )

1

T r F = n+ T r f +O (12)

Then

(

n+1

) (

T r f,

)

−3T r f

(

,

)

=S r f

(

,

)

(13) If B=1, then F G= , contradiction.

If V was not always equal to 0, (7) can be rewritten into

(

1

)

(

1

)

F G

V

F F G G

′ ′

= −

− − (14)

Suppose z0 is a pole of f with multiplicity p, then z0 is pole of F with

mul-tiplicity

(

n+1

)

p. and z0 is zero of F F

(

F 1

)

− with multiplicity

(

n+1

)

p−1

at least. z0 is zero of G G

(

G 1

)

− with multiplicity

(

n+1

)

p k+ −1 at least.

So z0 is a zero of V with multiplicity ≥n at least.

(

)

(

)

(

)

(

)

(

)

(

)

(

) (

)

(

)

(

)

(

) (

)

(

)

(

)

(

) (

)

(

)

1

, , , , ,

1 1 1

, , , ,

1 1

1

3 , 1 , 2 ,

1 1

2 , 3 , 2 , , 1

2 8 , 2 5 , ,

L L

nN r f N r S r f N r V S r f V

N r N r N r S r f

G F G

k N r k N r f N r f f

N r k N r k N r f S r f

f f

k N r k N r f S r f f

 

+ ≤ +

 

     

+ + +

− −

     

 

≤ + + + +

 

   

+ + + + + +

   

 

≤ + + + +

(6)

DOI: 10.4236/jamp.2018.611188 2269 Journal of Applied Mathematics and Physics Then

(

n 2k 5

) (

N r f,

) (

2k 8

)

N r,1 S r f

(

,

)

f

 

− − ≤ + +

  (15)

The following two sub-cases are discussed: Sub-case 1.1 suppose

1 1

F G

U

F G

′ ′

= −

− − (16) If U=0, we have

1 F DG= + −D where D≠0 is a constant. Then

(

,

)

(

,

)

N r f =S r f . (17)

Suppose N r,1 S r f

(

,

)

f

 

 

  , D=1, F G= , contradiction;

Suppose , 1

(

,

)

1

N r S r f f

 

  , D=1, F G= , contradiction.

So N r,1 S r f

(

,

)

f

 

=

 

  ,

(

)

1

, ,

1

N r S r f f

 

=

  . (18)

If D≠1, ,1 , 1

1

N r N r

G F D

 =  

   + −

   ,

( )

(

)

1 1 1 1

, , , , ,

1 k

N r N r N r N r S r f

G f f f

 

   

 = + + =

 

   

 

       

So , 1

(

,

)

1

N r S r f F D

 =

+ −

  .

Then

(

) (

)

(

)

(

)

(

)

(

)

(

)

1 , , ,

1 1

, , , ,

1 ,

n T r f T r F S r f

N r N r N r F S r f

F F D

S r f

+ = +

   

+ + +

+ −

   

=

Obviously impossible.

Suppose U is not always equal to 0, let z1 be a zero of f with multiplicity q,

then z1 is a zero F with multiplicity nq and z1 is zero of FF 1

− with

multip-licity nq−1 at least. z0 is zero of GG1 with multiplicity

(

n−1

)

q−1 at least.

So z1 is a zero of U with multiplicity n−2 at least.

(

)

(

)

(

)

(

)

(

)

(

)

(

)

(

) (

)

(

)

1 1

2 , , , , ,

1 1

, , , ,

1 1

1

5 , 4 , ,

L L

n N r N r S r f N r U S r f

f U

N r f N r N r S r f

F G

k N r k N r f S r f f

   

+ ≤ +

 

 

   

≤ + + +

− −

   

 

≤ + + + +

(7)

DOI: 10.4236/jamp.2018.611188 2270 Journal of Applied Mathematics and Physics So

(

n k 7

)

N r,1

(

k 5

) (

N r f,

)

S r f

(

,

)

f

 

− − ≤ + +

  (19)

Also

(

)

(

)

(

)

(

)

(

)

1 1

, , , , ,

1

1 1

2 , 2 , , ,

1

T r F N r N r N r F S r F

F F

N r N r f N r S r f

f F

   

+ + +

   

   

+ + +

 

 

(

)

( )

(

)

( )

(

)

( ) ( )

(

)

(

)

(

)

1

1 1

, , , ,

1 1

1 1

, , ,

1

, , ,

k

k n

n

k k

f

N r N r T r S r f

F f f f f

f f

f f

m r N r S r f

f f

kN r f kN r S r f f

 

 

 

    +

 

    

 

 

   

= + +

   

 

≤ + +

 

Then

(

,

) (

2

)

,1

(

2

) (

,

)

(

,

)

T r F k N r k N r f S r f f

 

≤ + + + +

  (20)

If n−2k− >5 0, and N r,1 S r f

(

,

)

f

 

=

 

  , N r f

(

,

)

=S r f

(

,

)

one of the two

forms is established. Then N r,1 N r f

(

,

)

S r f

(

,

)

f

 

+ =

 

  , substituting the above

formula is obviously impossible. Or T r F

(

,

)

=S r f

(

,

)

, contradiction.

So N r,1 N r f

(

,

)

S r f

(

,

)

f

 

+ ≠

 

  , we get

(

) (

)

(

)

1

, , , , ,

N r S r f N r f S r f f

 

≠ ≠

 

  , then

(

7

)

,1

(

4 2

)(

8

)

,1

(

,

)

2 6

k k

n k N r N r S r f

f n k f

+ +

   

− − +

− −

   

(

7

) (

4 2

)(

8

)

2 6

k k

n k

n k

+ +

− − ≤

− −

2 2

3 13 9 62 129 3 13 9 62 129

2 2

k+ − k + k+ n k+ + k + k+

≤ ≤ (21)

(8)

DOI: 10.4236/jamp.2018.611188 2271 Journal of Applied Mathematics and Physics If N r,1 N r f

(

,

)

S r f

(

,

)

f

 

+ =

 

  , we get

(

)

(

)

1

, , ,

N r N r F S r F F

 + =

 

  ,

(

)

(

)

1

, , ,

N r N r G S r F G

 + =

 

 

According to Lemma 6, we get F G= or FG=1.

Firstly, if F G= , fn

(

f − =1

)

fn−1

(

f 1

)

f( )k , f = f( )k , conclusion estab-lished.

Secondly, if FG=1, fn

(

f − ⋅1

)

fn−1

(

f 1

)

f( )k =1, f2 1n

(

f 1

)

2f( )k =1.

Obviously f is entire function. And

(

)

( )

(

)

(

)

(

)

(

)

(

)

(

)

(

)

2 1

2

1 1

, , , ,

1

, 2 , ,

3 , ,

n

k

T r f N r N r S r f

f f

T r f T r f S r f T r f S r f

++

  

 

= + +

= +

(

2 1n

) (

T r f,

)

≤3T r f

(

,

) (

+S r f,

)

(

,

)

(

,

)

T r f =S r f , contradiction.

Situation 2.2

If N r f

(

,

)

S r f

(

,

)

, we get B=0. So G− =1 A F

(

−1

)

.

If N r f

(

,

)

S r f

(

,

)

, we get A=1, then F G= . And if N r f

(

,

)

=S r f

(

,

)

,

(

)

(

)

(

)

(

) (

)

(

)

1 1 1

, , , , , ,

1 1

2 , ,

T r F N r N r f N r N r S r f

f f F

k N r f S r f

     

+ + + +

−  − 

   

≤ + +

(

n+1

) (

T r f,

) (

k+2

) (

N r f,

) (

+S r f,

)

We get n k≤ +1, that contradict with 2n3 13k+ + 9k2+62k+129

. Suppose N r f

(

,

)

=S r f

(

,

)

,

If N r,1 S r f

(

,

)

f

 

 

  we get B A= −1.

If A=1, we get B=0, then F G= . If A≠1, we get

1 1

1 1

1 1

G F

A G

A

−  

− =

 

− −

(

,

)

(

,

)

, 11

(

,

)

1

N r f N r G N r S r f

G A

 

 

= =  =

 

 − 

(9)

DOI: 10.4236/jamp.2018.611188 2272 Journal of Applied Mathematics and Physics

(

) (

)

(

)

( )

(

)

(

)

(

)

(

) (

)

(

)

1 , , 1 ,

1 1

, , , 1 ,

1

1 1

, , 3 , ,

n T r f T r F O T r G

N r G N r N r S r f

G G

A

N r S r f k N r S r f

G f

+ = + =

 

 

 

≤ + +  +

 

 − 

 

 

+ ≤ + +

   

We get n k≤ +2,which contradicts with 2n3 13k+ + 9k2+62k+129.

Therefore, Theorem 1 is proved.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this pa-per.

References

[1] Hayman, W.K. (1964) Meromorphic Functions. ClaredonPress, Oxford.

[2] Yi, H.X. and Yang, C.J. (1995) Theorem on the Uniqueness of Meromorphic Func-tions. Science Press, Beijing.

[3] Alzahary, T.C. and Yi, H.X. (2004) Weighted Sharing Three Values and Uniqueness of Meromorphic Functions. Journal of Mathematical Analysis and Applications, 295, 247-257. https://doi.org/10.1016/j.jmaa.2004.03.040

[4] Yang, L.Z. and Zhang, J.L. (2008) Non-Existence of Meromorphic Solusions of Fermat Type Functional Equation. Aequationes Mathematicae, 76, 140-150.

https://doi.org/10.1007/s00010-007-2913-7

[5] Yang, L.Z. and Zhang, J.L. (2009) A Power of a Meromorphic Function Sharing a Small Function Sharing a Small Function with Its Derivative. Annales Academiae Scientiarum Fennicae Mathematica, 34, 249-260.

[6] Yi, H.X. (1997) Uniqueness Theorems for Meromorphic Functions Whose n-th De-rivatives Share the Same 1-Points. Complex Variables, Theory and Application, 34, 421-436.https://doi.org/10.1080/17476939708815064

[7] Yang, C.C. (1972) On Deficiencies of Differential Polynomial. Mathematische Zeit-schrift, 125, 107-112.https://doi.org/10.1007/BF01110921

References

Related documents

The squared Euclidean distance transform of a sampled function defined on a d dimen- sional grid with N sample points can be computed in O ( dN ) time.. Figure 3 illustrates

The purpose of this study was to investigate 3D flow patterns and vessel wall parameters in the ascending aorta and aortic arch in correlation to the vessel geometry in patients

CONCLUSION: The present study provided much needed information on the prevalence of bacterial pathogens in blood stream infections and their antibiotic sensitivity

Hardness of Tablets: Crushing strength was determined using an electronic/digitalized tablet hardness tester (model EH O1, capacity 500 N,Indian).. Friability: The

President Ford and Secretary Kissinger initially sought to prevent Syria’s intervention, but their change in position once Syria did intervene in June 1976 marked a shift in American

A narrative analysis of poetry written from the words of people given a diagnosis of

Similarly, as the intensity of competition becomes high, the only industries for which it will be optimal to have a closed economy are those which have a low marginal cost

As computational resources have increased in power and accessibility, numerical modelling of antennas using FDTD gained in popularity [26]-[33]. Nonetheless, commercial an-