I have been trying to get a lower bound on the following alternating sum but without much success:
$$ \sum_{j=1}^T (-1)^j e^{-j^2} j^k . $$ For small values of $k$, this is easy because the first term dominates the remaining terms.
For an upper bound, I can get an estimate using the gamma function by ignoring the sign change. (Basically this reduces to estimating the moments of some Gaussian distribution.)
In general, what I want to estimate are summations of the form
$$ 2^{-n} \sum_{j>0} \binom{n}{n/2 + jM} (-1)^j (jM)^k . $$
(It may be useful to think of $M = C\sqrt{n}$ and $k = 1$ at first, but my goal is to understand the sum for other values of $M$ and $k$ in general.)
Is there any general method for estimating this kind of alternating sums? Thanks.