1. Introduction
The solutions of the partial differential equation
(1) ∂2u∂x2+∂2u∂y2+2μy∂u∂y+k2u=0, μ>0,
are called the generalized axially symmetric Helmholtz equation functions (GASHEs). The GASHE function u, regular about the origin, has the following Bessel-Gegenbauer series expansion:
(2)u(r,θ)=Γ(2μ)(kr)-μ∑n=0∞ann!Γ(2μ+n)Jμ+n(kr)Cnμ(cosθ),
where x=rcosθ, y=rsinθ,Jμ+n are Bessel functions of first kind, and Cnμ are Gegenbauer polynomials. A GASHE function u is said to be entire if the series (2) converges absolutely and uniformly on the compact subsets of the whole complex plane. For u being entire, it is known [1, page 214] that:
(3)limsupn→∞(|an|Γ(n+μ+1))1/n=0.
Now we define
(4)M(r,u)=max0≤θ≤2π|u(r,θ)|.
Following the usual definitions of order and type of an entire function of a complex variable z, the order ρ and type T of u are defined as
(5)ρ(u)=limsupr→∞log logM(r,u)logr,T(u)=limsupr→∞logM(r,u)rρ(u), 0<ρ(u)<∞.
Gilbert and Howard [2] have studied the order ρ(u) of an entire GASHE function u in terms of the coefficients an’s occurring in the series expansion (2) (see also [1, Theorem 4.5.9]). It has been noticed that the coefficients characterizations for lower order and lower type of u have not been studied so far. In this paper, we have made an attempt to bridge this gap. McCoy [3] studied the order and type of an entire function solutions of certain elliptic partial differential equation in terms of series expansion coefficients and approximation errors. Recently, Kumar [4, 5] obtained some bounds on growth parameters of entire function solutions of Helmholtz equation in R2 in terms of Chebyshev polynomial approximation errors in sup-norm. In the present paper, we have considered the different partial differential equation from those of McCoy [3] and Kumar [4, 5] and obtained the growth parameters such as lower order and lower type of entire GASHE function in terms of the coefficients in its Bessel-Gegenbauer series expansion (2). Alternative characterizations for order and type are also obtained in terms of the ratios of these successive coefficients. Our approach and method are different from all these of the above authors.
2. Auxiliary Results
In this section, we shall prove some preliminary results which will be used in the sequel.
We prove the following lemma.
Lemma 1.
If u is an entire GASHE function, then for all r>0, r*>1, K,K*<∞ and for all n,
(6)(K*)-1|an|n!(kr2r*)n(Γ(μ+(1/2)))2π22-μ ≤M(r,u)≤K∑n=0∞|an|n!(kr2)n.
Proof.
First we prove right hand inequality. Using the relations
(7)|Jμ(r)|≤(r/2)μΓ(μ+1),max0≤θ≤2π|Cnμ(cosθ)|≤Γ(n+2μ)(Γ(n+1))Γ(2μ),
in (2), we get
(8)M(r,u)≤∑n=0∞|an|n!(kr2)n(Γ(n+1)Γ(n+μ+1))≤K∑n=0∞|an|n!(kr2)n.
Now to prove left hand inequality, we use the orthogonality property of Gegenbauer polynomials [1, page 173] and the uniform convergence of the series (2) as
(9)an2(2μ-1)(Γ(μ+1/2))2(n+μ)Γ(2μ)(kr)-μJμ+n(kr) =∫0πsin2μθ Cnμ(cosθ)u(r,θ)dθ.
From the series expansion of Jμ+n(kr), we get
(10)Jμ+n(kr)=(krr)μ+n∑m=0∞(-1)m(kr)2m22mm!Γ(n+μ+m+1)=(krr)μ+n1Γ(n+μ+1)×∑m=0∞(-1)m(kr)2mΓ(n+μ+1)22mm!Γ(n+μ+m+1)
and for n≥[(kr)2], where [x] denotes the integral part of x, we have
(11)Jμ+n(kr)≥12Γ(n+μ+1)(kr2)μ+n.
From (7), (9), and (11), for n≥[(kr)2], we now get
(12)|an|n!(kr2)n ≤π22-μ Γ(n+2μ)Γ(n+μ+1)(Γ(μ+1/2))2(Γ(n+1))2(n+μ)M(r,u).
Since [Γ(n+2μ)Γ(n+μ+1)/(Γ(n+1))2]1/n→1 as n→∞, we can choose constants k*<∞ and r*>1 such that (n+μ)Γ(n+2μ)Γ(n+μ+1)/(Γ(n+1))2≤K*r*n for n≥1. Thus, for n≥[(kr)2], (12) gives that
(13)(Γ(μ+1/2))2π22-μK*-1|an|n!(kr2r*)n≤M(r,u).
Hence the proof of Lemma 1 is complete.
We now define
(14)f(z)=∑n=0∞|an|(k/2)nn!zn, g(z)=∑n=0∞|an|n!(k2r*)nzn.
Lemma 2.
If u is an entire GASHE function, then f and g are also entire functions of the complex variable z. Further
(15)(Γ(μ+1/2))2K*π22-μm(r,g)≤M(r,u)≤KM(r,f),
where m(r,g)=maxn[(|an|/n!)(kr/2r*)n] and M(r,f)=max|z|≤r|f(z)|.
Proof.
Let u be an entire. In view of (3), we have
(16)limn→∞[|an|n!(k2)n]1/n=limn→∞[|an|n!(k2r*)n]1/n=limn→∞[|an|Γ(n+μ+1)]1/n=0.
Hence both f and g are entire. Inequalities in (15) follow from (6).
Lemma 3.
Let f and g be entire functions of particular form defined by (14). Then orders and types of f and g, respectively, are identical.
Proof.
It is well known [6, pages 9–11] that if ϕ(z)=∑n=0∞αnzn is an entire function, then the order ρ(ϕ) and type T(ϕ) are given as
(17)ρ(ϕ)=limsupn→∞nlognlog|αn|-1,(18)T(ϕ)=1eρ(ϕ)limsupn→∞ n|αn|ρ(ϕ)/n.
Hence for the function f(z)=∑n=0∞(k/2)n(|an|/n!)zn, we have
(19)1ρ(f)=liminfn→∞ log((|an|/n!)(k/2)n)-1nlogn=liminfn→∞ log|an|-1nlogn+logn!nlogn-nlog(k/2)nlogn=liminfn→∞ log|an|-1nlogn.
Similarly, for g(z)=∑n=0∞(|an|/n!)(k/2r*)nzn, we have
(20)1ρ(g)=liminfn→∞ log[|an|/n!(k/2r*)n]-1nlogn=liminfn→∞ log|an|-1+logn!-log(k/2r*)nlogn=liminfn→∞ log|an|-1nlogn.
It follows that ρ(f)=ρ(g). Since f and g have the same order, using (18), we can easily see that T(f)=T(g). Hence the proof is complete.
In analogy with the definitions of order and type, we define lower order λ and lower type t as
(21)λ(u)=liminfr→∞ log logM(r,u)logr,t(u)=liminfr→∞ logM(r,u)rρ(u), 0<ρ(u)<∞.
Theorem 4.
Let u be an entire GASHE function of order ρ(u), lower order λ(u), type T(u), and lower type t(u). If f and g are entire functions as defined above, then
(22)ρ(f)=ρ(u)=ρ(g),(23)T(f)=T(u)=T(g),(24)λ(g)≤λ(u)≤λ(f),(25)t(g)≤t(u)≤t(f).
Proof.
Using (15) we get
(26)limsupr→∞inflog logm(r,g)logr≤limsupr→∞inflog logM(r,u)logr≤limsupr→∞inflog logM(r,u)logr.
In view of [6, page 13] for an entire function ϕ of finite order we have,
(27)logM(r,ϕ)≃logm(r,f) as r→∞.
Now from above relation (26), we obtain
(28)ρ(g)≤ρ(u)≤ρ(f), λ(g)≤λ(u)≤λ(f).
Since ρ(g)=ρ(f), it proves (22) and (24).
Denoting by ρ the common value of order of f, g, and u, we have from (15),
(29)limsupr→∞logm(r,g)rρ≤limsupr→∞logM(r,u)rρ≤limsupr→∞logM(r,f)rρ.
Hence by Lemma 3 we obtain (23). Similarly, we can prove (25).
Lemma 5.
If (βn/βn+1) forms a nondecreasing function of n, then (γn/γn+1) and (δn/δn+1) also form a nondecreasing function of n, where βn=|an|/Γ(n+μ+1), γn=(|an|/n!)(k/2)n, δn=(|an|/n!)(k/2r*)n.
Proof.
We have
(30)γnγn+1=|an||an+1|(n+1)!n!(k2)-1=βnβn+1(n+1)Γ(n+μ+1)Γ(n+μ+2)(k2)-1.
Let
(31)p(x)=(x+1)Γ(x+μ+1)Γ(x+μ+2)≃(x+1)(x+μ+1)-1
[
by
Γ
(
x
+
a
)
/
Γ
x
~
x
a
as x
→
∞
]
(32)
log
p
(
x
)
=
log
(
x
+
1
)
-
log
(
x
+
μ
+
1
)
.
By logarithmic differentiation, we get
(33)p′(x)p(x)=1x+1-1x+μ+1.
Let w(x)=1/(x+1),w(x)-w(x+μ)>0 for any x>0.
Hence w(x) is a decreasing function and subsequently p′(x)>0 for x>0. Hence (γn/γn+1) is nondecreasing if (βn/βn+1) is nondecreasing. Similarly we can prove the result for (δn/δn+1).
3. Main Results
Now we prove the following theorem.
Theorem 6.
Let u be an entire GASHE function of order ρ(u) (0<ρ(u)<∞), type T(u), and lower type t(u). Then
(34)liminfn→∞(k2r*)ρ(u)nρ(u)(βn+1βn)ρ(u) ≤t(u)≤T(u)≤limsupn→∞(k2)ρ(u)nρ(u)(βn+1βn)ρ(u).
Further, if (βn+1/βn) forms a nondecreasing function of n for all n>n0, then
(35)limsupn→∞nρ(u)(βn+1βn)ρ(u)≤eT(u)(2k)ρ(u),limsupn→∞lognlog(βn/βn+1 )=ρ(u).
Proof.
If ϕ(z)=∑n=0∞αnzn is an entire function of order ρ(ϕ), type T(ϕ), and lower type t(ϕ), then we have [7, Theorem 1]
(36)liminfn→∞nρ(ϕ)(αn+1αn)ρ(ϕ)≤t(ϕ)≤T(ϕ)≤limsupn→∞nρ(ϕ)(αn+1αn)ρ(ϕ).
Applying right hand inequality to f(z)=∑γnzn, we get
(37)T(f)≤limsupn→∞nρ(f)[|an+1||an|n!(n+1)!k2]ρ(f)=limsupn→∞nρ[|an+1|Γ(n+μ+1)Γ(n+μ+2)|an| ×Γ(n+μ+2)Γ(n+μ+1)(n+1)k2]ρ.
Since
(38)Γ(n+μ+2)Γ(n+μ+1)1(n+1)~(n+μ+1)(n+1)→1 as n→∞,T(u)=T(f)≤limsupn→∞(k2)ρnρ(βn+1βn)ρ.
To prove left hand inequality in (34), we consider the entire function g(z)=∑n=0∞δnzn. Then
(39)liminfn→∞nρ[|an+1|(n+1)!(k2r*)n!|an|]ρ≤t(g) =liminfn→∞nρ[|an+1||an|Γ(n+μ+1)Γ(n+μ+2) ×Γ(n+μ+2)Γ(n+μ+1)(n+1)(k2r*)]ρ =liminfn→∞nρ[βn+1βnk2r*]ρ≤t(g)≤t(u).
Thus the proof of (34) is complete. To prove (35), consider an entire function ϕ(z)=∑n=0∞αnzn of order ρ(ϕ) and type T(ϕ). If |αn/αn+1| forms a nondecreasing function of n for n>n0, then we know ([8], [9, Theorem 2]) that
(40)ρ(ϕ)=limsupn→∞lognlog|αn/αn+1|.
Further, we have [8, Theorem 3]
(41)limsupn→∞nρ(ϕ)|αn+1αn|ρ(ϕ)≤eT(ϕ).
Now let us suppose that (βn/βn+1) forms a nondecreasing function of n for n>n0. From Lemma 5, (γn/γn+1) also forms a nondecreasing function of n for n>n0. Using (40) to f(z)=∑n=0∞γnzn, we get
(42)ρ(f) =limsupn→∞lognlog(γn/γn+1) =limsupn→∞logn ×(log(βnβn+1)+log(n+1)-log(n+μ+1) -log(k2))-1 =limsupn→∞lognlog(βn/βn+1), [log((βn/βn+1)k2)~log(βnβn+1) as n→∞].(43)ρ(f) =limsupn→∞lognlog(γn/γn+1) =limsupn→∞lognlog(βn/βn+1),[log((βn/βn+1)k2) ~log(βnβn+1) as n→∞].
Now using (41) for f(z)=∑n=0∞γnzn, we get
(44)limsupn→∞nρ(f)[βn+1βn(n+μ+1)(n+1)k2]ρ(f)≤eT(f).
Since ρ(f)=ρ, T(f)=T, thus, we get
(45)limsupn→∞nρ[βn+1βn]ρ≤e(2k)ρT.
Hence the proof is complete.
Theorem 7.
Let u be an entire GASHE function of order ρ, 0<ρ<∞, lower order λ, and lower type t. If (βn/βn+1) forms a nondecreasing function of n for n>n0, then
(46)λ=liminfn→∞nlognlog(βn)-1,(47)t=liminfn→∞neρ(βn)ρ/n.
Proof.
For entire function ϕ(z)=∑n=0∞αnzn, if |αn/αn+1| forms a nondecreasing function of n for n>n0, then we have ([8], [10, Theorem 2])
(48)λ(ϕ)=liminfn→∞nlognlog(αn)-1.
Let (βn/βn+1) forms a nondecreasing function n for n>n0. Applying Lemma 5 and (48) to f(z)=∑n=0∞γnzn, we get
(49)λ(f)=liminfn→∞nlognlog((|an|/n!)(k/2)n)-1=liminfn→∞nlognlog(βn)-1.
Similarly, using Lemma 5 and (48) for entire function g(z)=∑n=0∞δnzn, we have
(50)λ(g) =liminfn→∞nlognlog[(|an|/n!)(k/(2r*))n]-1 =liminfn→∞nlognlog(βn)-1-log(n+1)μ-nlog(k/2r*) =liminfn→∞nlognlog(βn)-1.
The result (46) is now followed by (24) and above two relations for λ(f) and λ(g).
If ϕ(z)=∑n=0∞αnzn is an entire function of order ρ(ϕ), lower type t(ϕ), and |αn/αn+1| forms a nondecreasing function of n for n>n0, then by a result of Shah [11], we have
(51)t(ϕ)=liminfn→∞neρ(ϕ)(αn)ρ(ϕ)/n,t(g)=liminfn→∞neρ(g)(βn)ρ(g)/n.
Equation (47) now follows in view of (22) and (25). Hence the proof is complete.
Theorem 8.
Let u be an entire GASHE function of lower order λ, and let |α/αn+1| forms a nondecreasing function of n for n>n0. Then
(52)λ=liminfn→∞lognlog(βn/βn+1),
Proof.
For an entire function ϕ(z)=∑n=0∞αnzn, from [12, Corollary, page 312], we get
(53)λ(ϕ)=liminfn→∞nlognlog|αn/αn+1|.
provided |αn/αn+1| forms a nondecreasing function of n for n>n0. Applying this condition on {βn}, we can easily show, as in Theorem 6, that
(54)λ(f)=liminfn→∞lognlog(βn/βn+1).
Applying (53) to g(z)=∑n=0∞δnzn also, we have
(55)λ(g)=liminfn→∞lognlog(βn/βn+1).
The relation (48) now follows on using (24). Hence the proof is complete.