FAQFAQ   SearchSearch   MemberlistMemberlist   UsergroupsUsergroups   RegisterRegister 
 ProfileProfile   PreferencesPreferences   Log in to check your private messagesLog in to check your private messages   Log inLog in 
Forum index » Science and Technology » Math » Symbolic
hypergeometric GF
Post new topic   Reply to topic Page 1 of 1 [7 Posts] View previous topic :: View next topic
Author Message
Guest






PostPosted: Thu Jun 09, 2005 3:06 pm    Post subject: hypergeometric GF Reply with quote

What is the generating function satisfying

a(1)=1/(2*m-1);
a(n+1) = -(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n)) * a(n), n>=1

m,n positive integers?
Back to top
G. A. Edgar
science forum Guru


Joined: 29 Apr 2005
Posts: 470

PostPosted: Thu Jun 09, 2005 5:20 pm    Post subject: Re: hypergeometric GF Reply with quote

In article <1118336815.019647.41220@g49g2000cwa.googlegroups.com>,
<carlos@colorado.edu> wrote:

Quote:
What is the generating function satisfying

a(1)=1/(2*m-1);
a(n+1) = -(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n)) * a(n), n>=1

m,n positive integers?


Maple says,

Quote:
E1 := a(n+1) = -(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n)) * a(n);
(2 m - 2 + n) n a(n)

E1 := a(n + 1) = - -------------------------
2 (2 m - 1 + 2 n) (n + 1)

Quote:
rsolve({E1,a(1)=1/(2*m+1)},a(n));
(-n - m) (1/2) n

8 4 Pi (2 m - 1) GAMMA(2 m - 2 + n) (-1)
- ------------------------------------------------------
/ 1\
GAMMA(m) GAMMA|n + m - -| n (2 m + 1)
\ 2/

Quote:
simplify(%);
(n + 1) (-n - m) (1/2)

8 (-1) 4 Pi (2 m - 1) GAMMA(2 m - 2 + n)
------------------------------------------------------------
/ 1\
GAMMA(m) GAMMA|n + m - -| n (2 m + 1)
\ 2/

--
G. A. Edgar http://www.math.ohio-state.edu/~edgar/
Back to top
Daniel Lichtblau
science forum beginner


Joined: 12 May 2005
Posts: 48

PostPosted: Thu Jun 09, 2005 6:05 pm    Post subject: Re: hypergeometric GF Reply with quote

carlos@colorado.edu wrote:
Quote:
What is the generating function satisfying

a(1)=1/(2*m-1);
a(n+1) = -(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n)) * a(n), n>=1

m,n positive integers?

In[65]:= InputForm[a[n] /. First[RSolve[{a[1]==1/(2*m-1),
a[n+1] == -(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n)) * a[n]}, a[n], n]]]

Out[65]//InputForm=
-(((-1)^n*4^(1 - n)*Gamma[1/2 + m]*Gamma[-2 + 2*m + n])/
((-1 + 2*m)*n*Gamma[-1 + 2*m]*Gamma[-1/2 + m + n]))


Daniel Lichtblau
Wolfram Research
Back to top
Guest






PostPosted: Fri Jun 10, 2005 5:21 am    Post subject: Re: hypergeometric GF Reply with quote

That is just a formula for the coefficients but not the generating
function. In Mathematica I tried

cn=-(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n));
{{g}}=GeneratingFunction[{a[n+1]==cn*a[n],a[1]==1/(2*m-1)},a[n],n,z];

but the answer is wrong. For small numeric instances of m, however,
the answers are easily found:

m=1 g=4*ArcSinh[Sqrt[z]/2]^2
m=2 g=(-240*(Sqrt[z*(4 + z)] - (4 + z)*ArcSinh[Sqrt[z]/2]) -
Sqrt[z^5*(4 + z)]*HypergeometricPFQ[{2, 2}, {7/2},
-z/4])/(60*Sqrt[z*(4 + z)])

What I would like to get is the general expression for arbitrary
integer m>0.
Thanks.
Back to top
Daniel Lichtblau
science forum beginner


Joined: 12 May 2005
Posts: 48

PostPosted: Fri Jun 10, 2005 5:45 am    Post subject: Re: hypergeometric GF Reply with quote

car...@colorado.edu wrote:
Quote:
That is just a formula for the coefficients but not the generating
function. In Mathematica I tried

cn=-(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n));
{{g}}=GeneratingFunction[{a[n+1]==cn*a[n],a[1]==1/(2*m-1)},a[n],n,z];

but the answer is wrong. For small numeric instances of m, however,
the answers are easily found:

m=1 g=4*ArcSinh[Sqrt[z]/2]^2
m=2 g=(-240*(Sqrt[z*(4 + z)] - (4 + z)*ArcSinh[Sqrt[z]/2]) -
Sqrt[z^5*(4 + z)]*HypergeometricPFQ[{2, 2}, {7/2},
-z/4])/(60*Sqrt[z*(4 + z)])

What I would like to get is the general expression for arbitrary
integer m>0.
Thanks.

It's a beginning from which the rest can be attained. I'll work with
the form I showed. I assume the one given by G. Edgar is equivalent.
We'll use it to define a function of m and n.

InputForm[c[m_,n_] = a[n] /. First[RSolve[{a[1]==1/(2*m-1),
a[n+1] == -(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n))*a[n]}, a[n], n]]]

Now we'll use a pedestrian recursive definition of the same function
(on nonnegative integers).

b[m_,1] = 1/(2*m-1);
b[m_,n_] := b[m,n] =
-(2*m-2+(n-1))*(n-1)/(2*(2*m-1+2*(n-1))*n)*b[m,n-1]

A few numeric examples should demonstrate that these are in agreement.

In[11]:= b[5,7] - c[5,7]
Out[11]= 0

In[12]:= b[3,21] - c[3,21]
Out[12]= 0

In[16]:= InputForm[val = b[1/3,21] - c[1/3,21]]
Out[16]//InputForm=
5/4496856363183247 +
(Gamma[5/6]*Gamma[59/3])/(7696581394432*Gamma[-1/3]*
Gamma[125/6])

In[17]:= FunctionExpand[val]
Out[17]= 0

So I gather that what you wanted was not the closed form of a[m,n], but
rather a sum of said form over powers of x^n.

In[21]:= InputForm[Sum[c[m,n]*x^n, {n,1,Infinity}]]
Out[21]//InputForm=
(x*HypergeometricPFQ[{1, 1, -1 + 2*m}, {2, 1/2 + m}, -x/4])/(-1 + 2*m)


Daniel Lichtblau
Wolfram Research
Back to top
Paul Abbott
science forum addict


Joined: 19 May 2005
Posts: 99

PostPosted: Fri Jun 10, 2005 5:50 am    Post subject: Re: hypergeometric GF Reply with quote

In article <1118388086.398435.13560@g43g2000cwa.googlegroups.com>,
carlos@colorado.edu wrote:

Quote:
That is just a formula for the coefficients but not the generating
function. In Mathematica I tried

cn=-(2*m-2+n)*n/(2*(2*m-1+2*n)*(1+n));
{{g}}=GeneratingFunction[{a[n+1]==cn*a[n],a[1]==1/(2*m-1)},a[n],n,z];

but the answer is wrong. For small numeric instances of m, however,
the answers are easily found:

m=1 g=4*ArcSinh[Sqrt[z]/2]^2
m=2 g=(-240*(Sqrt[z*(4 + z)] - (4 + z)*ArcSinh[Sqrt[z]/2]) -
Sqrt[z^5*(4 + z)]*HypergeometricPFQ[{2, 2}, {7/2},
-z/4])/(60*Sqrt[z*(4 + z)])

What I would like to get is the general expression for arbitrary
integer m>0.

RSolve[{a[1] == 1/(2 m - 1),
a[n] == -(n-1) (2 m + n - 3) a[n-1]/(2 (2 (n-1)+2 m-1) n)}, a, n]

a[n_] = a[n] /. First[%]

gf[m_][z_] = Sum[a[n] z^n, {n, 1, Infinity}]

The answer is

z HypergeometricPFQ[{1, 1, 2m - 1}, {2, m + 1/2}, -z/4]/(2 m - 1)

and this yields you give above.

Cheers,
Paul

--
Paul Abbott Phone: +61 8 6488 2734
School of Physics, M013 Fax: +61 8 6488 1014
The University of Western Australia (CRICOS Provider No 00126G)
AUSTRALIA http://physics.uwa.edu.au/~paul
http://InternationalMathematicaSymposium.org/IMS2005/
Back to top
Guest






PostPosted: Fri Jun 10, 2005 2:09 pm    Post subject: Re: hypergeometric GF Reply with quote

That is perfect! I should have thought of using Sum rather
than GeneratingFunction. Thanks.
Back to top
Google

Back to top
Display posts from previous:   
Post new topic   Reply to topic Page 1 of 1 [7 Posts] View previous topic :: View next topic
The time now is Wed Jan 07, 2009 9:21 pm | All times are GMT
Forum index » Science and Technology » Math » Symbolic
Jump to:  

Similar Topics
Topic Author Forum Replies Last Post
No new posts Hypergeometric Distribution Eric Plante Probability 1 Wed Jun 21, 2006 2:13 am
No new posts Binomial and hypergeometric distribut... Eli Luong Math 3 Thu Jun 15, 2006 2:49 am
No new posts Gauss hypergeometric 2F1 / contigous ... Axel Vogt Math 0 Sun May 21, 2006 5:10 pm
No new posts A hypergeometric identity Atul Dixit Math 2 Fri Feb 17, 2006 12:59 am
No new posts hypergeometric functions in Gradshteyn Andy Math 1 Tue Jan 03, 2006 5:10 pm

Loans | Advertising | Mortgages | Mortgage Loans | Credit Report
Copyright © 2004-2005 DeniX Solutions SRL
Other DeniX Solutions sites: Electronics forum |  Medicine forum |  Unix/Linux blog |  Unix/Linux documentation |  Unix/Linux forums


Powered by phpBB © 2001, 2005 phpBB Group
[ Time: 0.4132s ][ Queries: 16 (0.3197s) ][ GZIP on - Debug on ]