Asymptotic expansion of Mathieu power series and trigonometric Mathieu series
Stefan Gerhold, Zivorad Tomovski

TL;DR
This paper derives a comprehensive asymptotic expansion for a generalized Mathieu series involving complex powers and explores asymptotic behavior of trigonometric Mathieu series, extending previous results.
Contribution
It introduces a full asymptotic expansion for generalized Mathieu series using Mellin transforms and polylogarithm functions, expanding on known results for alternating series.
Findings
Asymptotic expansion expressed via polylogarithm and Hurwitz zeta functions
Extension of known expansions to generalized Mathieu series with complex powers
First-order asymptotic behavior of trigonometric Mathieu series analyzed
Abstract
We consider a generalized Mathieu series where the summands of the classical Mathieu series are multiplied by powers of a complex number. The Mellin transform of this series can be expressed by the polylogarithm or the Hurwitz zeta function. From this we derive a full asymptotic expansion, generalizing known expansions for alternating Mathieu series. Another asymptotic regime for trigonometric Mathieu series is also considered, to first order, by applying known results on the asymptotic behavior of trigonometric series.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Asymptotic expansion of Mathieu power series
and trigonometric Mathieu series
Stefan Gerhold
TU Wien
[email protected] S. Gerhold gratefully acknowledges financial support from the Austrian Science Fund (FWF) under grant P 30750 and from OeAD under grant MK 04/2018.
Živorad Tomovski
Saints Cyril and Methodius University of Skopje
Abstract
We consider a generalized Mathieu series where the summands of the classical Mathieu series are multiplied by powers of a complex number. The Mellin transform of this series can be expressed by the polylogarithm or the Hurwitz zeta function. From this we derive a full asymptotic expansion, generalizing known expansions for alternating Mathieu series. Another asymptotic regime for trigonometric Mathieu series is also considered, to first order, by applying known results on the asymptotic behavior of trigonometric series.
Keywords: Mathieu power series, trigonometric Mathieu series, asymptotic expansion, Mellin transform, polylogarithm, Hurwitz zeta function.
MSC2010 classification: 33E20, 41A60, 11M35.
1 Mathieu power series and the polylogarithm function
In [26], integral representations for the series
[TABLE]
where , and with , have been established, in terms of the Bessel function of the first kind. The asymptotic behavior of (1.1) as has not been investigated so far, except for special values of . For , this series becomes the generalized Mathieu series studied in [10, 15], with positive summands and growth order as . (Those papers also contain many further references on Mathieu series and their significance.) For any other number on the complex unit circle, the oscillating character of the summands causes cancellations that make the sum decay faster, of order . So far, this was only known for (alternating Mathieu series); see [18] for and [15, 30] for general For , the leading term is of order , too. As in [10, 15, 16, 30], we use a Mellin transform approach to expand (1.1) for . The Mellin transform of can be expressed by the polylogarithm function
[TABLE]
It is well known that the polylogarithm has an analytic continuation, e.g. by the Lindelöf integral111The name does not originate from Lindelöf integral, but rather from logarithmic integral (see [8]).
[TABLE]
From this representation and the definition (1.2), it is easy to see that is an entire function of for any See [5, 6] and p. 409 in [8] for details. In our main result, we need an estimate for for fixed and large . This will be established in Section 3, using the well-known representation of by the Hurwitz zeta function. Moreover, we will require the following complex extension of Abel’s convergence theorem (Stolz 1875); see p. 406 in [13].
Theorem 1.1**.**
Let be a complex power series with radius of convergence . If this series converges at a point of the unit circle, then
[TABLE]
where is any triangle in the unit disk with as one of its vertices.
This theorem implies consistency of (1.2) with the analytic continuation of the polylogarithm, i.e. that for and , which will be used below. (This actually holds for , see p. 401 in [13] for convergence of , but we do not need this fact.)
2 Main result
Theorem 2.1**.**
Let and with . As , we have the asymptotic expansion
[TABLE]
where is defined by (1.2) or (1.3).
Proof.
The Mellin transform of w.r.t. is (cf. [10, 15])
[TABLE]
For , the last equality is clear from (1.2). For with , we have
[TABLE]
for where the first equality is clear from analytic continuation and the second one from Theorem 1.1, with as in that theorem.
As mentioned above, is an entire function of . Thus, is a meromorphic function. For the desired asymptotic expansion (), the poles in the right half-plane are the relevant ones. They are those of the factor , located at for . We can now use the standard procedure of expanding a function whose Mellin transform is meromorphic (see, e.g., [7] or Section 4.1.1 in [17]). To justify Mellin inversion, we have to argue that is integrable. By Stirling’s formula (see p. 224 in [3]), we have
[TABLE]
for bounded and . This implies
[TABLE]
for bounded and Using this and Proposition 3.1 below, we see from (2.3) that decays exponentially along vertical lines,
[TABLE]
and is thus integrable for , as long as the vertical contour avoids the poles of . The Mellin inversion formula then says that
[TABLE]
The above locally uniform estimate for allows to push the contour to the right, and the residue theorem yields the expansion
[TABLE]
It easily follows from , that
[TABLE]
This implies the result. ∎
In Section 4 we will comment on the relation between Theorem 2.1 and some results from the literature on Mathieu series.
3 Estimates for the polylogarithm and the Hurwitz zeta function
The Hurwitz zeta function is defined by
[TABLE]
and can be extended to by analytic continuation. It is related to the polylogarithm by Jonquière’s formula [12]
[TABLE]
valid for and . To ensure integrability of the Mellin transform in the proof of Theorem 2.1, we need a growth estimate for , or equivalently for , for large resp. A related estimate for the polylogarithm occurs in Lemma 2 of [4].
Proposition 3.1**.**
Let and . Then there is such that
[TABLE]
as , uniformly w.r.t. Similarly, for and there is such that
[TABLE]
for
The proposition will be proved at the end of this section. For , (3.3) can be strengthened to a polynomial bound by §13.5 in [29], used in the Mathieu series context in [30]. This easily yields a polynomial bound instead of (3.4) under the additional assumption that (see the proof of Proposition 3.1 below). We also mention that, for and rather tight polynomial bounds for have been obtained [9, 14, 20, 28]. However, for non-real , it is not obvious how to adapt §13.5 in [29], which uses Hurwitz’ Fourier series for . We thus use a different approach to prove (3.3), similar to p. 271 in [19].
Lemma 3.2**.**
Let and . Then
[TABLE]
as , uniformly w.r.t.
Proof.
Define and . By the Euler–Maclaurin formula, we have
[TABLE]
for where . As usual, the s denote Bernoulli numbers resp. polynomials. Since
[TABLE]
where is the Pochhammer symbol, we obtain
[TABLE]
for . By analytic continuation, this equality extends to with . We now put
[TABLE]
and consider with the specified restriction . Note that, by definition of ,
[TABLE]
and so (3.6) holds in a sufficiently large half-plane. Since
[TABLE]
we have for any
[TABLE]
As is bounded, we have . We use this, (3.7), and the boundedness of in (3.6) to get
[TABLE]
We now prove Proposition 3.1, using a crude estimate for the sum in (3.5), which suffices for our purposes.
Proof of Proposition 3.1.
The sum in (3.5) can be estimated by
[TABLE]
The factor
[TABLE]
is of at most polynomial growth. Note that any polynomial factor does not affect the validity of (3.3), by possibly shrinking . Since we have
[TABLE]
This proves (3.3). It remains to prove (3.4). For , we obviously have . The Riemann zeta function is of at most polynomial growth in any right half-plane (see p. 95 in [24]), and so we may from now on assume and apply (3.2), with
[TABLE]
The factor in (3.2) is clearly , and
[TABLE]
By Stirling’s formula (see (2.4)), we have
[TABLE]
Therefore, the exponential estimates contributed by and in (3.2) cancel, and using (3.3) in (3.2) proves (3.4). ∎
4 Trigonometric Mathieu series
When lies on the unit circle, then the real resp. imaginary part of (1.1) become Mathieu cosine resp. sine series. These, and their partial sums, were considered in [21]. In particular, several inequalities for trignometric Mathieu series were proved there. For asymptotics in the large regime, the following result immediately follows from Theorem 2.1, by putting
Corollary 4.1**.**
Let and . As , we have the asymptotic expansions
[TABLE]
and
[TABLE]
In particular, setting in (4.1) yields the alternating Mathieu series treated in [15] and [30]. It can be easily checked that this special case of (4.1) is consistent with (2.7) in [15]. To see this, note that
[TABLE]
which follows from the basic relation
[TABLE]
between the Riemann zeta function and the Dirichlet eta function Moreover, the parameter from [15] is our , and there is a typo in (2.7) of [15]: the summation should start at . (Besides, the last sum at the bottom of p. 6213 in [15] should be multiplied by .)
More generally, if in (4.1) is a rational multiple of we can split the trigonometric Mathieu series into finitely many segments to which the following result from [30] can be applied.
Theorem 4.2**.**
For , , , , and we have
[TABLE]
To see that Theorem 4.2 gives an alternative proof of (4.1) for a rational multiple of , let with . Then, putting we can write the left hand side of (4.1) as
[TABLE]
where the asymptotic expansion follows from Theorem 4.2, with replaced by , , and resp. and
[TABLE]
was used in the last equality. Now (4.1) for easily follows from (4.3). Note that
[TABLE]
which we apply with . The latter (well-known) identity easily follows from (1.2) and (3.1) by analytic continuation. Clearly, the sine series (4.2) can be treated analogously.
We now comment on a different asymptotic regime for trigonometric Mathieu series, namely for fixed. For the series in (4.1) and (4.2), such an expansion can be obtained using again the Mellin transform approach. However, this would require an analysis of the singularity structure of the Dirichlet series , which is doable, but deferred to future work. First order asymptotics, however, follow from known results, even for the more general Mathieu-type sine series
[TABLE]
The corresponding series without the factor was introduced in [10]. The coefficients of the series (4.4) behave roughly like and the asymptotic behavior is markedly different for and .
Proposition 4.3**.**
Let and such that
[TABLE]
If , then we assume that For we have
[TABLE]
Proof.
As the coefficient sequence
[TABLE]
eventually decreases, the series is convergent for (see p. 3 in [31]). First assume . Since powers of logarithms are slowly varying, and asymptotic equivalence preserves slow variation, the sequence
[TABLE]
is slowly varying. Moreover, it is easy to see that the second derivative of (4.5) does not change sign for sufficiently large, and so is eventually convex or eventually concave. We can thus apply the corollary on p. 48 of Telyakovskiĭ [23] (with replaced by in case of concavity) to conclude that
[TABLE]
where we note that in [23] asymptotic equivalence is denoted by and not by . Since , the statement easily follows.
For , the sequence
[TABLE]
is regularly varying, and our assertion is an immediate consequence of Theorem 1 in [1]. Note that it is easy to see that is eventually decreasing, as assumed in that theorem. However, the required implication is true even without this condition; see [2] for this, and for further references. ∎
If is larger than , we can use a a result of Hartman and Wintner [11]. Unlike Proposition 4.3, the parameter now appears in the first asymptotic term, and there is no term. Essentially, the series now converges fast enough to justify exchanging summation and the asymptotic equivalence .
Proposition 4.4**.**
Let and such that Then we have
[TABLE]
Proof.
According to [11], for a decreasing sequence with , we have
[TABLE]
The sequence (4.5) decreases for large , say for . By considering the sequence it is very easy to see that “decreasing” can be replaced by “eventually decreasing” in the above statement. This implies the assertion. ∎
The series
[TABLE]
was considered in Corollary 7.1 of [10]. The corresponding sine series can be analyzed analogously to the preceding propositions. By Stirling’s formula,
[TABLE]
and so the coefficients are regularly varying. In particular, for we can proceed as in Proposition 4.4 to obtain
[TABLE]
The paper [22] contains several estimates that can be applied to Mathieu sine series. For instance, it was proved there (Corollary 2) that
[TABLE]
for coefficient sequences . This result can be readily applied to our Mathieu sine series, with obvious constraints on the parameters to ensure monotonicity of the coefficient sequence. Moreover, Ul’yanov [27] studied convergence in the -quasinorm for , for both sine and cosine series, which yields the following result.
Proposition 4.5**.**
Let and such that If , then we assume that We write for the -th partial sum of the series (4.4). Then
[TABLE]
The same result holds for the corresponding cosine series.
Proof.
The coefficient sequence (4.5) eventually decreases. Therefore, it is of bounded variation, which by definition means that Thus, both assertions are immediate from [27]. ∎
Finally, we mention that -convergence of the Mathieu-type cosine series
[TABLE]
follows from a result in [25].
Proposition 4.6**.**
Let and such that either
[TABLE]
or
[TABLE]
Then the series (4.6) converges in .
Proof.
As noted above, the coefficient sequence (4.5) of the series is regularly varying. According to [25], it then suffices to verify that . But this easily follows from our assumption on the parameters. ∎
As for the asymptotic behavior of the cosine series for , we can use Theorem 2.1 of [2] (going back to Zygmund) in the case For outside of this interval, the other results for sine series we used in Propositions 4.3 and 4.4 seem not to be available for cosine series so far.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Aljančić, R. Bojanić, and M. Tomić , Sur le comportement asymptotique au voisinage de zéro des séries trigonométriques de sinus à coefficients monotones , Acad. Serbe Sci. Publ. Inst. Math., 10 (1956), pp. 101–120.
- 2[2] R. Bojanić and E. Seneta , The cosine series and regular variation in the Karamata and Zygmund senses , Publ. Inst. Math. (Beograd) (N.S.), 104 (2018), pp. 53–67.
- 3[3] E. T. Copson , An introduction to the theory of functions of a complex variable , Clarendon Press, Oxford, 1935.
- 4[4] M. Drmota and S. Gerhold , Disproof of a conjecture by Rademacher on partial fractions , Proc. Amer. Math. Soc. Ser. B, 1 (2014), pp. 121–134.
- 5[5] P. Flajolet , Singularity analysis and asymptotics of Bernoulli sums , Theoret. Comput. Sci., 215 (1999), pp. 371–381.
- 6[6] P. Flajolet, S. Gerhold, and B. Salvy , Lindelöf representations and (non-)holonomic sequences , Electronic Journal of Combinatorics, 17 (2010).
- 7[7] P. Flajolet, X. Gourdon, and P. Dumas , Mellin transforms and asymptotics: harmonic sums , Theoret. Comput. Sci., 144 (1995), pp. 3–58. Special volume on mathematical analysis of algorithms.
- 8[8] P. Flajolet and R. Sedgewick , Analytic Combinatorics , Cambridge University Press, 2009.
