Algoritmo de Fasennmyer Funciones Especiales y C alculo Simb olico

Presentado por: Walter Andr es Ortiz Vargas

Profesor: Miguel Pi nar

Universidad de Granada Master Ocial en FisyMat Facultad de Ciencias Granada Octubre 28 de 2013

1. Prueba las identidades 2.2 y 2.3 del texto de Koepf ejercicio secci on 4.1 Usando el algoritmo de Fasenmyer.
n

2.2
k=0

(1)k

n k

=0
n

Demostraci on. Sea f (n) =

k=0

(1)k

n k

=
k=

(1)k
n k

n . Encontrando la relak , en efecto se tiene:

ci on de recurrencia de f (n) a partir de F (n, k ) = (1)k

a(n)F (n, k ) + b(n)F (n + 1, k ) + c(n)F (n, k + 1) + d(n)F (n + 1, k + 1) = 0 dividiendo la ecuaci on anterior por F (n, k ), se tiene que a(n)F (n, k ) + b(n) F (n + 1, k ) F (n, k + 1) F (n + 1, k + 1) + c(n) + d(n) =0 F (n, k ) F (n, k ) F (n, k )

Y de hecho se tiene que

F (n + 1 , k ) n+1 F (n, k + 1) nk = y tambi en = F (n, k ) nk+1 F (n, k ) k+1 las cuales son funciones racionales que dependen de n y k . Encontrando los valores de los coecientes a(n), b(n), c(n), d(n) usado como ayuda el software maxima, tenemos que: a(n) = 1, b(n) = 1, c(n) = 0, d(n) = 1, luego F (n, k ) F (n + 1, k ) + F (n + 1, k + 1) = 0

F (n, k )
k= k=

F (n + 1 , k ) +
k=

F (n + 1, k + 1) = 0

f (n) f (n + 1) + f (n + 1) = 0 f (n) = 0 Por tanto se muestra que el algoritmo de Fasenmyer satisface la identidad.
n

2.3
k=0

n k

(2n)! . (n!)2
n

Demostraci on. Sea f (n) =

k=0

n k

=
k= n 2 , en k

n k

. Encontrando la relaci on de

recurrencia de f (n) a partir de F (n, k ) =

efecto se tiene:

a(n)F (n, k ) + b(n)F (n, k + 1) + c(n)F (n, k + 2) + d(n)F (n + 1, k ) + e(n)F (n + 1, k + 1) +g (n)F (n + 1, k + 2) + h(n)F (n + 2, k ) + i(n)f (n + 2, k + 1) + j (n)F (n + 2, k + 2) = 0

en la ecuaci on anterior se toman m as coecientes dado que si se toman solo 4 la soluci on del sistema es trivial.

Diviendo la ecuaci on la anterior por F (n, k ), se tiene

F (n, k + 1) F (n, k + 2) F (n + 1, k ) F (n + 1, k + 1) + c(n) + d(n) + e(n) F (n, k ) F (n, k ) F (n, k ) F (n, k ) F (n + 1, k + 2) F (n + 2 , k ) f (n + 2, k + 1) F (n + 2, k + 2) +g (n) + h(n) + i(n) + j (n) =0 F (n, k ) F (n, k ) F (n, k ) F (n, k ) a(n) + b(n)

Y de hecho se tiene que

(n + 1)2 F (n + 1, k ) = y tambi en F (n, k ) (n k + 1)2

F (n, k + 1) (n k )2 = las cuales son funciones racionales que dependen de n y k . F (n, k ) (k + 1)2 Encontrando los valores de los coecientes a(n), b(n), c(n), d(n), e(n), g (n), h(n), i(n), j (n) usado como ayuda el software maxima, tenemos que: (n + 1) n+1 n+1 , b(n) = 2 , c(n) = , d(n) = 0, a(n) = 2n + 3 2n + 3 2n + 3 n+2 e(n) = 1,g (n) = 1, h(n) = 0, i(n) = 0, j (n) = luego 2n + 3
n+1 n+1 F (n, k + 1) F (n, k + 2) + F (n + 1, k + 1) 2n + 3 2n + 3 n+2 F (n + 2, k + 2) = 0 + F (n + 1, k + 2) 2n + 3 n+1 n+1 n+1 F (n, k ) + 2 F (n, k + 1) F (n, k + 2) 2n + 3 2n + 3 2n + 3 n+1 2n + 3 F (n, k ) + 2
k= k= k=

+
k=

F (n + 1, k + 1) + n+1 2n + 3 f (n)+2 n+2 2n + 3 n+1 2n + 3

F (n + 1, k + 2) f (n) n+1 2n + 3

n+2 2n + 3

k=

k=

F (n + 2, k + 2) = 0 n+2 2n + 3 f (n +2) = 0

f (n)+2f (n +1)

2f (n + 1)

f (n + 2) = 0.

De lo anterior se obtiene que f (n + 2) = 2f (n + 1) n + 2 n f (n) = 2

2n + 3 , y haciendo n+2

2n 1 f (n 1), y as n 2n 1 2n 3 (2n)! n 2 f (n 2) . . . f (1) = = 2n . f (n) = 2 2 n n1 (n!) Por tanto se cumple la identidad, con la relaci on de recurrencia encontrada.

2. Encontrar la relaci on de recurrencia para los polinomios del ejercicio 4.3

n

Demostraci on.
n

a. Pn (x) =
k=0

n k

n 1 k 1x 2
k

1x 2

Sea Pn =
k=0

n k

n 1 k

=
k=

n k

n 1 k
n k

1x 2
n1 k

. Encon1x 2
k

trando la relaci on de recurrencia de Pn a partir de F (n, k ) = 2

a(n)F (n, k ) + b(n)F (n, k + 1) + c(n)F (n, k + 2) + d(n)F (n + 1, k ) + e(n)F (n + 1, k + 1) +g (n)F (n + 1, k + 2) + h(n)F (n + 2, k ) + i(n)f (n + 2, k + 1) + j (n)F (n + 2, k + 2) = 0

Encontrando los coecientes tenemos que

n+1 n+2 F (n, k + 1) 2n + 3 n+2 (x2 + x 1)F (n + 1, k + 1) n+1 n+2 F (n, k + 2) + x 2n + 3 n+2 2n + 3 F (n, k + 1) + n+2 Pn (x)+

(x + 1)F (n + 1, k ) + F (n + 2, k + 1) + x

xF (n + 2, k + 2) = 0 2n + 3 2n + 3 n+1 n+1 (x2 +x1) Pn+1 (x)(2x1) Pn+1 (x)+x Pn (x)+ n+2 n+2 n+2 n+2 xPn+2 (x) + Pn+2 (x) = 0 2n + 3 n+1 Pn+1 (x)(x2 + x 1 2x + 1) + (x + 1)Pn (x) + Pn+2 (x + 1) = 0 n+2 n+2 Haciendo n + 1 n n 2n + 1 Pn (x)(x2 + x 1 2x + 1) + (x + 1)Pn1 (x) + Pn+1 (x + 1) = 0 n+1 n+1 x(2n + 1)Pn (x) + nPn1 (x) + (n + 1)Pn+1 (x) = 0

Y as la formula de recurrencia esta dada por (n + 1)Pn+1 (x) = x(2n + 1)Pn (x) nPn1 (x), la cual determina los polinimos de Legendre de donde P0 (x) = 1, P1 (x) = x.
n

b. Pn (x) =
k=0

n k
n

n 1 k n k
2

1x 2
nk

1 Sea Pn = n 2

(x 1)

k=0

1 (x + 1) = n 2
k

k=

n k

(x 1)nk (x + 1)k . Encon1 2n

n 2 (x 1)nk (x +1)k , k

trando la relaci on de recurrencia de Pn a partir de F (n, k ) =

a(n)F (n, k ) + b(n)F (n, k + 1) + c(n)F (n, k + 2) + d(n)F (n + 1, k ) + e(n)F (n, k + 2) +g (n)F (n + 1, k + 2) + h(n)F (n + 1, k + 3) + i(n)f (n, k + 3) + j (n)F (n + 2, k ) +k (n)F (n + 2, k + 2) + l(n)F (n + 2, k + 1) + mF (n + 2, k + 3) = 0

Encontrando los coecientes tenemos que n+1 2n + 3 n+1 Pn ( x ) + Pn (x) (x + 1)P(n+1) (x) 4n + 8 4n + 8 2n + 4 2n + 3 n+1 Pn (x) (2x3 x2 1) Pn+1 (x) (x2 + 2x + 1) 4n + 8 2n + 4 2n + 3 n + 1 (x2 x)Pn+1 (x) + (x3 2x2 + x)Pn (x) + Pn+2 (x) + xPn+2 (x) = 0 2n + 4 4n + 8 2n + 3 n+1 2x Pn+1 (x) + Pn+2 (x) = 0 4Pn (x) 4n + 8 2n + 4 Haciendo n + 1 n n 2n + 1 4 Pn1 (x) 2x Pn (x) + Pn+1 (x) = 0 4n + 4 2n + 2 3

De hecho la f ormula de recurrencia (n + 1)Pn+1 (x) + nPn1 (x) x(2n + 1)Pn (x) = 0. la cual determina los polinimos de Legendre de donde P0 (x) = 1, P1 (x) = x.

3. Encontrar la f ormula de recurrencia para los polinomimos de Laguerre generalizados,

n

L n (x)

:=
k=0

(1)k n + k x k! nk

Demostraci on. Para la relaci on de recuerrencia, encontrando los coecientes de la ecuaci on:

a(n)F (n, k ) + b(n)F (n, k + 1) + c(n)F (n, k + 2) + d(n)F (n + 1, k ) + e(n)F (n + 1, k + 1) +g (n)F (n + 1, k + 2) + h(n)F (n + 2, k ) + i(n)F (n + 2, k + 1) + j (n)F (n + 2, k + 2) = 0 x2 (n + + 1) + 2n2 + (3 + 5)n + 2 + 4 + 3 F (n, k + x2 x2 (2n + + 3) + 4n2 + (4 + 12)n + 2 + 6 + 9 2)+F (n+1, k )+xF (n+1, k +1) F (n + x2 n+2 x2 (n + 2) + 2n2 + ( + 7)n + 2 + 6 1, k + 2) + F (n + 2, k + 1) + F (n + 2, k + 2) = 0 x x2 n++1 x2 (n + + 1) + 2n2 + (3 + 5)n + 2 + 4 + 3 L ( x ) + Ln (x) + L n n+1 (x) + x x2 n+2 x2 (2n + + 3) + 4n2 + (4 + 12)n + 2 + 6 + 9 Ln+1 (x) + Ln+2 (x) + xL ( x ) n+1 2 x x x2 (n + 2) + 2n2 + ( + 7)n + 2 + 6 Ln+2 (x) = 0 x2 2 2 (n+1+)(x2 +(2n+3)+)L n (x)+(x (1 + x) ( + (2n + 3))(x + (2n + 3) + )) Ln+1 (x)+ 2 (n + 2)(x + x + (2n + 3) + )Ln+2 (x) = 0 haciendo n + 1 n 2 2 (n+)(x2 +(2n+1)+)L n1 (x)+(x (1 + x) ( + (2n + 1))(x + (2n + 1) + )) Ln (x)+ (n + 1)(x + x2 + (2n + 1) + )L n+1 (x) = 0 Luego reduciendo t erminos, se obtiene la relaci on de recurrencia. (n + 1)L ( x ) + ( x (2 n + 1)) L ( x ) + (n + )L L n+1 n n1 (x) = 0, as 0 (x) = 1, L1 (x) = 1 + x. se tiene, n++1 x F (n, k +1)+