Skip to Main Content
Purpose

The paper aims to build the relationship between an entire function of restricted hyper-order with its linear c-shift operator.

Design/methodology/approach

Standard methodology for papers in difference and shift operators and value distribution theory have been used.

Findings

The relation between an entire function of restricted hyper-order with its linear c-shift operator was found under the periphery of sharing a set of two small functions IM (ignoring multiplicities) when exponent of convergence of zeros is strictly less than its order. This research work is an improvement and extension of two previous papers.

Originality/value

This is an original research work.

By a meromorphic function f, we always mean that it is defined on C. For such a meromorphic function, we recall some basic terminologies of value distribution theory such as the Nevanlinna characteristic function T(r, f), the proximity function m(r, f) and the counting function (reduced counting function) of a-points of fN(r,1fa)=N(r,a;f) (N¯(r,1fa)=N¯(r,a;f)). For a = , we use N(r,f)=N(r,;f)N¯(r,f)=N¯(r,;f) to denote counting (reduced counting) function of poles of f (see [1]). With the help of the standard notations, we also would like to recall the following useful terms, namely exponent of convergence of zeros, order and hyper-order of f respectively defined as follows:

Usually, S(r, f) denotes any quantity satisfying S(r, f) = o(T(r, f)) for all r outside of a possible exceptional set of finite linear measure. We denote by S(f) the set of all meromorphic functions a(z) such that T(r, a(z)) = S(r, f) and a(z) is called small function compared to f(z). Let a(z) ∈ S and S be a subset of S(f) ∪{} and Ef(S) = ∪a(z)∈S{z: f(z) − a(z) = 0}, where each zero is counted according to its multiplicity. If we do not count the multiplicity, then the set ∪a(z)∈S{z: f(z) − a(z) = 0} is denoted by E¯f(S).

If Ef(S) = Eg(S) (E¯f(S)=E¯g(S)) we say that f and g share the set S CM or counting multiplicities (IM or ignoring multiplicities).

For a nonzero complex constant c, the shift operator of f(z) is denoted by f(z + c). The terms Δcf and Δckf will be used to denote the difference and k-th order difference operators of f(z), defined respectively as

We introduce the more generalized linear c-shift operator Lcf by

where ajC for j = 0, 1, 2, …, k with ak ≠ 0 (k ≥ 1).

The uniqueness problem of entire functions sharing set with their derivatives, shifts, different types of difference operators has been developed as an interesting direction of research in the realm of value distribution theory. In 1999, Li-Yang [2] made a pioneer work by considering the relation between an entire function and its derivative sharing a set with two elements. Following their footsteps, in 2005, Li [3] investigated the same type of problem for linear differential operator. Four years later, Liu [4] exhibited a similar result for an entire function f and its shift sharing a set with two small functions.

Let us start the discussion with another result of Liu [4] concerning difference operator.

Theorem A.

[4] Letfbe a transcendental entire function of finite order, and letabe a nonzero finite constant. Iffand Δcfshare the set {a, −a} CM, then Δcf = f.

After that Liu [4] posed a significant question:

Question 1.1.

What happens if {a, −a} is replaced by {a(z), b(z)} in the above theorem, wherea(z),b(z) ∈ S(f) are nonvanishing periodic entire functions with periodc?

Being motivated by this question, Li [5] investigated the following theorem in a different direction that evolved as a new trend. Actually, Li [5] first diverted the attention of the research germinated from Question 1.1, in terms of relation between exponent of convergence of zero and order. We recall the theorem by Li [5].

Theorem B.

[5] Letfbe a nonconstant entire function such thatλ(f) < ρ(f) < ,ρ(f) ≠ 1,a,bbe respectively two distinct entire functions such thatρ(a) < ρ(f) andρ(b) < ρ(f). Iffand Δcfshare the set {a, b} CM, then Δcf = ffor allzC.

By an example we can show that the restriction ρ(f) ≠ 1 in Theorem B can be removed.

Example 1.1.

Letf(z)=ezlog2c. Then obviously Δcf = f. Clearlyfand Δcfshare the set {a, b} CM for two distinct entire functionsa,brespectively such thatρ(a) < ρ(f) andρ(b) < ρ(f) and also 0 = λ(f) < ρ(f) = 1.

After publication of Li’s [5] result, there was a long gap in research in this direction. Recently in 2019, concerning finite-order entire function, Qi-Wang-Gu [6] removed the restriction ρ(f) ≠ 1 in Theorem B. Not only that, they also ensured the particular form of f in the following manner:

Theorem C.

[6] Letfbe a nonconstant entire function withλ(f) < ρ(f) < , leta,bbe respectively two distinct entire functions such thatρ(a) < ρ(f),ρ(b) < ρ(f). Iffand Δcfshare the set {a, b} CM, thenf(z) = Aeμz, whereA,μare two nonzero constants satisfyingeμc = 2. Furthermore, Δcf = f.

In our paper, we have extended and improved Theorem C in the following three directions:

  1. We replace the difference operator by its linear c-shift operator to accommodate a larger class of operators, namely Lcf that includes difference operator.

  2. We consider an entire function of ρ2(f) < 1 instead of considering the same of finite order.

  3. We relax the nature of the shared set {a, b} from CM to IM.

Thus, the following assertion extends and improves Theorem C in the way described above, and in fact it represents our main result in this paper.

Theorem 2.1.

Letfbe a nonconstant entire function such thatλ(f) < ρ(f) withρ2(f) < 1 and leta,bbe two distinct entire functions such thatρ(a) < ρ(f) andρ(b) < ρ(f). LetfandLcf (≢0) share the set {a, b} IM, thenLcf = f. In addition, ifb = −a, thenLcf = −f. In both casesftakes the formf(z) = Ah(z)eμz, whereAis a nonzero constant,h(z) is a polynomial andμis a nonzero constant satisfyingj=0kajeμcj=1and − 1 respectively. Furthermore,

  1. whenLcf = f, then one of the following can occur:

    • Ifa0 = 1, thenk ≥ 2 and deg(h) ≤ (k − 2);

    • Ifa0 ≠ 1, then deg(h) ≤ (k − 1).

  2. WhenLcf = −f, then one of the following occur:

    • ifa0 = −1, thenk ≥ 2 and deg(h) ≤ (k − 2);

    • ifa0 ≠ − 1, then deg(h) ≤ (k − 1).

Remark 2.1.

In the above theorem, if we chooseLcf = Δcf, thenk = 1,a1 = 1 anda0 = −1. Therefore conclusion (2) that means Δcf = −fis not possible. Thus from conclusion (1) we only have the form of the function asf(z) = Aeμz, whereAandμare nonzero constants satisfyingeμc = 2 and also Δcf = fholds.

The following examples will successively show that in the above theorem, respectively for the cases k = 1, k = 2 and k = 3, all possible forms of the function exist.

First we consider the case k = 1.

Example 2.1.

Letf = Aeμz,A ≠ 0. Choosing coefficients ofLcffork = 1 asa1=1a0eμcanda0 ≠ 1 we haveLcf = fandj=01ajeμcj=1. Next, choosing coefficients asa1=1a0eμcanda0 ≠ − 1 we see thatLcf = −fandj=01ajeμcj=1.

Next we shall show that for k = 2, the forms of the function can be obtained.

Example 2.2.

Letf = (Az + B)eμz,A ≠ 0. Choosing coefficients ofLcffork = 2 asa2=(1a0)e2μc,a1=2(1a0)eμc, one can easily check thatLcf = fandj=02ajeμcj=1. On the other hand, choosing coefficients asa2=1+a0e2μc,a1=2(1+a0)eμc, we easily can obtainLcf = −fandj=02ajeμcj=1.

Example 2.3.

Consider the functionfinExample 2.1. Choose coefficients ofLcffork = 2 asa2=4e2μc,a1=3eμc,a0 = 2, then we haveLcf = fandj=02ajeμcj=1. Next, choosing coefficients asa2=6e2μc,a1=3eμc,a0 = 2, we see thatLcf = −fandj=02ajeμcj=1.

For k = 3, all possible forms of the function are shown below.

Example 2.4.

Letf = (Az2 + Bz + C)eμz,A ≠ 0. Choosing coefficients ofLcffork = 3 asa3=1a0e3μc,a2=3(1a0)e2μc,a1=3(1a0)eμc, one can easily check thatLcf = fandj=03ajeμcj=1. Also, choosing coefficients asa3=1a0e3μc,a2=3(1a0)e2μc,a1=3(1a0)eμc, one can easily check thatLcf = −fandj=03ajeμcj=1.

Example 2.5.

Consider the functionfas inExample 2.2and choosing the coefficients ofLcfasa3=5e3μc,a2=9e2μc,a1=3eμc,a0 = 2, we can haveLcf = fandj=03ajeμcj=1. On the other hand, choosing coefficients asa3=9e3μc,a2=15e2μc,a1=3eμc,a0 = 2, we can getLcf = −fandj=03ajeμcj=1.

Example 2.6.

Consider the functionfinExample 2.1. Choosing coefficients ofLcffork = 3 asa3=2e3μc,a2=4e2μc,a1=3eμc,a0 = 2, clearlyLcf = fandj=03ajeμcj=1. On the other hand, choosing coefficients asa3=4e3μc,a2=4e2μc,a1=3eμc,a0 = 2, we easily getLcf = −fandj=03ajeμcj=1.

Similar examples can be constructed for the case k ≥ 4 also.

Remark 2.2.

InExamples 2.4,2.5, let us takeLcf=Δc3f. Choosingeμc = 2 we see that thoughj=03ajeμcj=(eμc1)3=1butΔc3ff. In a similar manner, for the function inExamples 2.4,2.5, choosingeμc=3+3i2we getj=03ajeμcj=(eμc1)3=1butΔc3ff. But inExample 2.6, choosingeμcsuch thatj=03ajeμcj=1or − 1, we automatically have the respective conclusionsΔc3f=forΔc3f=f. From this observation naturally one can infer that the caseLcf=Δckfneeds special attention. In fact, we can conjecture that the degree ofhcould be zero that meanshwill be a nonzero constant.

In this respect, in Theorem 2.1 replacing Lcf by Δckf we can get the next corollary.

Corollary 2.1.

Under the same assumptions ofTheorem 2.1for the operatorΔckfwe haveΔckf=f. In addition, ifb = −aandk ≥ 2, thenΔckf=f. In both casesftakes the formf(z) = Beμz, whereBandμare nonzero constants andμsatisfiesj=0k(1)kjkjeμcj=1and − 1 respectively.

Next we provide two examples to show that ρ2 < 1 is sharp.

Example 2.7.

Letf=eπizcee2πizc. Hereλ(f) < ρ(f) andρ2(f) = 1. For a suitable choices of coefficients one can obtainLcf=eπizcee2πizc. For example, for even integerk, chooseak + ⋯ + a2 + a0 = 0 andak−1 + ⋯ + a3 + a1 = 1. ClearlyfandLcfshare the set {a, −a} CM, whereais an entire function such thatρ(a) < ρ(f). ThoughLcf = −f,the form offdoes not satisfy the conclusion of our theorem.

Example 2.8.

Letf=eeπizc. Hereλ(f) < ρ(f) andρ2(f) = 1. For a suitable choices of coefficients, one can easily obtainLcf=eeπizc. For example, for even integerk, chooseak + ⋯ + a2 + a0 = 0 andak−1 + ⋯ + a3 + a1 = 1. ClearlyfandLcfshare the set{a+b,ab}CM, wherea,bare two complex constants such thatab = 1. Then neitherLcf = ±fnor the form offsatisfies the conclusion of our theorem.

In this section, some useful lemmas are quoted from references [1, 7, 9–12], which will be needed in the sequel.

Lemma 3.1.

[9] LetT: [0, + ) → [0, + ) be a nondecreasing continuous function, and lets ∈ (0, + ). If the hyper-order ofTis strictly less than 1,that is,

andδ ∈ (0, 1 − ρ2), then
whererruns to infinity outside of a set of finite logarithmic measures.
Lemma 3.2.

[9] Letf(z) be a meromorphic function ofρ2(f) < 1 andcC\{0}. Then

Using the above two basic lemmas due to [9], we have the next lemma.

Lemma 3.3.

Letf(z) be a meromorphic function ofρ2(f) < 1 andcC\{0}. Then for anyϵ > 0,

Using Lemma 3.1, by a simple alteration of the result for finite-order meromorphic functions in [8], one can have the following lemma.

Lemma 3.4.

Letf(z) be a meromorphic function ofρ2(f) < 1, then we have

and
Lemma 3.5.

[7] Letfbe a transcendental meromorphic function in the plane of order less than 1. Leth > 0. Then there exists anϵ-setEsuch that

uniformly incfor |c| ≤ h.
Lemma 3.6.

[1, 10] Letf(z) be a transcendental meromorphic solution of equation

whereA(z, f),B(z, f) are polynomials infand its derivatives with meromorphic coefficients, say {aλ: λ ∈ I}, such thatm(r, aλ) = S(r, f) for allλ ∈ I. If the total degree ofB(z, f) isn, then
Lemma 3.7.

(see[12], Theorem 1.51) Suppose thatfi(z) (i = 1, 2, …, n) andgi(z) (i = 1, 2, …, n) (n ≥ 2) are entire functions satisfying

  1. i=1nfi(z)egi(z)0,

  2. gj(z) − gk(z) are not constants for 1 ≤ j < k < n,

  3. for 1 ≤ i ≤ n, 1 ≤ k < l ≤ n,

Thenfi(z) ≡ 0 (i = 1, 2, …, n).

Now we recall the following lemma due to Lu-Lu-Li-Xu (see [11], Corollary 3.2).

Lemma 3.8.

[11] Letg (≢0) be a nonconstant meromorphic solution of the linear difference equation

(3.1).
whereR(z) is a polynomial andbis fori = 0, 1, …kare complex constants withbkb0 ≠ 0,cC\{0}andkN. Then eitherρ(g) ≥ 1 orgis a polynomial. In particular ifbk ≠ ± b0, thenρ(g) ≥ 1.
Proof of Theorem 2.1.

According to our assumption λ(f) < ρ(f) and by Hadamard factorization theorem, let us assume that f(z) = h(z)eη(z), where h(z) (≢0) is an entire function and η(z) is a nonconstant entire function satisfying

Therefore T(r, h) = S(r, f) and S(r, eη) = S(r, f) = S(r). Here,

(4.1)

Let q(z)=Lcfeη. Clearly q ≢ 0. Then placing f(z) = h(z)eη(z), in view of Lemma 3.4, we can deduce that

Since q and h are not equivalent to zero, one can easily write

(4.2)

Applying the Second Fundamental Theorem for small functions [1] on eη and then applying the First Fundamental Theorem [1] on eη − ω, we can obtain that

(4.3)

where ω (≢0) is a small function of eη.

Here ab. Without loss of generality, let us assume that a≢0. Let z0 be a zero of eηah but q(z0) ≠ 0. Since f and Lcf that means heη and qeη share the set {a, b} IM, so in view of (4.2), z0 is a zero of eηaq or eηbq. Let us denote by N¯(r,0;eηah,eηaq) the reduced counting function of those common zeros of eηah and eηaq, which are not zeros of q. Similarly, we denote by N¯(r,0;eηah,eηbq) the reduced counting function of those common zeros of eηah and eηbq, which are not zeros of q. Therefore from (4.3) we have,

which shows that either N¯r,0;eηah,eηaqS(r) or N¯r,0;eηah,eηbqS(r). Otherwise T(r, eη) = S(r). This is not possible because in view of (4.1), we can draw a contradiction. Now, we consider two cases:

  • Case 1. Suppose N¯r,0;eηah,eηaqS(r). For sake of convenience, we resolve the case step by step.

  • Step 1. In this step we will show that Lcff.

Let z1 is a zero of eηah and eηaq. It is obvious that z1 is a zero of ahaq. If ahaq0, then

which is a contradiction. Therefore h = q that implies Lcf = f.

  • Step 2. In this step we show that η(z) is a polynomial.

Expanding Lcf = f we can write

(4.4)

Choosing bj = ajh(z + jc) for j = 1, 2, …, k and b0 = (a0 − 1)h(z) we get j=0kbjeη(z+jc)=0. Clearly ρ(bl) = ρ(h(z + lc)) = ρ(h) < ρ(f) for all l = 0, 1, …, k. So, bls are finite-order entire functions. We claim that ρ(eη(z + ic)−η(z + jc)) < , for at least one pair of i, j; such that 0 ≤ i < j ≤ k. On the contrary, let us suppose, for all 0 ≤ i < j ≤ k, ρ(eη(z + ic)−η(z + jc)) = . Then T(r, bl) = o{T(r, eη(z + jc)−η(z + ic))}, for 0 ≤ l ≤ k and 0 ≤ i < j ≤ k. Hence by Lemma 3.7, bl ≡ 0 for all l = 0, 1, …, k, which is not possible. Thereby ρ(eη(z + ic)−η(z + jc)) <  implies that η(z + ic) − η(z + jc) is a polynomial. Let the degree of η(z + ic) − η(z + jc) be m. So, η(m+1)(z + ic) − η(m+1)(z + jc) = 0 that means η(m+1)(z + ic) is periodic entire function of period (j − i)c. If η(m+1)(z + ic) is nonconstant, then obviously ρ(η(m+1)(z + ic)) ≥ 1, which yields ρ(η) = ρ(η(z + ic)) = ρ(η(m+1)(z + ic)) ≥ 1. But ρ(η) < 1, a contradiction. Hence η(m+1)(z + ic) is a constant and so η(m+1)(z) is constant, which implies η(z) is polynomial.

  • Step 3. In this step we wish to show that the degree of η(z) is 1.

On the contrary, suppose the deg(η(z)) = n(say) ≥ 2. Then for j = 1, 2, …, k,

where Qj(z) is a (n − 2)-th degree polynomial and cn is the leading coefficient of η(z). Let g=ecncnzn1. So, for j = 1, 2, …, k, eη(z+jc)η(z)=gjeQj(z). Clearly T(r,eQjQk)=S(r,g) for all j = 1, 2, …, k − 1 and T(r,eQk)=S(r,g). Here we will draw a contradiction by deducing T(r, g) = S(r, g). Rewriting (4.4) we have

i.e.

(4.5)

As η(z) is a polynomial, so ρ2(h) ≤ ρ2(eη) = ρ(η) = 0, which implies ρ2(h) = 0. Since ρ(h) − 1 < ρ(f) − 1 = ρ(eη) − 1 = n − 1 = ρ(g), so by Lemma 3.3, for any ϵ > 0, mr,h(z+jc)h(z+kc)=oT(r,h)r1ϵ=S(r,g), j = 0, 1, …, k − 1.

Let H(z,g)=j=0k1Cjgj, where Cj=ajakh(z+jc)h(z+kc)eQj(z)Qk(z) for j = 1, 2, …, k − 1 and C0=1a0akh(z)h(z+kc)eQk(z). Thus, (4.5) can be written as gk−1g = H(z, g). Clearly total degree of H(z, g) is at most k − 1 and m(r, Cj) = S(r, g) for j = 0, 1, … k − 1. Hence by Lemma 3.6, m(r, g) = S(r, g) that means T(r, g) = S(r, g), a contradiction. Therefore deg(η(z)) = 1. Let us assume that η(z) = μz + C, where μ and C be two nonzero constants.

  • Step 4. In this step we deduce a necessary condition and actual form of the function.

Putting η(z) = μz + C in f(z) = h(z)eη(z), we have f(z) = Ah(z)eμz, where A = eC is a nonzero constant. Now, applying this, (4.4) can be written as

(4.6)

i.e.

Since ρ(h) < ρ(f) = ρ(eμz) = 1, so by Lemma 3.5, there exist ϵ-set E, as z ∉ E and z, such that h(z+jc)h(z)1. Thereby,

(4.7)

Since ρ(h) < 1, so by Lemma 3.8, we know that h(z) is a polynomial. Let us assume that h(z) = clzl + cl−1zl−1 + ⋯ + c1z + c0. Putting it into (4.6) and then comparing coefficients and doing a simple calculation, we have (4.7) and

Without loss of generality, we assume that all ai′ s for i = 1, 2, …, k are nonzero. Now, the above system of equations can be written as

(4.8)

where A1=1111123k122232k21l2l3lkl(l+1)×k, X=a1eμca2e2μca3e3μcakekμck×1 and B=1a0000(l+1)×1.

Let C be the corresponding augmented matrix. It is obvious that rank(A1) = min{l + 1, k}. Clearly rank(C) = min{l + 1, k + 1}.

Suppose a0 ≠ 1. So the nonhomogeneous system (4.8) has unique solution when l = k − 1, infinitely many solutions when l < k − 1 and no solutions when l > k − 1. Hence deg(h) ≤ (k − 1).

Next suppose a0 = 1. Then for k = 1, Lcf = f and (4.7) both implies a1 = 0, which is not possible. So in this case obviously k ≥ 2. Now, the homogeneous system A1X = 0 has solutions when l ≤ k − 2. Thus, we have our desired Conclusion 1.

  • Case 2. Suppose N¯r,0;eηah,eηbqS(r). Let z2 is a zero of eηah and eηbq. It is obvious that z2 is a zero of ahbq. If ahbq0, then

which is a contradiction. Therefore

(4.9)

Since a≢0, therefore b ≢ 0. Let z3 be a zero of eηbh but q(z0) ≠ 0. Since heη and qeη share the set {a, b} IM, so z3 is a zero of eηaq or eηbq. Let us denote by N¯(r,0;eηbh,eηaq) the reduced counting function of those common zeros of eηbh and eηaq, which are not zeros of q. similarly, we denote by N¯(r,0;eηbh,eηbq) the reduced counting function of those common zeros of eηbh and eηbq, which are not zeros of q. Therefore from (4.3) we have,

which shows that either N¯r,0;eηbh,eηaqS(r) or N¯r,0;eηbh,eηbqS(r). Otherwise T(r, eη) = S(r), which is not possible in view of (4.1). Now, we consider two subcases:

Subase 2.1. Suppose N¯r,0;eηbh,eηaqS(r). Then proceeding in a similar manner as used in starting portion of Case 2, we have bh=aq. In view of (4.9) we get, a2 = b2. As ab, so obviously b = −a. Therefore we must have q = −h that implies Lcf = −f. Further following the same steps as done in Case 1, we can have the form of the function as f(z) = Ah(z)eμz satisfying

(4.10)

Next adopting the similar calculations as done in Step 4, for a0 ≠ − 1, we have deg(h) ≤ (k − 1) and for a0 = −1, we have k ≥ 2 and deg(h) ≤ (k − 2). Thus, we have corresponding desired conclusion (2).

Subcase 2.2. Suppose N¯r,0;eηbh,eηbqS(r), which is similar to the Case 1 and so, we get the desired result.

Hence the proof is completed. □

Proof of Corollary 2.1.

To prove this corollary, it is sufficient to prove that deg(h) = 0, where h(z) = clzl + cl−1zl−1 + ⋯ + c1z + c0 (l ≤ k − 1), cl ≠ 0. We know for the operator Δckf, aj=(1)kjkj, where j = 0, 1, …, k.

From conclusion 1. of Theorem 2.1 we have, Δckf=f and f takes the form f = Ah(z)eμz, where A is a nonzero constant, h(z) is a polynomial and μ is a nonzero constant satisfying j=0k(1)kjkjeμcj=1, that is, (eμc1)k=1. Now putting f = A(clzl + cl−1zl−1 + ⋯ + c1z + c0)eμz into Δckf=f and then comparing coefficient of zk−1, we have

As c ≠ 0, cl ≠ 0 and (eμc1)k=1 and also we know jkj=kk1j1, so we get

(4.11)

Clearly in view of (eμc1)k=1, l must be 0.

From conclusion 2. of Theorem 2.1 we have, b = −a, Δckf=f and f takes the form f = Ah(z)eμz, where A is a nonzero constant, h(z) is a polynomial and μ is a nonzero constant satisfying j=0k(1)kjkjeμcj=1, that is, (eμc1)k=1. Here obviously k ≥ 2. Proceeding in a similar manner as in above, again we can have (4.11) and in view of (eμc1)k=1, we can conclude l = 0. So in both cases l = 0 that means deg(h) = 0. Hence the corollary is proved. □

As we know λ(f) ≤ ρ(f) and since throughout the paper we have dealt with the case λ(f) < ρ(f), it will be interesting to inspect whether the same conclusions hold for the case λ(f) = ρ(f). In the next two examples we point out the fact that when λ(f) = ρ(f), the conclusion of Theorem 2.1 ceases to hold.

Example 5.1.

Letf = ez(e2z + 1). Choosec = πiand for even integerk,ak + ⋯ + a2 + a0 = 0 andak−1 + ⋯ + a3 + a1 = 1. Thenλ(f) = ρ(f) = 1 andLcf = −ez(e2z + 1). ClearlyLcfandfshare the set {a, −a} CM, whereais an entire function such thatρ(a) < ρ(f). ThoughLcf = −f, the form offdoes not satisfy the conclusion ofTheorem 2.1.

Example 5.2.

Letf = −ez + 3 and(ec1)2=1. ThenΔc2f=ezandλ(f) = ρ(f) = 1. ClearlyΔc2fandfshare the set {1, 2} CM butΔc2f±f.

In view of the above two examples, we can conclude that in Theorem 2.1, λ(f) < ρ(f) is sharp, but the conclusion of the same theorem under the case λ(f) = ρ(f) is still an enigma. So we place it as an open question:

Question 5.1.

Under the hypothesisλ(f) = ρ(f), what will be the answer of theQuestion 1.1concerningΔckfor evenLcf?

The authors wish to thank the referee for a careful reading and valuable suggestions toward the improvement of the paper. The first author is thankful to DST-PURSE –II Programme for financial assistance. The second author is thankful to the Council of Scientific and Industrial Research (India) for their financial support under File No: 09/106 (0188)/2019- EMR-I.

1.
Hayman
,
WK
.
Meromorphic functions
.
Oxford
:
The Clarendon Press
;
1964
.
2.
Li
,
P
,
Yang
,
CC
.
Value sharing of an entire function and its derivatives
.
J Math Soc Japan
.
1999
;
51
(
4
):
781
-
99
.
3.
Li
,
P
.
Value sharing and differential equations
.
J Math Anal Appl
.
2005
;
310
:
412
-
23
.
4.
Liu
,
K
.
Meromorphic functions sharing a set with applications to difference equations
.
J Math Anal Appl
.
2009
;
359
:
384
-
93
.
5.
Li
,
XM
.
Entire functions sharing a finite set with their difference operators
.
Comput Meth Func Theor
.
2012
;
12
(
1
):
307
-
28
.
6.
Qi
,
J
,
Wang
,
Y
,
Gu
,
Y
.
A note on entire functions sharing a finite set with their difference operators
.
Adv Differ Equ
.
2019
;
114
:
1
-
7
.
7.
Bergweiler
,
W
,
Langley
,
JK
.
Zeros of differences of meromorphic function
.
Math Proc Camb Philos Soc
.
2007
;
142
:
133
-
47
.
8.
Chiang
,
YM
,
Feng
,
SJ
.
On the Nevanlinna Characteristic f(z + η) and difference equations in complex plane
,
Ramanujan J
.
2008
;
16
:
105
-
29
.
9.
Halburd
,
RG
,
Korhonen
,
RJ
,
Tohge
,
K
.
Holomorphic curves with shift invariant hyperplane preimages
.
Trans Am Math Soc
.
2014
;
366
:
4267
-
98
.
10.
Laine
,
I
.
Nevanlinna theory and complex differential equations, studies in math
.
Berlin
:
de Guryter
.
1993
;
15
.
11.
Lu
,
F
,
Lu
,
W
,
Li
,
C
,
Xu
,
J
.
Growth and uniqueness related to complex differential and difference equations
.
Results Math
.
2019
;
74
.
Art. 30
:
1
-
18
.
12
Yang
,
CC
,
Yi
,
HX
.
Uniqueness theory of meromorphic functions
.
Dordrecht
:
Kluwer Academic Publishers
;
2003
.
Published in Arab Journal of Mathematical Sciences. Published by Emerald Publishing Limited. This article is published under the Creative Commons Attribution (CC BY 4.0) licence. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this licence may be seen at http://creativecommons.org/licences/by/4.0/legalcode

or Create an Account

Close Modal
Close Modal