Solving Double Sum with _2F_1 Hypergeometric Function

Orbb
Messages
81
Reaction score
0
Hello Physicsforum,

I am trying to compute the following double sum:

\sum_{j\in\mathbb{N}_0/2}\sum_{m=-j}^j\frac{x^{j+m}}{(j+m)!(j-m)!}e^{-\kappa^2j(j+1)/s}

where x, kappa and s are parameters. It is possible with e.g. Mathemtatica to carry out the sum over m explicitly, which yields

\sum_{j\in\mathbb{N}_0/2}(j!)^{-2}e^{-\kappa^2j(j+1)/s}[_2F_1(1,-j,j+1,-x^{-1})+_2F_1(1,-j,j+1,-x)-1]

where _2F_1 is the ordinary hypergeometric function. This is however a fairly horrendous expression to sum over. It would be intereseting enough to understand the asymptotic behaviour of the final result for large and for small x as a function of s and kappa.

Does anybody have ideas/tricks in mind how to deal with this sum and maybe approximate it?

Any suggestions would be much appreciated!
 
Mathematics news on Phys.org
Anyone an idea? Sorry for bumping this.
 
Part of the problem is that this has nothing to do with "Linear and Abstract Algebra". I am moving it to "general math".
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
8
Views
2K
Replies
2
Views
2K
Replies
4
Views
2K
Replies
3
Views
2K
Replies
2
Views
3K
Replies
1
Views
1K
Replies
1
Views
1K
Back
Top