1 Introduction and main results

Complex oscillation theory of solutions of linear differential equations in the complex plane C was started by Bank and Laine [2, 3]. After their well-known work, many important results have been obtained on the complex oscillation theory of solutions of linear differential equations in C, refer to [16, 17].

To state those correlated results, we require to give some explanation as follows.

We shall assume that the reader is familiar with the fundamental results and the standard notations of the Nevanlinna value distribution theory of meromorphic functions (see [11, 14, 16]). In addition, we will use the notation σ(f) to denote the order of meromorphic function f(z), λ(f) to denote the exponent of convergence of the zero-sequence of f(z) and λ ¯ (f) to denote exponent of convergence of distinct zero-sequence of meromorphic function f(z), and τ(f) to denote the type of an entire function f(z) with 0<σ(f)=σ<+, which is defined to be (see [14])

τ(f)= lim sup r log M ( r , f ) r σ .

We use σ 2 (f) to denote the hyper-order of f(z), σ 2 (f) is defined to be (see [21])

σ 2 (f)= lim sup r log log T ( r , f ) log r .

We use λ 2 (f) ( λ ¯ 2 (f)) to denote the hyper-exponent of convergence of the zero-sequence (distinct zero-sequence) of meromorphic function f(z), λ 2 (f), λ ¯ 2 (f) are defined to be (see [11, 16])

λ 2 (f)= lim sup r log log N ( r , 1 f ) log r ,and λ ¯ 2 (f)= lim sup r log log N ¯ ( r , 1 f ) log r .

Let φ(z) be an entire function with σ(φ)<σ(f) or σ 2 (φ)< σ 2 (f), the hyper-exponent of convergence of zeros and distinct zeros of f(z)φ(z) are defined to be

λ 2 (fφ)= lim sup r log log N ( r , 1 f φ ) log r , λ ¯ 2 (fφ)= lim sup r log log N ( r , 1 f φ ) log r ,

especially if φ(z)=z, we use λ 2 (fz) and λ ¯ 2 (fz) to denote the hyper-exponent of convergence of fixed points and distinct fixed points of f(z), respectively. We use mE= E dt to denote the linear measure of a set E(0,+) and use m l E= E d t t to denote the logarithmic measure of a set E[1,+). We denote by S(r,f) any quantity satisfying

S(r,f)=o ( T ( r , f ) ) ,

as r+, possibly outside of a set with finite measure. A meromorphic function ψ(z) is called a small function with respect to f if T(r,ψ)=S(r,f).

For the second order linear differential equation

f +A(z) f +B(z)f=0,
(1)

where A(z) and B(z) (≢0) are entire functions, it is an interesting problem to investigate the complex oscillation of solutions of Equation (1). Many mathematicians obtained a lot of important and significant results (see [1, 6, 7, 10, 13]) by studying the above equation.

In 1996, Shon [15] investigated the hyper-order of the solutions of (1) and obtained the following result.

Theorem A (see [15])

LetA(z)andB(z)be entire functions such thatσ(A)<σ(B)orσ(B)<σ(A)< 1 2 , then every functionf0of (1) satisfies σ 2 (f)max{σ(A),σ(B)}.

In 2006, Chen and Shon [8] investigated the zeros of the solution concerning small functions and fixed points of solutions of second order linear differential equations and obtained some results as follows.

Theorem B (see [8])

Let A j (z)0 (j=1,2) be entire functions withσ( A j )<1, suppose that a, b are complex numbers and satisfyab0andargaargbora=cb (0<c<1). Ifφ(z)0is an entire function of finite order, then every non-trivial solution f of the equation

f + A 1 (z) e a z f + A 2 (z) e b z f=0

satisfies λ ¯ (fφ)= λ ¯ ( f φ)= λ ¯ ( f φ)=.

Theorem C (see [8])

Let A 1 (z)0, φ(z)0, Q(z)be entire functions withσ( A 1 )<1, 1<σ(Q)<andσ(φ)<, then every non-trivial solution f of the equation

f + A 1 (z) e a z f +Q(z)f=0

satisfies λ ¯ (fφ)= λ ¯ ( f φ)= λ ¯ ( f φ)=, wherea0is a complex number.

In the same year, Liu and Zhang [18] investigated the fixed points when the coefficients of the equations are meromorphic functions and obtained the following result.

Theorem D (see [18])

Suppose thatk2andA(z)is a transcendental meromorphic function satisfyingδ(,A)= lim ̲ r m ( r , A ) T ( r , A ) =δ>0, σ(A)=σ<+. Then every meromorphic solutionf0of the equation

f ( k ) +A(z)f=0
(2)

satisfies that f and f , f ,, f ( k ) all have infinitely many fixed points and λ ¯ ( f ( j ) z)=σ (j=0,1,,k).

For Equation (2), Belaïdi [4], Belaïdi and El Farissi [5] investigated the fixed points and the relationship between small functions and differential polynomials of solutions of Equation (2) and obtained some results which improve Theorems D and C.

There naturally arises an interesting subject on the problems of fixed points of solutions of the differential equation

f ( k ) + A k 1 f ( k 1 ) ++ A 0 f=0(k2),
(3)

where A j (z) (j=0,1,,k1) are entire functions.

In this paper, we will deal with the above equation and investigate the relationship between small functions and derivative of solutions of Equation (2) and obtain some theorems which improve the previous results given by Chen, Kwon and etc.

Theorem 1.1 Let A j (z), j=0,1,,k1be entire functions with finite order and satisfy one of the following conditions:

  1. (i)

    max{σ( A j ):j=1,2,,k1}<σ( A 0 )<;

  2. (ii)

    0<σ( A k 1 )==σ( A 1 )=σ( A 0 )< and max{τ( A j ):j=1,2,,k1}= τ 1 <τ( A 0 )=τ,

then for every solutionf0of (3) and for any entire functionφ(z)0satisfying σ 2 (φ)<σ( A 0 ), we have

λ ¯ 2 (fφ)= λ ¯ 2 ( f φ ) = λ ¯ 2 ( f φ ) = λ ¯ 2 ( f φ ) = λ ¯ 2 ( f ( i ) φ ) = σ 2 (f)=σ( A 0 )(iN).

Theorem 1.2 Let A j (z), j=1,2,,k1be polynomials, A 0 (z)be a transcendental entire function, then for every solutionf0of (3) and for any entire functionφ(z)of finite order, we have

  1. (i)

    λ ¯ (fφ)=λ(fφ)=σ(f)=;

  2. (ii)

    λ ¯ ( f ( i ) φ)=λ( f ( i ) φ)=σ( f ( i ) φ)= (i1,iN).

Theorem 1.3 Let A j (z), j=0,1,,k1be meromorphic functions satisfyingmax{σ( A j ):j=1,2,,k1}<σ( A 0 )andδ(, A 0 )>0. Then for every meromorphic solutionf0of (3) and for any meromorphic functionφ(z)0satisfying σ 2 (φ)<σ( A 0 ), we have λ ¯ 2 ( f ( i ) φ)= λ 2 ( f ( i ) φ)σ( A 0 ) (i=0,1,), where f ( 0 ) =f.

Remark 1.1 The following example shows that Theorem 1.3 is not valid when A j (z), j=0,1,,k1 do not satisfy the condition max{σ( A j ):j=1,2,,k1}<σ( A 0 ).

Example 1.1 For the equation

we can easily get that Equation (♯) has a solution f(z)= e e z + e z . And the functions e 2 z + e z 1 1 e z , e 2 z 1 e z are meromorphic and satisfy δ(, e 2 z 1 e z )= 1 2 . Take φ(z)= e z , then σ 2 (φ)<σ( e 2 z 1 e z ). Thus, we can get that λ ¯ 2 ( f φ)= λ ¯ 2 ( e e z e z )=01=σ( e 2 z 1 e z ).

From Theorems 1.1-1.3, if φ(z)=z, we can get the following corollaries easily.

Corollary 1.1 Under the assumptions of Theorem 1.1, ifφ(z)=z, for every solutionf0of (3), we have

λ ¯ 2 (fz)= λ ¯ 2 ( f z ) = λ ¯ 2 ( f z ) = λ ¯ 2 ( f ( i ) z ) = σ 2 (f)=σ( A 0 )(iN).

Corollary 1.2 Under the assumptions of Theorem 1.2, ifφ(z)=z, for every solutionf0of (3), we have

  1. (i)

    λ ¯ (fz)=λ(fz)=σ(f)=;

  2. (ii)

    λ ¯ ( f ( i ) z)=λ( f ( i ) z)=σ( f ( i ) z)= (i1,iN).

Corollary 1.3 Under the assumptions of Theorem 1.3, ifφ(z)=z, for every meromorphic solutionf0of (3), we have λ ¯ 2 ( f ( i ) z)= λ 2 ( f ( i ) z) σ 2 ( A 0 ) (i=0,1,), where f ( 0 ) =f.

Remark 1.2 In Theorem B, if ab0 and a=cb (0<c<1), it is easy to see that σ( A 1 e a z )=σ( A 2 e b z )=1 and τ( A 1 e a z )=|a|<τ( A 2 e b z )=|b|. By Theorem 1.1, for every solution f0 of (3) and for any entire function φ(z)0 with σ 2 (φ)<1, we have λ ¯ 2 (fφ)= λ ¯ 2 ( f φ)= λ ¯ 2 ( f φ)=1. Therefore, Theorem 1.1 is also a partial extension of Theorem B. Theorem 1.2 is the improvement of Theorem C. Theorem 1.3 and Corollary 1.3 are the improvements of Theorem D.

2 Some lemmas

To prove our theorems, we require the following lemmas.

Lemma 2.1 Assumef0is a solution of Equation (3), setg=fφ, then g satisfies the equation

g ( k ) + A k 1 g ( k 1 ) ++ A 0 g= [ φ ( k ) + A k 1 φ ( k 1 ) + + A 0 φ ] .
(4)

Proof Since g=fφ, we have g = f φ ,, g ( k ) = f ( k ) φ ( k ) . Substituting them into Equation (3), we have (4). □

Lemma 2.2 Assumef0is a solution of Equation (3), set g 1 = f φ, then g 1 satisfies the equation

g 1 ( k ) + U k 1 1 g 1 ( k 1 ) ++ U 0 1 g 1 = [ φ ( k ) + U k 1 1 φ ( k 1 ) + + U 0 1 φ ] ,
(5)

where U j 1 = A j + 1 + A j A 0 A 0 A j + 1 , j=0,1,2,,k1and A k 1.

Proof Since g 1 = f φ, we have

f = g 1 +φ, f = g 1 + φ ,, f ( k + 1 ) = g 1 ( k ) + φ ( k ) .
(6)

And the derivation of (3) is

f ( k + 1 ) + A k 1 f ( k ) + ( A k 1 + A k 2 ) f ( k 1 ) ++ ( A 1 + A 0 ) f + A 0 f=0.
(7)

We can rewrite (3) as

f= 1 A 0 ( f ( k ) + A k 1 f ( k 1 ) + + A 1 f ) .
(8)

Substituting (8) into (7), we have

(9)

Substituting (6) into (9), we have

(10)

Set U j 1 = A j + 1 + A j A 0 A 0 A j + 1 , j=0,1,2,,k1 and A k 1. Then from (9) and (10), we can get

f ( k + 1 ) + U k 1 1 f ( k ) + U k 2 1 f ( k 1 ) ++ U 0 1 f =0
(11)

and (5).

Thus, we complete the proof of Lemma 2.2. □

Lemma 2.3 Assumef0is a solution of Equation (3), set g 2 = f φ, then g 2 satisfies the equation

g 2 ( k ) + U k 1 2 g 2 ( k 1 ) ++ U 0 2 g 2 = [ φ ( k ) + U k 1 2 φ ( k 1 ) + + U 0 2 φ ] ,
(12)

where U j 2 = U j + 1 1 + U j 1 U 0 1 U 0 1 U j + 1 1 , j=0,1,2,,k1and U k 1 1.

Proof Since g 2 = f φ, we can get

f = g 2 +φ, f = g 2 + φ ,, f ( k + 2 ) = g 2 ( k ) + φ ( k ) .
(13)

The derivation of (11) is

f ( k + 2 ) + U k 1 1 f ( k + 1 ) + ( U k 1 1 + U k 2 1 ) f ( k ) ++ ( U 1 1 + U 0 1 ) f + U 0 1 f =0.
(14)

Substituting (11) into (14), we have

(15)

Set U j 2 = U j + 1 1 + U j 1 U 0 1 U 0 1 U j + 1 1 , j=0,1,2,,k1 and U k 1 1, then from (14) we have

f ( k + 2 ) + U k 1 2 f ( k + 1 ) + U k 2 2 f ( k ) ++ U 0 2 f =0.
(16)

Substituting (13) into (16), we can get (12).

Thus, this completes the proof of Lemma 2.3. □

Lemma 2.4 Assumef0is a solution of Equation (3), set g 3 = f φ, then g 3 satisfies the equation

g 3 ( k ) + U k 1 3 g 3 ( k 1 ) ++ U 0 3 g 3 = [ φ ( k ) + U k 1 3 φ ( k 1 ) + + U 0 3 φ ] ,
(17)

where U j 3 = U j + 1 2 + U j 2 U 0 2 U 0 2 U j + 1 2 , j=0,1,2,,k1and U k 2 1.

Proof Since g 3 = f φ, we have

f = g 3 +φ, f ( 4 ) = g 3 + φ ,, f ( k + 3 ) = g 3 ( k ) + φ ( 4 ) .
(18)

The derivation of (16) is

f ( k + 3 ) + U k 1 2 f ( k + 2 ) + ( U k 1 2 + U k 2 2 ) f ( k + 1 ) ++ ( U 1 2 + U 0 2 ) f + U 0 2 f =0.
(19)

Substituting (16) into (18), we have

(20)

Set U j 3 = U j + 1 2 + U j 2 U 0 2 U 0 2 U j + 1 2 , j=0,1,2,,k1 and U k 2 1, then from (20) we have

f ( k + 3 ) + U k 1 3 f ( k + 2 ) + U k 2 3 f ( k + 1 ) ++ U 0 3 f =0.
(21)

Substituting (18) into (21), we can get (17).

Thus, we complete the proof of Lemma 2.4. □

Lemma 2.5 Assumef0is a solution of Equation (3), set g i = f ( i ) φ, then g i satisfies the equation

g i ( k ) + U k 1 i g i ( k 1 ) ++ U 0 i g i = [ φ ( k ) + U k 1 i φ ( k 1 ) + + U 0 i φ ] ,
(22)

where U j i = U j + 1 i 1 + U j i 1 U 0 i 1 U 0 i 1 U j + 1 i 1 , j=0,1,2,,k1, U k i 1 1andiN.

Proof The inductive method will be used to prove it.

At first, from Lemmas 2.2-2.4, we get that (22) holds for i=1,2,3.

Next, suppose that g i = f ( i ) φ, in, nN satisfy (22). Thus, g n = f ( n ) φ satisfies the equation

g n ( k ) + U k 1 n g n ( k 1 ) ++ U 0 n g n = [ φ ( k ) + U k 1 n φ ( k 1 ) + + U 0 n φ ] ,
(23)

where U j n = U j + 1 n 1 + U j n 1 U 0 n 1 U 0 n 1 U j + 1 n 1 , j=0,1,2,,k1 and U k n 1 1.

Since g n = f ( n ) φ, we have

f ( n + 1 ) = g n + φ , f ( n + 2 ) = g n + φ ,, f ( k + n ) = g n ( k ) + φ ( k ) .
(24)

From (23) and (24), we have

f ( k + n ) + U k 1 n f ( k + n 1 ) + U k 2 n f ( k + n 2 ) ++ U 0 n f ( n ) =0.
(25)

Now we will prove that g n + 1 = f ( n + 1 ) φ satisfies (22). Since g n + 1 = f ( n + 1 ) φ, we have

f ( n + 2 ) = g n + 1 + φ , f ( n + 3 ) = g n + 1 + φ ,, f ( n + k + 1 ) = g n + 1 ( k ) + φ ( k ) .
(26)

The derivation of (25) is

f ( k + n + 1 ) + U k 1 n f ( k + n ) + ( U k 1 n + U k 2 n ) f ( k + n 1 ) ++ U 0 n f ( n ) =0.
(27)

Substituting (25) into (27), we have

(28)

From the definition of U j i and (28), we have

f ( k + n + 1 ) + U k 1 n + 1 f ( k + n ) ++ U 1 n + 1 f ( n + 1 ) + U 0 n + 1 f ( n ) =0,
(29)

where U j n + 1 = U j + 1 n + U j n U 0 n U 0 n U j + 1 n , j=0,1,2,,k1 and U k n 1. Substituting (26) into (29), we have

g n + 1 ( k ) + U k 1 n + 1 g n + 1 ( k 1 ) ++ U 0 n + 1 g n + 1 = [ φ ( k ) + U k 1 n + 1 φ ( k 1 ) + + U 0 n + 1 φ ] .
(30)

This completes the proof of Lemma 2.5. □

Similar to the proof of [19], Lemma 3.8], we can get the following lemma.

Lemma 2.6 Letf(z)be a transcendental meromorphic function withσ(f)=σ0, then there exists a setE[1,+)with infinite logarithmic measure such that for allrE, we have

lim r log T ( r , f ) log r =σ,rE.

Lemma 2.7 Let A 0 (z), A 1 (z),…, A k 1 (z)be entire functions with finite order and satisfymax{σ( A j ):j=1,2,,k1}= σ 1 <σ( A 0 )<, and set

U j 1 = A j + 1 + A j A 0 A 0 A j + 1

and

U j i = U j + 1 i 1 + U j i 1 U 0 i 1 U 0 i 1 U j + 1 i 1 ,

wherej=0,1,2,,k1, A k 1, U k i 1 1andiN. Then there exists a set E with infinite logarithmic measure such that

lim r log m ( r , U 0 i ) log r =σ( A 0 )> lim sup r max 1 j k 1 { log m ( r , U j i ) } log r = σ 1 ,rE.
(31)

Proof The inductive method will be used to prove it.

First, when i=1, i.e., U j 1 = A j + 1 + A j A 0 A 0 A j + 1 , j=0,1,2,,k1 and A k 1.

When j=0, that is U 0 1 = A 1 + A 0 A 0 A 0 A 1 . Then, we have

m ( r , U 0 1 ) m(r, A 1 )+m(r, A 0 )+m ( r , A 1 A 1 ) +m ( r , A 0 A 0 ) +O(1).
(32)

From A 0 = A 1 + U 0 1 + A 0 A 0 A 1 , we have

m(r, A 0 )m(r, A 1 )+m ( r , U 0 1 ) +m ( r , A 1 A 1 ) +m ( r , A 0 A 0 ) +O(1).
(33)

When j0, j=1,2,,k1, from the definitions of U j 1 , we have

m ( r , U j 1 ) m(r, A j + 1 )+m(r, A j )+m ( r , A 0 A 0 ) +m ( r , A j A j ) +O(1).
(34)

Since A j (z) are entire functions with max{σ( A j ):j=1,2,,k1}<σ( A 0 )< and (34), we have

max 1 j k 1 { m ( r , U j 1 ) } max 1 j k 1 { m ( r , A j ) + o ( m ( r , A 0 ) ) + O ( log r ) } .
(35)

From (32), (33), (35) and Lemma 2.6, there exists a set E[1,+) with infinite logarithmic measure such that

lim r log m ( r , U 0 1 ) log r = σ ( A 0 ) > σ 1 = lim sup r max 1 j k 1 { log m ( r , A j ) } log r lim sup r max 1 j k 1 { log m ( r , U j 1 ) } log r , r E .
(36)

Now, suppose that (31) holds for in, nN, that is, there exists a set E with infinite logarithmic measure such that

lim r log m ( r , U 0 n ) log r =σ( A 0 )> lim sup r max 1 j k 1 { log m ( r , U j n ) } log r = σ 1 .
(37)

Next, we prove that (31) holds for i=n+1. Since i=n+1, we have U j n + 1 = U j + 1 n + U j n U 0 n U 0 n U j + 1 n where j=0,1,2,,k1, and U k n 1. When j=0, When j=0, that is U 0 n + 1 = U 1 n + U 0 n U 0 n U 0 n U 1 n . Then, we have

m ( r , U 0 n + 1 ) m ( r , U 0 n ) +m ( r , U 1 n ) +m ( r , U 0 n U 0 n ) +m ( r , U 1 n U 1 n ) +O(1).
(38)

And since U 0 n = U 1 n + U 0 n + 1 U 0 n U 0 n U 1 n , we have

m ( r , U 0 n ) m ( r , U 0 n + 1 ) +m ( r , U 1 n ) +m ( r , U 0 n U 0 n ) +m ( r , U 1 n U 1 n ) +O(1).
(39)

When j0, from the definitions of U j n + 1 , j=1,2,,k1 and U k n 1, we have

m ( r , U j n + 1 ) m ( r , U j + 1 n ) +m ( r , U j n ) +m ( r , U j + 1 n U j + 1 n ) +m ( r , U 0 n U 0 n ) +O(1).
(40)

From (37)-(40), there exists a set E with infinite logarithmic measure such that

lim r log m ( r , U 0 n + 1 ) log r = lim r log m ( r , U 0 n ) log r = σ ( A 0 ) > σ 1 = lim sup r max 1 j k 1 { log m ( r , U j n ) } log r = lim sup r max 1 j k 1 { log m ( r , U j n + 1 ) } log r .
(41)

Thus, the proof of Lemma 2.7 is completed. □

Lemma 2.8 Let H j (z) (j=0,1,,k1) be meromorphic functions of finite order. If

lim sup r max 1 j k 1 { log m ( r , H j ) } log r = β 1

and there exists a set E 1 with infinite logarithmic measure such that

lim r log m ( r , H 0 ) log r = β 2 > β 1

holds for allr E 1 , then every meromorphic solution of

f ( k ) + H k 1 f ( k 1 ) ++ H 1 f + H 0 f=0
(42)

satisfies σ 2 (f) β 2 .

Proof Assume that f(z) is a meromorphic solution of (42). From (42), we have

m(r, H 0 )m ( r , f ( k ) f ) +m ( r , f ( k 1 ) f ) ++m ( r , f f ) + j = 1 k 1 m(r, H j )+O(1).
(43)

By the lemma on logarithmic derivative and (43), we have

m(r, H 0 )O { log r T ( r , f ) } + j = 1 k 1 m(r, H j ),r E 2 ,
(44)

where E 2 [1,+) is a set with finite linear measure. From the assumptions of Lemma 2.6, there exists a set E 1 with infinite logarithmic measure such that for all |z|=r E 1 E 2 we have

r β 2 ε O { log r T ( r , f ) } +(k1) r β 1 + ε ,
(45)

where 0<2ε< β 2 β 1 . From (45), we have σ 2 (f) β 2 . □

Lemma 2.9 (see [12])

Letf(z)be a transcendental meromorphic function withσ(f)=σ<, Γ={( k 1 , j 1 ),,( k m , j m )}be a finite set of distinct pairs of integers which satisfy k i > j i 0fori=1,,m. And letε>0be a given constant, then there exists a set E 3 (1,)that has finite logarithmic measure such that for all z satisfying|z|=r[0,1] E 3 and(k,j)Γ, we have

| f ( k ) ( z ) f ( j ) ( z ) | | z | ( k j ) ( σ 1 + ε ) .

Lemma 2.10 (see [20])

Letf(z)be an entire function withσ(f)=σ, τ(f)=τ, 0<σ<, 0<τ<, then for any givenβ<τ, there exists a set E 4 [1,+)that has infinite logarithmic measure such that for allr E 4 , we have

logM(r,f)>β r σ .

Lemma 2.11 Let A 0 (z), A 1 (z),…, A k 1 (z)be entire functions with finite order and satisfy0<σ( A 0 )=σ( A 1 )==σ( A k 1 )= σ 2 <andmax{τ( A j ):j=1,2,,k1}= τ 1 <τ( A 0 )=τ, and let U j 1 , U j i be stated as in Lemma 2.7, then for any given ε (0<2ε<τ τ 1 ), there exists a set E 5 with infinite logarithmic measure such that

| U j i | exp { ( τ 1 + ε ) r σ 2 } , | U 0 i | exp { ( τ ε ) r σ 2 } ,
(46)

whereiNandj=1,2,,k1.

Proof The inductive method will be used to prove it.

  1. (i)

    We first prove that U j i (j=0,1,,k1) satisfy (46) when i=1. From the definition of U j 1 = A j + 1 + A j A 0 A 0 A j + 1 (j0) and U 0 1 = A 1 + A 0 A 0 A 0 A 1 , we have

    | U 0 1 | | A 0 || A 1 | ( | A 1 A 1 | + | A 0 A 0 | )
    (47)

and

| U j 1 | | A j |+| A j + 1 | ( | A j + 1 A j + 1 | + | A 0 A 0 | ) ,j=1,2,,k1, A k 1.
(48)

From Lemma 2.9, Lemma 2.10 and (47)-(48), for any ε (0<4ε<τ τ 1 ), there exists a set E 5 with infinite logarithmic measure such that

| U 0 1 | exp { ( τ ε 4 ) r σ 2 } 2exp { ( τ 1 + ε 4 ) r σ 2 } r M exp { ( τ ε 2 ) r σ 2 }
(49)

and

| U j 1 | exp { ( τ 1 + ε 4 ) r σ 2 } + 2 exp { ( τ 1 + ε 4 ) r σ 2 } r M exp { ( τ 1 + ε 2 ) r σ 2 } , j 0 ,
(50)

where M>0 is a constant, not necessarily the same at each occurrence.

  1. (ii)

    Next, we show that U j i (j=0,1,2,,k1) satisfy (46) when i=2. From U 0 2 = U 1 1 + U 0 1 U 0 1 U 0 1 U 1 1 and U j 2 = U j + 1 1 + U j 1 U 0 1 U 0 1 U j + 1 1 (j=0,1,,k1) and U k 1 1, we have

    | U 0 2 | | U 0 1 | | U 1 1 | ( | U 1 1 U 1 1 | + | U 0 1 U 0 1 | )
    (51)

and

| U j 2 | | U j 1 |+ | U j + 1 1 | ( | U j + 1 1 U j + 1 1 | + | U 0 1 U 0 1 | ) ,j=1,2,,k1.
(52)

By the conclusions of (i) and Lemma 2.9, (49)-(52), for all |z|=r E 5 ,

| U 0 2 | exp { ( τ ε 2 ) r σ 2 } 2exp { ( τ 1 + ε 2 ) r σ 2 } r M exp { ( τ ε ) r σ 2 }
(53)

and

| U j 2 | exp { ( τ 1 + ε 2 ) r σ 2 } +2exp { ( τ 1 + ε 2 ) r σ 2 } r M exp { ( τ 1 + ε ) r σ 2 } ,j0.
(54)
  1. (iii)

    Now, suppose that (46) holds for in, nN, that is, for any given ε (0<4ε<τ τ 1 ), there exists a set E 5 with infinite logarithmic measure such that

    | U j i | exp { ( τ 1 + ε ) r σ 2 } , | U 0 i | exp { ( τ ε ) r σ 2 } (in,j=1,2,,k1).
    (55)

From U 0 n + 1 = U 1 n + U 0 n U 0 n U 0 n U 1 n and U j n + 1 = U j + 1 n + U j n U 0 n U 0 n U j + 1 n (j=0,1,,k1) and U k n 1, we have

| U 0 n + 1 | | U 0 n | | U 1 n | ( | U 1 n U 1 n | + | U 0 n U 0 n | )
(56)

and

| U j n + 1 | | U j n |+ | U j + 1 n | ( | U j + 1 n U j + 1 n | + | U 0 n U 0 n | ) ,j=1,2,,k1.
(57)

Then, from Lemma 2.9 and (55)-(57), for all |z|=r E 5 ,

| U j n + 1 | exp { ( τ 1 + ε ) r σ 2 } +2exp { ( τ 1 + ε ) r σ 2 } r M exp { ( τ 1 + 2 ε ) r σ 2 } ,j0
(58)

and

| U 0 n + 1 | exp { ( τ ε ) r σ 2 } 2exp { ( τ 1 + ε ) r σ 2 } r M exp { ( τ 2 ε ) r σ 2 } .
(59)

Thus, we complete the proof of Lemma 2.11. □

Lemma 2.12 Let B j (z), j=0,1,,k1be meromorphic functions withmax{σ( B j ):j=1,2,,k1}= σ 4 <σ( B 0 )= σ 3 andδ(, B 0 )= lim ̲ r m ( r , B 0 ) T ( r , B 0 ) >0. Then every meromorphic solution f of the equation

f ( k ) + B k 1 f ( k 1 ) ++ B 1 f + B 0 f=0
(60)

satisfies σ 2 (f) σ 3 .

Proof Let f be a meromorphic solution of Equation (60), by (60), we have

m ( r , B 0 ) m ( r , f ( k ) f ) + m ( r , f ( k 1 ) f ) + + m ( r , f f ) + j = 1 k 1 m ( r , B j ) O { log r T ( r , f ) } + j = 1 k 1 T ( r , B j ) , r E 6 ,
(61)

where E 6 [1,+) is a set with finite linear measure. By Lemma 2.6, there exists a set E with infinite logarithmic measure such that for all |z|=rE, we have

lim r log T ( r , B 0 ) log r = σ 3 ,rE.
(62)

Since δ(, B 0 )>0, then for any given ε (0<2ε< σ 3 σ 4 ) and for all rE, by (62), we have

m(r, B 0 ) r σ 3 ε .
(63)

From (61) and (63), we have

r σ 3 ε O { log r T ( r , f ) } +(k1) r σ 4 + ε ,rE E 6 .
(64)

From (64), we can get σ 2 (f) σ 3 =σ( B 0 ). □

Lemma 2.13 (see [12])

Letf(z)be a transcendental meromorphic function andα>1be a given constant, for any givenε>0, there exists a set E 7 [1,)that has finite logarithmic measure and a constantM>0that depends only on α and(m,n) (m,n{0,,k}withm<n) such that for all z satisfying|z|=r[0,1] E 7 , we have

| f ( n ) ( z ) f ( m ) ( z ) |M ( T ( α r , f ) r ( log α r ) log T ( α r , f ) ) n m .

Lemma 2.14 Let B j (z), j=0,1,,k1be meromorphic functions of finite order. If there exist positive constants σ 5 , β 3 , β 4 (0< β 3 < β 4 ) and a set E 8 with infinite logarithmic measure such that

max { | B j ( z ) | : j = 1 , 2 , , k 1 } exp { β 3 r σ 5 } , | B 0 ( z ) | exp { β 4 r σ 5 }

hold for all|z|=r E 8 , then every meromorphic solution of (60) satisfies σ 2 (f) σ 5 .

Proof Suppose that f is a meromorphic solution of (60), by (60), we have

| B 0 ( z ) | | f ( k ) f |+ j = 1 k 1 | B j ( z ) | | f ( j ) f |.
(65)

By Lemma 2.13, there exists a set E 7 with finite logarithmic measure such that for all |z|=r E 7 , we have

| f ( j ) f |M [ T ( 2 r , f ) ] j ,j=1,2,,k,
(66)

where M>0 is a constant. By (65), (66) and the assumptions of Lemma 2.14, for all |z|=r E 8 E 7 , we have

exp { β 4 r σ 5 } M [ T ( 2 r , f ) ] k exp { β 3 r σ 5 } .
(67)

Since 0< β 3 < β 4 , by (67), we have σ 2 (f) σ 5 . □

Lemma 2.15 (see [19])

Let A 0 , A 1 ,, A k 1 ,F0be meromorphic functions, if f is a meromorphic solution of the equation

f ( k ) + A k 1 f ( k 1 ) ++ A 0 f=F,

then we have the following statements:

  1. (i)

    if max{σ(F),σ( A j );j=0,1,,k1}<σ(f)=σ, then σ(f)=λ(f)= λ ¯ (f);

  2. (ii)

    if max{ σ 2 (F), σ 2 ( A j );j=0,1,,k1}< σ 2 (f)=σ, then σ 2 (f)= λ 2 (f)= λ ¯ 2 (f).

Lemma 2.16 (see [20], Theorem 1])

Let A j (z) (j=0,1,,k1) be entire functions satisfying0<σ( A k 1 )==σ( A 1 )=σ( A 0 )<, max{τ( A j ):j=1,2,,k1}<τ( A 0 )<, then every solutionf0of (3) satisfies σ 2 (f)=σ( A 0 ).

3 Proofs of theorems

3.1 The proof of Theorem 1.1

To prove the conclusions of Theorem 1.1, we will consider two cases as follows.

Case 1. Suppose that max{σ( A j ):j=1,2,,k1}<σ( A 0 )<.

  1. (i)

    First, we prove that λ ¯ 2 (fφ)= σ 2 (f). Assume that f0 is a solution of (3), from ref. [9], we have σ 2 (f)=σ( A 0 ). Set g=fφ. Since σ 2 (φ)<σ( A 0 ), then σ 2 (g)= σ 2 (f)=σ( A 0 ) and λ ¯ 2 (g)= λ ¯ 2 (fφ). By Lemma 2.1, we get that g satisfies Equation (4). Set F= φ ( k ) + A k 1 φ ( k 1 ) ++ A 0 φ. If F0, from ref. [9], we have σ 2 (φ)=σ( A 0 ), we can get a contradiction. Then F0, by Lemma 2.15, we have λ ¯ 2 (g)= λ 2 (g)= σ 2 (g)=σ( A 0 ). Thus, we have λ ¯ 2 (fφ)= λ 2 (fφ)= σ 2 (f)=σ( A 0 ).

  2. (ii)

    Second, we prove that λ ¯ 2 ( f φ)= σ 2 (f). Set g 1 = f φ, then σ 2 ( g 1 )= σ 2 (f)=σ( A 0 ). From Lemma 2.2, we get that g 1 satisfies Equation (5). Set F 1 = φ ( k ) + U k 1 1 φ ( k 1 ) ++ U 0 1 φ, where U j 1 (j=0,1,,k1) are stated as in Lemma 2.2. If F 1 0, from Lemma 2.7 and Lemma 2.8, we have σ 2 (φ)σ( A 0 ), a contradiction with σ 2 (φ)<σ( A 0 ). Hence F 1 0. By Lemma 2.15, we get λ ¯ 2 ( f φ)= λ 2 ( f φ)= σ 2 (f).

  3. (iii)

    Now, we prove that λ ¯ 2 ( f φ)= σ 2 (f). Set g 2 = f φ, then σ 2 ( g 2 )= σ 2 (f)=σ( A 0 ). From Lemma 2.3, we get that g 2 satisfies Equation (12). Set F 2 = φ ( k ) + U k 1 2 φ ( k 1 ) ++ U 0 2 φ, where U j 2 (j=0,1,,k1) are stated as in Lemma 2.3. If F 2 0, from Lemma 2.7 and Lemma 2.8, we have σ 2 (φ)σ( A 0 ), a contradiction with σ 2 (φ)<σ( A 0 ). Hence F 2 0. By Lemma 2.15, we get λ ¯ 2 ( f φ)= λ 2 ( f φ)= σ 2 (f).

  4. (iv)

    Set g 3 = f φ. From Lemmas 2.4, 2.7, 2.8 and Lemma 2.15, using the same argument as in Case 1(iii), we can get λ ¯ 2 ( f φ)= λ 2 ( f φ)= σ 2 (f) easily.

  5. (v)

    We will prove that λ ¯ 2 ( f ( i ) φ)= σ 2 (f) (i>3,iN). Set g i = f ( i ) φ, then σ 2 ( g i )= σ 2 (f)=σ( A 0 ). From Lemma 2.5, we have g i satisfies Equation (22). Set F i = φ ( k ) + U k 1 i φ ( k 1 ) ++ U 0 i φ, where U j i (j=0,1,,k1;iN) are stated as in Lemma 2.5. If F i 0, from Lemma 2.7 and Lemma 2.8, we have σ 2 (φ)σ( A 0 ), a contradiction with σ 2 (φ)<σ( A 0 ). Hence F i 0. By Lemma 2.15, we get λ ¯ 2 ( f ( i ) φ)= λ 2 ( f ( i ) φ)= σ 2 (f).

Case 2. Suppose that 0<σ( A k 1 )==σ( A 1 )=σ( A 0 )< and max{τ( A j ):j=1,2,,k1}= τ 1 <τ( A 0 )=τ.

  1. (i)

    We first prove that λ ¯ 2 (fφ)= σ 2 (f). Assume that f0 is a solution of (3), by Lemma 2.16, we have σ 2 (f)=σ( A 0 )>0. Set g=fφ. Since φ0 is an entire function satisfying σ 2 (φ)<σ( A 0 ), then we have σ 2 (g)= σ 2 (f)=σ( A 0 ) and λ ¯ 2 (g)= λ ¯ 2 (fφ). From Lemma 2.1, we get that g satisfies Equation (4). We will affirm F0. If F0, by Lemma 2.16, we get σ 2 (φ)= σ 2 ( A 0 ), a contradiction. Hence F0. From the assumptions of Theorem 1.1, we get

    max { σ 2 ( F ) , σ 2 ( A j ) : j = 0 , 1 , , k 1 } < σ 2 (g)=σ( A 0 ).

From Lemma 2.15(ii), we have λ ¯ 2 (fφ)= λ 2 (fφ)= σ 2 (f)=σ( A 0 ).

  1. (ii)

    Now we prove that λ ¯ 2 ( f φ)= σ 2 (f). Let g 1 = f φ. Since σ 2 (φ)<σ( A 0 ), we have σ 2 ( g 1 )= σ 2 (f)=σ( A 0 ). By Lemma 2.2, we have g 1 satisfies Equation (5). If F 1 0, from Lemma 2.11 and Lemma 2.14, we have σ 2 (φ)σ( A 0 ). Then we can get a contradiction with σ 2 (φ)<σ( A 0 ). Therefore, we have F 1 0. By (5) and Lemma 2.15, we have λ ¯ 2 ( f φ)= λ 2 ( f φ)= σ 2 (f)=σ( A 0 ).

Similar to the arguments as in Case 1(iii)-(v) and by using Lemmas 2.3-2.5, 2.11 and Lemma 2.14, we can get

λ ¯ 2 ( f ( i ) φ ) = λ 2 ( f ( i ) φ ) = σ 2 (f)=σ( A 0 )(iN).

Thus, the proof of Theorem 1.1 is completed.

3.2 The proof of Theorem 1.2

Since A j (z) (j=1,2,,k1) are polynomials and A 0 (z) is a transcendental entire function, then we have that A j (z) (j=0,1,2,,k1) satisfy the condition of Theorem 1.1. By using the same argument as in Theorem 1.1 and Lemma 2.15(i), we can get the conclusions of Theorem 1.2 easily.

Thus, we omit the process of proving Theorem 1.2.

3.3 The proof of Theorem 1.3

According to the conditions of Theorem 1.3, we can easily get the conclusions of Theorem 1.3 by using the similar argument as in Theorem 1.1 and Lemma 2.15.