Interpolation of entire functions on regular sparse
sets and q-Taylor series
par MICHAEL WELTER
RÉSUMÉ. Nous donnons une démonstration alternative d’un théo- rème de Ismail et Stanton et
appliquons
cela à des fonctions en-tières
arithmétiques.
ABSTRACT. We give a pure
complex
variableproof
of a theo-rem
by
Ismail and Stanton andapply
this result in the field ofinteger-valued
entire functions. Ourproof
rests on a verygeneral interpolation
result for entire functions.1. Introduction
In
[4] (see
also the referencesthere)
Ismail and Stanton established q-analogues
ofTaylor
seriesexpansions
of entirefunctions,
so-calledq-Taylor series,
and gave someapplications
of these. Theirproofs depend heavily
on the
theory
of basichypergeometric
functions.In this note we will deduce one of their theorems from an
interpolation
formula which we will prove in section 2. In section 3 we will
give
anotherapplication
of theq-Taylor
series in the field of the so-calledinteger-valued
entire functions and
give
a first answer on aquestion
askedby
Ismail andStanton in
[4].
We start with some definitions and notations.
Throughout
this section let q, a E(C ~ ~0~ with Iql ~
1. We denoteby Q
the maximum ofIql
andThe
q-shifted
factorials are definedby
We put
and
This work was supported by the DFG (German Research Foundation).
for n =
0,1, 2, 3, .... Finally
we denote for an entire functionf
where as
usual I f 1, :
:=I f (z) I -
The theorem of Ismail and Stanton(Theorem
3.3 in[4])
statesTheorem 1.1. Let
f
be an entirefunctions
withQ( f ) 1/(2log Q).
Thenwe have
_for
all z E Cwith
Remark. Ismail and Stanton state the theorem
only
for real a, q with0a,q1.
2.
Interpolation
of entire functions onregular
sparse sets For subsets X C C weput
= card{x
Er}.
Definition. We call a subset X C C
regular
sparse, if X isinfinite,
discreteand satisfies the
following
condition:There exist 0 +oo
[ and
T E R such thatIn
[6]
we studied entire functionsf
that areinteger-valued
onregular
sparse sets X C Z. There we
proved
thefollowing
characterization ofregular
sparse sets(see [6],
Lemma1).
Lemma 2.1. Let X be an
infinite,
discrete subsetof C.
Then thefollowing
three statements are
equivalent:
(i)
X isregular
sparse.(ii)
For all 0+oo[
there exists a T E R suchthatox ~re~ (r)+
(r))
when r - +oo.Therefore it is useful to define
and the main result of this section states as follows.
Theorem 2.2. Let X be a
regular
sparse subset and let(xn)ncN"
bethe sequence
of
all distinct elementsof
X orderedby increasing
modulus.Then we have
for
all entirefunctions f
withthe series
expansion
where
Px,o(z)
:= 1 andPX,n(z)
:=(z - Xn-l)PX,n-l(Z) for
all n > 1 andTherefore,
every suchf
isuniquely,
determinedby
its values on X.Remark. In
[6]
weproved
that the entirefunction g
which is definedby
has a
growth
boundedby
for all
sufficiently large
r, whereBefore we prove the above
theorem,
we will deduce theorem 1.1 from it.Proof of
theorem 1.1. We set X = ENol.
Then we haveqbx (r) = logr/ log Q
+O(1)
when r ~ +oo, = 0 andA(X)
=1/2.
Hence(3)
becomes
Q( f ) 1/(2 log Q).
The
polynomial a)
is ofdegree
n in z and has theproperty
Øn(Zk; a)
= 0 for 1~ =0, ... ,
n - 1. Hence0,, (z; a)
=cn Px,,,, (z)
withWe have
and
From this we deduce
/_’B
And therefore we
get
from(4)
This proves Theorem 1.1 D
Proof of
theorem 2.2. Without loss ofgenerality
we assume thatI x I
> 1 for all .r e X.Let n be a
positive integer,
which we assume to besufficiently large.
Letr be a real with r >
lxn-11.
We willspecify
r a little bit later in theproof.
For every z C C
with lzl
r we have(see
e.g. Bundschuh[3])
and
Obviously (4)
follows from(8) by Cauchy’s integral
formula.To prove the
theorem,
it is thereforeenough
to prove that under theassumptions
of Theorem 2.2 the reminderRx,n
convergesuniformly against
the zero function on any compact subset of C.
We suppose that we have
log qqb x (r) log r
with aconstant 7
~yo for allsufficiently large
r. Further we fix a 0[ such
thatFor 0 >
1,
we have2 ]rn ] IXnl8 =: r for all sufficiently large
n. There-
fore we can estimate
The last
equality
follows from the fact that(Ixnl) = n + 0 (1)
for all n.By Proposition
1 of[6]
weknow,
that forregular
sparse sets X there areconstants c, a > 0 such that
log
cna for all n. Hence the limitexists. This leads to
and for
all with lçl
= rFurther we have if n and therefore r is
sufficiently large
Here we have
again
used the fact that the set X isregular
sparse.If we further assume, that 2J r, then we
get
from(9)
which shows that
RX,n(z)
convergesagainst
zero when n tends toinfinity.
Hence the theorem is proven. 0
3.
Application
of Theorem 1.1 tointeger-valued
entire functions In this section we willgive
some statements about entire functions thatare
integer-valued
on the sequence zn =(aqn
+a-lq-n)/2.
The
following
theorem is acorollary
to Theorem 1 in[6],
ageneral
resulton
integer-valued
entire functions onregular
sparse sets X c Z. From this theorem oneeasily
deducesTheorem 3.1. Let a, q E
~C ~ 0 1
1 suchthat zn
:=1(aqn
+for
every n EN‘o,
and letf
be an entirefunction
such thatf(zn)
E Zfor
every n ENo
andfor
allsufficiently large
r. Thenf
is apolynorrtial function.
Remark. The case a = ::!:1 was
essentially
treatedby
B6zivin in~1, 2). By
using
aninterpolation
series method he obtained a better upper bound for q than that in the above theorem. The sequence(zn)
is the solution of the linear differenceequation
un+1 =(q -I- q-1)un -
with the initial valuesuo =
(a
+a-l)/2
and al =(aq+a-lq-l)/2.
Hence thecondition zn
E Zfor all n E
No
isobviously
satisfied if the three numbersare rational
integers.
Therefore the theorem above covers notonly
the casea = ::i::1 and we
get
some newapplications
with a, q bothlying
in the samereal
quadratic
number field.From the
q-Taylor
theorem1.1,
we can deduce thefollowing result,
whichcovers another case.
Theorem 3.2. Let K
be Q
or animaginary- quadratic
numberfield
andOoc
be itsring of integers.
Further let a, q EOoc B (0)
withI q I
> 1 anda2 tt fq-’Iv E NJ. If f
is an entirefunction satisfying f (zn)
EOoc for
alln E
No
andfor
allsufficiently large
r, thenf
is apolynomial function.
Proof.
If4bd
denotes the d-thcyclotomic polynomial,
then we have for alln E N and k E
{0, ... , n} (see Lang [5],
p.279f.)
Obviously
we haveHence,
if weput Dn
:=(?;?)~ fl2,1l(l - # 0, it
follows from(5)
and
(6)
thatD,, Ax,,,
EZ [a, q]
for all n ENo.
Therefore1,
ifDnAx,n
is notequal
to zero.On the other
hand,
we findby (8)
like in theproof
of Theorem2.2, again
withr:=
IZn Ie
Obviously
the two infiniteproducts
converge, and therefore we
get
We now chose 0 =
1 / (2~y) . If q 1/10
then the upper bound ofI
is less than 1 for all
sufficiently large
n. HenceDnAx,n
= 0 for this n.For we know that
Dn
is not zero, thisimplies
that vanishes for allsufficiently large
n. This proves the theorem.0 References
[1] J.-P. BÉZIVIN, Sur les points où une fonction analytique prend des valeurs entières. Ann.
Inst. Fourier 40 (1990), 785-809.
[2] J.-P. BÉZIVIN, Fonctions entières prenant des valeurs entières ainsi que ses dérivées sur des suites recurrentes binaires. Manuscripta math. 70 (1991), 325-338.
[3] P. BUNDSCHUH, Arithmetische Eigenschaften ganzer Funktionen mehrerer Variablen. J. reine angew. Math. 313 (1980), 116-132.
[4] M. E. H. ISMAIL, D. STANTON, q-Taylor theorems, polynomial expansions, and interpolation of entire functions. Journal of Approximation Theory 123 (2003), 125-146.
[5] S. LANG, Algebra. 3rd edition, Addison-Wesley (1993).
[6] M. WELTER, Ensembles régulièrement lacunaires d’entiers et fonctions entières arith- métiques. J. Number Th. 109 (2004), 163-181.
Michael WELTER
Mathematisches Institut der Universitat Bonn
Beringstr. 4
53115 Bonn, Allemagne
E-mail: welter0math.uni-bonn.de