ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX AND VARIANTS. Emrah Kılıç and Helmut Prodinger
|
|
- Jeffery Jackson
- 6 years ago
- Views:
Transcription
1 PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 95 (09) (04), DOI: 098/PIM40967K ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX AND VARIANTS Emrah Kılıç and Helmut Prodinger Communicated by Gradimir Milovanović Abstract Four generalizations of the Filbert matrix are considered, with additional asymmetric parameter settings Explicit formulæ are derived for the LU-decompositions, their inverses, and the inverse matrix The approach is mainly to use the q-analysis and to leave the justification of the necessary identities to the q-version of Zeilberger s algorithm for some of them, and for the rest of the necessary identities, to guess the relevant quantities and proving them later by induction Introduction The Filbert matrix F N = (ȟij) N i,j= is defined by ȟij = F i+j as an analogue of the Hilbert matrix where F n is the nth Fibonacci number It has been defined and studied by Richardson [0] The Filbert matrix has been extended by Berg [] and Ismail [] The present authors have generalized and extended this concept in a series of papers [3, 4, 5, 6, 7, 9] to matrices with entries F λ(i+j)+r F λ(i+j+)+r F λ(i+j+k )+r and L λ(i+j)+r L λ(i+j+k )+r Here, λ, k and r are integer parameters and L n are Lucas numbers In another direction [5], the matrices with entries g ij = F λ(i+j)+r F λ(i+j)+s and v ij = L λ(i+j)+r L λ(i+j)+s were introduced; here s, r and λ are integer parameters such that s r, and r, s and λ This was the first nontrivial instance where the numerator of the entries is not equal to one 00 Mathematics Subject Classification: B39, 05A30, 5A3 The second author was supported by an incentive grant of the NRF South Africa 67
2 68 KILIÇ AND PRODINGER All these extensions were driven by the search for nice explicit results: explicit formulæ for the LU-decomposition, their inverses, and the Cholesky factorization Here, we go one step further, by allowing an asymmetric growth of indices We, however, confine ourselves to k = ; for this instance, the inverse matrix also enjoys nice closed form entries, which is no longer true for k To be more specific, we introduce four generalizations of the Filbert matrix F, and define the matrices T, M, H and W with entries t ij = F λi+µj+r, m ij = F λi+µj+r F λi+µj+s, h ij = L λi+µj+r and w ij = L λi+µj+r L λi+µj+s, respectively, where s, r, λ and µ are integer parameters such that s r, and r, s and λ, µ Of course, because of these asymmetric entries, we cannot get a Cholesky decomposition anymore Now we discuss our settings Let {U n } and {V n } be generalized Fibonacci and Lucas sequences, respectively, whose Binet forms are U n = αn β n α β qn = αn q and V n = α n + β n = α n ( + q n ) with q = β/α = α, so that α = i/ q ( ( ) ( )) When α = + 5 or equivalently q = 5 / + 5, the sequence {Un } is reduced to the Fibonacci sequence {F n } and the sequence {V n } is reduced to the Lucas sequence {L n } When α = + ( or equivalently q = ( ) / ( + )), the sequence {U n } is reduced to the Pell sequence {P n } and the sequence {V n } is reduced to the Pell-Lucas sequence {Q n } We will mostly deal with the q-forms; translating the results back to the Fibonacci and Lucas world, say, is easy: We only have to systematically replace q n by q α F n n and + q n by α n L n and replace what is eventually left by its numerical values Throughout this paper we will use the notation of the q-pochhammer symbol (x; q) n = ( x)( xq) ( xq n ) We rewrite the entries of the matrices T, M, H and W in the q-form: t ij = i r λi µj q (λi+µj+r ) q q λi+µj+r, m ij = i r s q s r q λi+µj+r q λi+µj+s, h ij = i λi µj r q (λi+µj+r) + q λi+µj+r, w ij = i r s q s r + q λi+µj+r + q λi+µj+s In each of the four instances, we consider the LU-decomposition of the matrix M = LU We are able to get explicit formulæ for L, U, L, U and M
3 ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX 69 As it was noted in the above cited earlier papers, the sizes of the matrices do not really matter, and they can be thought of as infinite matrices and we may restrict them whenever necessary to the first N rows resp columns and write T N etc This is not true for the inverse matrices; here, the entries depend on N All our identities hold for general q, and the results about Fibonacci and Lucas numbers come out as corollaries for the special choice of q, as explained The important part is to find the explicit forms This was done by experiments with a computer algebra system and spotting patterns This becomes increasingly complicated when more and more new parameters are introduced, as the guessing only works for fixed choices of the parameters, and one needs to vary them as well Once one knows how the entries look like, proofs are by reducing sums to single terms For this, the q-zeilberger algorithm is a handy tool However for the matrices M and W, the present versions of the q-zeilberger algorithm do not work, and we have to simulate it by noticing that the relevant sums are Gospersummable To do this, some more guessing (with an additional parameter) is required Consequently, since all these proofs are routine and somewhat tedious, we only present two typical examples It would be a good student project to work them all out in full detail As an illustration, we always write out the Fibonacci/Lucas cases for λ, µ {, 3} and r =, s = The matrix T We obtain the LU-decomposition T = L U: Theorem For d n we have L n,d = i λ(d n) q λ(d n) (q λ ; q λ ) n (q r+µ+λd ; q µ ) d (q λ ; q λ ) n d (q λ ; q λ ) d (q r+µ+λn ; q µ ) d Fibonacci Corollary for λ = 3, µ = and r = : Corollary For d n, L n,d = ( n ( n d )( d ) F 3t F t+3d+ )( d )( d ) F 3t F 3t F t+3d+ Theorem For d n we have U d,n = i r λd µn q µ n d +rd r + d (q λ ; q λ ) d ( q) (q r+µn+λ ; q λ ) d (q r+µ+λd ; q λ ) d (q µ ; q µ ) n (q µ ; q µ ) n d Fibonacci Corollary for λ = 3, µ = and r = :
4 70 KILIÇ AND PRODINGER Corollary For d n ( d )( n ) ( ) (d )+d F 3t F t U d,n = ( d )( n d )( d ) F 3t+n+ F t F t+3d+ The inverses of the matrices L and U: Theorem 3 For d n we have L n,d = ( )n d i λ(d n) q λ (n d) (q λ ; q λ ) n (q r+µ+λd ; q µ ) n (q λ ; q λ ) n d (q λ ; q λ ) d (q r+µ+λn ; q µ ) n Fibonacci Corollary for λ = 3, µ = and r = : ( )(n d+ L n,d = ( n d Corollary 3 For d n ) ( n )( n ) F 3t F t+3j+ )( d )( n ) F 3t F 3t F t+3n+ Theorem 4 For d n we have U d,n = q λ n +µ d µnd rn+ r + ( ) n+d i r +λn+µd (q r+λ+µd ; q λ ) n (q r+µ+λn ; q µ ) n ( q)(q λ ; q λ ) n (q µ ; q µ ) n d (q µ ; q µ ) d Its Fibonacci Corollary for λ = 3, µ = and r = : Corollary 4 For d n U d,n = ( )(n )+d ( n )( n ) F 3t+d+ F t+3n+ ( n )( n d )( d ) F 3t F t F t As a consequence, we can compute the determinant of T N, since it is simply evaluated as U, U N,N : Theorem 5 dett N = i (µ λ)(n+ )+N( r) q N (µ+r) N+ 6 µn(n )+ λn(n+)(n+) ( q) N N d= Fibonacci Corollary for λ = 3, µ = and r = : Corollary 5 dett N = ( ) (N+ 3 )+N N F 3d+N+ d= (q λ ; q λ ) d (q µ ; q µ ) d (q r+λ+µd ; q λ ) d (q r+µ+λd ; q µ ) d d F 3t F t F 3t+N+ F t+3d+
5 ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX 7 Now we compute the inverse of the matrix T It depends on the dimension, so we compute (T N ) Theorem 6 For n, d N: (T N ) n,d = ( )n d i r +µn+λd q µ n +λ d µnn λnd Ns+ r + (q r+µn+λ ; q λ ) N (q r+λd+µ ; q µ ) N (q λ ; q λ ) N d (q λ ; q λ ) d (q µ ; q µ ) N n (q µ ; q µ ) n q r+µn+λd q Remark The inverse matrix and the other inverse matrices presented in this paper were not computed using the inverses of L and U, but rather obtained directly by our usual guessing strategy While the first alternative would mean that we would have to simplify a sum, the second approach stays within our chosen method Fibonacci Corollary for λ = 3, µ = and r = : Corollary 6 For n, d N: ( N )( N ) ( )(n+ )+(N+)(n+)+d F t+3d+ F 3t+n+ (T N ) n,d = ( N n )( n )( N d )( d ) F n+3d+ F t F t F 3t F 3t 3 The matrix M We obtain the LU-decomposition M = L U: Theorem 3 For d n we have L n,d = (q λ ; q λ ) n (q s+λd+µ ; q µ ) d q d(d+) (q λ ; q λ ) d (q λ ; q λ ) n d (q s+λn+µ ; q µ d(d+) ) d q +r+s(d ) Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 3 For d n, ( d )( d ) F t F 3t+d L n,d = ( d )( n d )( d ) F t F t F 3t+n Theorem 3 For d n we have +λ(n d)+r+s(d ) F 5d(d+)/+n 3d+ F 5d(d+)/ d+ U d,n = i r s d(d ) q r+s +ds (q λ ; q λ ) d (q µ ; q µ ) n (q µ ; q µ ) n d (q s+λ+nµ ; q λ ) d (q s+µ+λd ; q µ ) d (d+)d q d(d ) q s+r+ds +µ(n d)+r+s(d ) Fibonacci Corollary for λ =, µ = 3, r = and s = : ( q r s )
6 7 KILIÇ AND PRODINGER Corollary 3 For d n U d,n = ( ) d+ ( ) (d ) ( n d The inverses of the matrices L and U: Theorem 33 For d n we have L n,d = ( )n d q λ n(n ) +λ d(d+) λnd ( d )( n F t F 3t ) )( d )( d ) F 3t F 3t+d F t+3n F 5d(d+)/+3n 4d+ F 5d(d )/ d+3 q λd+ λ+µ n + λ µ n+r+s(n ) λ+µ q λn+ n + λ µ n+r+s(n ) (q λ ; q λ ) n (q s+λd+µ ; q µ ) n (q λ ; q λ ) d (q λ ; q λ ) n d (q s+λn+µ ; q µ ) n Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 33 For d n ( n )( n ) ( )n d F t F 3t+d L n,d = ( d )( n d )( n ) F t F t F 3t+n Theorem 34 For d n we have F 5n(n+)/ 4n d+3 F 5n(n )/ n+3 U d,n = is r ( ) n d n(n ) λ q +µ d(d+) µnd+ r+s ns ( q r s ) (qλ+µd+s ; q λ ) n (q µ+λn+s ; q µ ) n q n(n ) (q λ ; q λ ) n (q µ ; q µ ) n d (q µ ; q µ n(n+) ) d q +r+s(n ) Its Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 34 For d n ( n )( n ) F t+3d F 3t+n U d,n = ( )(d+ )+nd ( d )( n )( n d ) F 3t F t F 3t +µ(n d)+r+s(n ) F 5n(n )/+n 3d+3 F 5n(n+)/ n+ As a consequence, we can compute the determinant of M N, since it is simply evaluated as U, U N,N : Theorem 35 detm N = i N(r s) q 6 N(N )+ 3 N(Ns+s r) ( q r s ) N N (q λ ; q λ ) d (q µ ; q µ ) d q (q λ+dµ+s ; q λ ) d (q µ+λd+s ; q µ ) d d= (d+)d +r+s(d ) q d(d ) s+r+ds
7 ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX 73 Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 35 detm N = ( ) N+ 6 N(N ) N F 5d(d+)/ d+ d F d= 5d(d )/ d+3 ( d ( d )( d F t F 3t ) )( d ) F 3t+d F t+3d Now we compute the inverse of the matrix M It depends on the dimension, so we compute (M N ) Theorem 36 For n, d N: (M N ) n,d = ( )n d i s r q r+s +λ d(d+) +µ n(n+) Ns Ndλ Nnµ (q s+λ+µn ; q λ ) N (q s+µ+λd ; q µ ) N (q λ ; q λ ) N d (q λ ; q λ ) d (q µ ; q µ ) n (q µ ; q µ ) N n N(N+) q ( q s+µn+λd )( q r s N(N+) ) q +r+sn s Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 36 For n, d N: λd µn+r+sn s ( ( )( n+ N )( N ) )+d+n+nn F 3t+d F t+3n (M N ) n,d = ( d )( n )( N d )( N n F t F 3t F t F 3t )F d+3n 4 The matrix H We obtain the LU-decomposition H = L U: Theorem 4 For d n we have F 5N(N+)/ d 3n N+3 F 5N(N+)/ N+ L n,d = q λ n d i λ(n d) ( qr+µ+λd ; q µ ) d (q λ ; q λ ) n ( q r+µ+λn ; q µ ) d (q λ ; q λ ) d (q λ ; q λ ) n d Fibonacci Corollary for λ = 3, µ = and r = : Corollary 4 For d n, ( d ) L t+3d+ L n,d = ( d ) L t+3n+ ( d ( n ) F 3t )( n d ) F 3t F 3t
8 74 KILIÇ AND PRODINGER Theorem 4 For d n we have U d,n = ( ) d i r µn λd q µ n d +rd r + d (q λ ; q λ ) d ( q r+µn+λ ; q λ ) d ( q r+µ+λd ; q µ ) d (q µ ; q µ ) n (q µ ; q µ ) n d Fibonacci Corollary for λ = 3, µ = and r = : Corollary 4 For d n ( ) (d ) 5 d U d,n = ( d )( d ) L 3t+n+ L t+3d+ The inverses of the matrices L and U: Theorem 43 For d n we have ( d )( n ) F 3t F t ( n d ) F t L n,d = ( )n d i λ(n d) q λ (n d) ( q r+µ+λd ; q µ ) n (q λ ; q λ ) n ( q r+µ+λn ; q µ ) n (q λ ; q λ ) d (q λ ; q λ ) n d Fibonacci Corollary for λ = 3, µ = and r = : Corollary 43 For d n L n,d = ( )(n+ ( n )+( d ) nd ( n )( n ) L t+3d+ F 3t )( d )( n d ) L t+3n+ F 3t F 3t Theorem 44 For d n we have d,n = ( )d i r+λn+µd q λ n U +µ d µnd rn+ r ( qr+µd+λ ; q λ ) n ( q r+λn+µ ; q µ ) n (q λ ; q λ ) n (q µ ; q µ ) d (q µ ; q µ ) n d Its Fibonacci Corollary for λ = 3, µ = and r = : Corollary 44 For d n ( n )( n ) L t+3n+ L 3t+d+ U d,n = ( )(n+ ) d ( d )( n d )( n ) 5 n F t F t F 3t As a consequence, we can compute the determinant of H N, since it is simply evaluated as U, U N,N : Theorem 45 deth N = i N(N+)+Nr+N(N+) q N + N 4 + N3 6 + N r
9 ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX 75 N d= Fibonacci Corollary for λ = 3, µ = and r = : (q λ ; q λ ) d (q µ ; q µ ) d ( q r+µd+λ ; q λ ) d ( q r+µ+λd ; q µ ) d Corollary 45 ( d )( d ) deth N = 5 N(N )/ ( ) (N+ ) N F 3t F t ( d )( d ) d= L 3t+d+ L t+3d+ Now we compute the inverse of the matrix H It depends on the dimension, so we compute (H N ) Theorem 46 For n, d N: (H N ) n,d = ( )N n d i r+µn+λd q µ n +λ d µnn λnd Nr+ r ( q r+µn+λ ; q λ ) N ( q r+λd+µ ; q µ ) N (q λ ; q λ ) N d (q λ ; q λ ) d (q µ ; q µ ) N n (q µ ; q µ ) n + q r+µn+λd Fibonacci Corollary for λ = 3, µ = and r = : Corollary 46 For n, d N: ( N )( N ) L 3t+n+ L t+3d+ (H N ) n,d = ( )(d+ )+Nd+n+d ( N d )( d )( N n )( n ) 5 N F 3t F 3t F t F t 5 The matrix W Now we collect our results related to the matrix W For convenience, we use the same letters L, U, but with a different meaning We obtain the LU-decomposition W = L U: Theorem 5 For d n we have L n,d = (q λ ; q λ ) n (q λ ; q λ ) d (q λ ; q λ ) n d ( q s+λd+µ ; q µ ) d ( q s+λn+µ ; q µ ) d ( )d q d(d+) ( ) d q +λ(n d)+r+s(d ) d(d+) +r+s(d ) Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 5 For d n, ( n ) d F t L 3t+d L n,d = ( d )( n d ) d F t F t L 3t+n { L5d(d+)/+n 3d+ L 5d(d+)/ d+ F 5d(d+)/+n 3d+ F 5d(d+)/ d+ if d is even, if d is odd
10 76 KILIÇ AND PRODINGER Theorem 5 For d n we have U d,n = is r ( ) d d(d ) + q r+s +ds (q λ ; q λ ) d (q µ ; q µ ) n (q µ ; q µ ) n d ( q λ+nµ+s ; q λ ) d ( q µ+λd+s ; q µ ) d (d+)d ( )d q + ( ) d q +µ(n d)+r+ds s d(d ) +r+ds s Fibonacci Corollary for λ =, µ = 3, r = and s = : ( q r s ) Corollary 5 For d n ( d )( n ) F t F 3t U d,n = ( ) (d ) ( n d )( d )( d ) F 3t L 3t+d L t+3n 5 d L 5(d+)d/+3n 4d+ F 5d(d )/ d+3 if d is odd, if d is even The inverses of the matrices L and U: Theorem 53 For d n we have L 5 d F 5(d+)d/+3n 4d+ L 5d(d )/ d+3 n,d = ( )n d q λ(n d ) (q λ(n d+) ; q λ ) d ( q s+µ+λd ; q µ ) n (q λ ; q λ ) d ( q s+µ+λn ; q µ ) n + n(n+) ( )n q µn λd+r s+ns + ( ) n n(n+) q Fibonacci Corollary for λ =, µ = 3, r = and s = : µn λn+r s+ns Corollary 53 For d n ( n )( n ) ( )n d F t L 3t+d n,d = ( d )( n d )( n ) F t F t L 3t+n L Theorem 54 For d n we have U d,n = q r+s r d(d+) +µ λ n(n ) ns µnd { F5n(n+)/ d 4n+3 F 5n(n+)/ 6n+3 L 5n(n+)/ d 4n+3 L 5n(n+)/ 6n+3 if n is odd, if n is even is r ( ) d ( q s+λ+µd ; q λ ) n ( q s+µ+λn ; q µ ) n ( q r s )(q λ ; q λ ) n (q µ ; q µ ) n d (q µ ; q µ ) d + ( )n q (n(n )/)+µ(n d)+r+s(n ) ( ) n n(n+) q +r+s(n ) Its Fibonacci Corollary for λ =, µ = 3, r = and s = :
11 ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX 77 Corollary 54 For d n U d,n = ( )(d+ )+d+n nd ( n ( d )( n ) L t+3d L 3t+n )( n F 3t )( n d ) F t F 3t { L5n(n )/+n 3d+3 5 n F 5n(n+)/ n+ if n is even, F 5n(n )/+n 3d+3 5 n L 5n(n+)/ n+ if n is odd As a consequence, we can compute the determinant of W N, since it is simply evaluated as U, U N,N (we only state the Fibonacci version for λ =, µ = 3, r = and s = ): Theorem 55 detw N = ( ) 6 N(N ) N d= ( d ( d )( d F t F 3t ) )( d ) L 3t+d L t+3n 5 d L 5(d+)d/ d+ F 5d(d )/ d+3 5 d F 5(d+)d/ d+ L 5d(d )/ d+3 if d is odd, if d is even Now we compute the inverse of the matrix W It depends on the dimension, so we compute (W N ) Theorem 56 For d n N: (W N ) n,d = is r ( ) n d +N q λ d(d+) +µ n(n+) Ns Ndλ Nnµ+ r+s ( q λ+µn+s ; q λ ) N ( q µ+λd+s ; q µ ) N ( + q s+µn+λd )( q r s ) (q λ ; q λ ) N d (q λ ; q λ ) d (q µ ; q µ ) n (q µ ; q µ ) N n + N(N+) ( )N q ( ) N q λd µn+r+sn s N(N+) +r+sn s Fibonacci Corollary for λ =, µ = 3, r = and s = : Corollary 55 For d n N: ( N )( N ) ( )(n+ )+n+d Nn L 3t+d L t+3n (W N ) n,d = ( d )( n )( N d )( N n F t F 3t F t F 3t )L d+3n { L5N(N+)/ d 3n N+3 5 N F 5N(N+)/ N+ if N is even, F 5N(N+)/ d 3n N+3 5 N L 5N(N+)/ N+ if N is odd
12 78 KILIÇ AND PRODINGER 6 Proofs Following our introductory remarks, we present now two proofs about the matrix T In order to show that indeed T = L U, we need to show that for any m, n: L m,d U d,n = t m,n = i r λm µn q (λm+µn+r ) q q λm+µn+r d In a rewritten form the formula to be proved reads L m,d U d,n = (q λ ; q λ ) m (q µ ; q µ ) n ( q)i r µn λm q (λm+µn r ) d q d +rd µd λ d (q r+µ+λd ; q µ ) d (q λ ; q λ ) m d (q r+µ+λm ; q µ ) d (q µ ; q µ ) n d (q r+λ+µn ; q λ ) d (q r+µ+λd ; q µ ) d d Apart form the constant factor, it should be proven that (6) d q d +rd µd λ d (q r+µ+λd ; q µ ) d (q λ ; q λ ) m d (q r+µ+λm ; q µ ) d (q µ ; q µ ) n d (q λ+µn+r ; q λ ) d (q r+µ+λd ; q µ ) d = (q λ ; q λ ) m (q µ ; q µ ) n ( q λm+µn+r ) For the verification of the last equation, let us denote the LHS of the equation (6) by SUM m, then the Mathematica version of the q-zeilberger algorithm [8] produces the recursion q m(λ )+µn+r SUM m = ( q m(λ ) )( q mλ+µn+r ) SUM m Now we move to the inverse matrices Since L and L are lower triangular matrices, we only need to look at the entries indexed by (m, n) with m n: n d m L m,d L d,n = (qλ ; q λ ) m (q λ ; q λ ) n i λm q λm ( ) n i λn q λn n d m ( ) d q λdn+ λd λd (q µ+λd+r ; q µ ) d (q µ+λn+r ; q µ ) d (q λ ; q λ ) m d (q µ+λm+r ; q µ ) d (q λ ; q λ ) d n (q µ+λd+r ; q µ ) d For the sum on d in the last expression, the q-zeilberger algorithm evaluates it and gives us 0 for m n For m = n, it is easy: (q λ ; q λ ) n (q λ ; q λ ) n i λn q λn ( ) n i λn q λn ( )n q λn + λn λn (q µ+λn+r ; q µ ) n (q µ+λn+r ; q µ ) n (q µ+λn+r ; q µ ) n (q µ+λn+r ; q µ ) n = In that case, the equality is valid as well and so the proof is complete Now we present a proof for M We start with an introductory remark For all the identities that we need to prove, experiments indicate that they are Gosper-summable However, the entries
13 ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX 79 that we encounter in our instances, do not qualify for the q-zeilberger algorithm that we used in our earlier papers Therefore, it was necessary to guess the relevant quantities; the justification is then complete routine However, this guessing procedure is (with all the parameters involved) extremely time consuming, and so we confined ourselves to the demonstration of one such proof We hope that extensions of the q-zeilberger algorithm will be developed that fit our needs We deal now with L m,d L d,n n d m and prove that it is for n = m (there is only one term in the sum) and 0 for n > m since we have lower triangular matrices So let us assume m > n We will prove a general formula depending on an extra variable K: L m,d L d,n = ( )K n q λ K(K+) λkn+λ n(n ) n d K K(K+) q +r+sk s+(m n)λ K(K+) q +r+sk s (q λ ; q λ ) m (q s+λn+µ ; q µ ) K q λm λn (q λ ; q λ ) K n (q λ ; q λ ) m K (q λ ; q λ ) n (q s+λm+µ ; q µ ) K The formula we need follows from setting K := m Note that the RHS of formula equals 0 when K = m > n because of the term (q λ ; q λ ) m K in the denominator of the second row The proof of the formula is by induction Clearly it is true for K = n, and the induction step amounts to show that which equals n d K L m,d L d,n + L m,k+l K+,n = n d K+ L m,d L d,n, K(K+) ( ) K n q λ K(K+) λkn+λ n(n ) q +sk s+r+(m n)λ + K(K+) q +sk s+r (q λ ; q λ ) m (q λ ; q λ ) K n (q λ ; q λ ) m K (q λ ; q λ ) n (q s+λn+µ ; q µ ) K (q s+λm+µ ; q µ ) K (q λ ; q λ ) m (q λ ; q λ ) K (q λ ; q λ ) m K (q s+λ(k+)+µ ; q µ ) K+ (q s+λm+µ ; q µ ) K+ q (K+)(K+) +λ(m K )+sk+r (K+)(K+) q +sk+r ( ) K+ n q λ K(K+) +λ n(n+) λn(k+) (q s+λn+µ ; q µ ) K (q s+λ(k+)+µ ; q µ ) K q λm λn λ+µ q λn+ (K+) + λ µ (K+)+r+s(K ) (q λ ; q λ ) K λ+µ q λ(k+)+ (K+) + λ µ (K+)+r+s(K ) (q λ ; q λ ) n (q λ ; q λ ) K+ n = ( ) K+ n q λ (K+)(K+) λn(k+)+λ n(n )
14 80 KILIÇ AND PRODINGER q (K+)(K+) +s(k+) s+r+(m n)λ (K+)(K+) q +s(k+) s+r q λm λn or (q λ ; q λ ) m (q λ ; q λ ) K n+ (q λ ; q λ ) m K (q λ ; q λ ) n (q s+λn+µ ; q µ ) K+ (q s+λm+µ ; q µ ) K+, K(K+) ( q +sk s+r+(m n)λ (K+)(K+) )( q +sk+r ) ( q λ(k n+) )( q s+λm+µ+µk ) + ( q s+λ(k+)+µ+µk (K+)(K+) ) ( q +λ(m K )+sk+r ) λ+µ λn+ ( q (K+) + λ µ (K+)+r+s(K ) )( q λm λn ) = q λ+kλ nλ (K+)(K+) ( q +s(k+) s+r+(m n)λ ) K(K+) ( q +sk s+r )( q λ(m K ) )( q s+λn+µ+µk ), which is a routine check Thus we have the claimed result References C Berg, Fibonacci numbers and orthogonal polynomials, Arab J Math Sci 7 (0), M E H Ismail, One parameter generalizations of the Fibonacci and Lucas numbers, Fibonacci Quart 46/47 (008/009), E Kılıç, H Prodinger, A generalized Filbert matrix, Fibonacci Quart 48() (00), , The q-pilbert matrix, Int J Comput Math 89(0) (0), , Variants of the Filbert matrix, Fibonacci Quart 5() (03), , The generalized Lilbert matrix, submitted 7, The generalized q-pilbert Matrix, Math Slovaca, to appear 8 P Paule, A Riese, A mathematica q-analogue of Zeilberger s algorithm based on an algebraically motivated approach to q-hypergeometric telescoping; in: Special functions, q-series and related topics, Fields Inst Commun 4 (997), H Prodinger, A generalization of a Filbert matrix with 3 additional parameters, Trans Roy Soc South Africa 65 (00), T Richardson, The Filbert matrix, Fibonacci Quart 39(3) (00), Department of Mathematics (Received ) TOBB University of Economics and Technology Ankara 06560, Turkey ekilic@etuedutr Department of Mathematics University of Stellenbosch Stellenbosch 760, South Africa hproding@sunacza
A GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS
A GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS HELMUT PRODINGER Abstract A generalize Filbert matrix from [] is further generalize, introucing 3 aitional parameters Explicit formulæ
More informationSome Generalized Fibonomial Sums related with the Gaussian q Binomial sums
Bull. Math. Soc. Sci. Math. Roumanie Tome 55(103 No. 1, 01, 51 61 Some Generalized Fibonomial Sums related with the Gaussian q Binomial sums by Emrah Kilic, Iler Aus and Hideyui Ohtsua Abstract In this
More informationA PROOF OF MELHAM S CONJECTURE
A PROOF OF MELHAM S CONJECTRE EMRAH KILIC 1, ILKER AKKS, AND HELMT PRODINGER 3 Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationA PROOF OF A CONJECTURE OF MELHAM
A PROOF OF A CONJECTRE OF MELHAM EMRAH KILIC, ILKER AKKS, AND HELMT PRODINGER Abstract. In this paper, we consider Melha s conecture involving Fibonacci and Lucas nubers. After rewriting it in ters of
More informationGeneralized Bivariate Lucas p-polynomials and Hessenberg Matrices
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 15 (2012), Article 12.3.4 Generalized Bivariate Lucas p-polynomials and Hessenberg Matrices Kenan Kaygisiz and Adem Şahin Department of Mathematics Faculty
More informationCounting Palindromes According to r-runs of Ones Using Generating Functions
3 47 6 3 Journal of Integer Sequences, Vol. 7 (04), Article 4.6. Counting Palindromes According to r-runs of Ones Using Generating Functions Helmut Prodinger Department of Mathematics Stellenbosch University
More informationCounting Palindromes According to r-runs of Ones Using Generating Functions
Counting Palindromes According to r-runs of Ones Using Generating Functions Helmut Prodinger Department of Mathematics Stellenbosch University 7602 Stellenbosch South Africa hproding@sun.ac.za Abstract
More informationThe generalized order-k Fibonacci Pell sequence by matrix methods
Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM
q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric
More informationTHE N-VALUE GAME OVER Z AND R
THE N-VALUE GAME OVER Z AND R YIDA GAO, MATT REDMOND, ZACH STEWARD Abstract. The n-value game is an easily described mathematical diversion with deep underpinnings in dynamical systems analysis. We examine
More informationUsing q-calculus to study LDL T factorization of a certain Vandermonde matrix
Using q-calculus to study LDL T factorization of a certain Vandermonde matrix Alexey Kuznetsov May 2, 207 Abstract We use tools from q-calculus to study LDL T decomposition of the Vandermonde matrix V
More informationCertain Diophantine equations involving balancing and Lucas-balancing numbers
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 0, Number, December 016 Available online at http://acutm.math.ut.ee Certain Diophantine equations involving balancing and Lucas-balancing
More informationWe begin by considering the following three sequences:
STUDENT S COMPANIONS IN BASIC MATH: THE TWELFTH The Concept of Limits for Sequences and Series In calculus, the concept of limits is of paramount importance, in view of the fact that many basic objects
More informationMath Circle: Recursion and Induction
Math Circle: Recursion and Induction Prof. Wickerhauser 1 Recursion What can we compute, using only simple formulas and rules that everyone can understand? 1. Let us use N to denote the set of counting
More informationarxiv: v1 [math.nt] 17 Nov 2011
On the representation of k sequences of generalized order-k numbers arxiv:11114057v1 [mathnt] 17 Nov 2011 Kenan Kaygisiz a,, Adem Sahin a a Department of Mathematics, Faculty of Arts Sciences, Gaziosmanpaşa
More informationELA
Volume 18, pp 564-588, August 2009 http://mathtechnionacil/iic/ela GENERALIZED PASCAL TRIANGLES AND TOEPLITZ MATRICES A R MOGHADDAMFAR AND S M H POOYA Abstract The purpose of this article is to study determinants
More informationBalancing sequences of matrices with application to algebra of balancing numbers
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol 20 2014 No 1 49 58 Balancing sequences of matrices with application to algebra of balancing numbers Prasanta Kumar Ray International Institute
More informationON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS
Hacettepe Journal of Mathematics and Statistics Volume 8() (009), 65 75 ON QUADRAPELL NUMBERS AND QUADRAPELL POLYNOMIALS Dursun Tascı Received 09:0 :009 : Accepted 04 :05 :009 Abstract In this paper we
More information1 Introduction. 2 Determining what the J i blocks look like. December 6, 2006
Jordan Canonical Forms December 6, 2006 1 Introduction We know that not every n n matrix A can be diagonalized However, it turns out that we can always put matrices A into something called Jordan Canonical
More informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More informationEvaluation of various partial sums of Gaussian q-binomial sums
Arab J Math (018) 7:101 11 https://doiorg/101007/s40065-017-0191-3 Arabian Journal of Matheatics Erah Kılıç Evaluation of various partial sus of Gaussian -binoial sus Received: 3 February 016 / Accepted:
More informationMATHEMATICS 23a/E-23a, Fall 2015 Linear Algebra and Real Analysis I Module #1, Week 4 (Eigenvectors and Eigenvalues)
MATHEMATICS 23a/E-23a, Fall 205 Linear Algebra and Real Analysis I Module #, Week 4 (Eigenvectors and Eigenvalues) Author: Paul Bamberg R scripts by Paul Bamberg Last modified: June 8, 205 by Paul Bamberg
More informationNEW IDENTITIES FOR THE COMMON FACTORS OF BALANCING AND LUCAS-BALANCING NUMBERS
International Journal of Pure and Applied Mathematics Volume 85 No. 3 013, 487-494 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.173/ijpam.v85i3.5
More informationFibonacci and Lucas numbers via the determinants of tridiagonal matrix
Notes on Number Theory and Discrete Mathematics Print ISSN 30 532, Online ISSN 2367 8275 Vol 24, 208, No, 03 08 DOI: 07546/nntdm2082403-08 Fibonacci and Lucas numbers via the determinants of tridiagonal
More informationOn the Pell Polynomials
Applied Mathematical Sciences, Vol. 5, 2011, no. 37, 1833-1838 On the Pell Polynomials Serpil Halici Sakarya University Department of Mathematics Faculty of Arts and Sciences 54187, Sakarya, Turkey shalici@sakarya.edu.tr
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationDeterminant and Permanent of Hessenberg Matrix and Fibonacci Type Numbers
Gen. Math. Notes, Vol. 9, No. 2, April 2012, pp.32-41 ISSN 2219-7184; Copyright c ICSRS Publication, 2012 www.i-csrs.org Available free online at http://www.geman.in Determinant and Permanent of Hessenberg
More informationFibonacci numbers, Euler s 2-periodic continued fractions and moment sequences
arxiv:0902.404v [math.ca] 9 Feb 2009 Fibonacci numbers, Euler s 2-periodic continued fractions and moment sequences Christian Berg and Antonio J. Durán Institut for Matematiske Fag. Københavns Universitet
More informationOn Linear Recursive Sequences with Coefficients in Arithmetic-Geometric Progressions
Applied Mathematical Sciences, Vol. 9, 015, no. 5, 595-607 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.015.5163 On Linear Recursive Sequences with Coefficients in Arithmetic-Geometric Progressions
More informationOn the (s,t)-pell and (s,t)-pell-lucas numbers by matrix methods
Annales Mathematicae et Informaticae 46 06 pp 95 04 http://amiektfhu On the s,t-pell and s,t-pell-lucas numbers by matrix methods Somnuk Srisawat, Wanna Sriprad Department of Mathematics and computer science,
More informationCOMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS. Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia
#A2 INTEGERS 9 (209) COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia imartinjak@phy.hr Helmut Prodinger Department of Mathematics,
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationOn Some Combinations of Non-Consecutive Terms of a Recurrence Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.3.5 On Some Combinations of Non-Consecutive Terms of a Recurrence Sequence Eva Trojovská Department of Mathematics Faculty of Science
More informationThe inverse of a tridiagonal matrix
Linear Algebra and its Applications 325 (2001) 109 139 www.elsevier.com/locate/laa The inverse of a tridiagonal matrix Ranjan K. Mallik Department of Electrical Engineering, Indian Institute of Technology,
More informationNew Multiple Harmonic Sum Identities
New Multiple Harmonic Sum Identities Helmut Prodinger Department of Mathematics University of Stellenbosch 760 Stellenbosch, South Africa hproding@sun.ac.za Roberto Tauraso Dipartimento di Matematica Università
More informationarxiv: v1 [math.co] 20 Aug 2015
arxiv:1508.04953v1 [math.co] 20 Aug 2015 On Polynomial Identities for Recursive Sequences Ivica Martinak and Iva Vrsalko Faculty of Science University of Zagreb Bienička cesta 32, HR-10000 Zagreb Croatia
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More information17 Advancement Operator Equations
November 14, 2017 17 Advancement Operator Equations William T. Trotter trotter@math.gatech.edu Review of Recurrence Equations (1) Problem Let r(n) denote the number of regions determined by n lines that
More informationON A FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-LUCAS SEQUENCE. A. A. Wani, V. H. Badshah, S. Halici, P. Catarino
Acta Universitatis Apulensis ISSN: 158-539 http://www.uab.ro/auajournal/ No. 53/018 pp. 41-54 doi: 10.17114/j.aua.018.53.04 ON A FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-LUCAS SEQUENCE A. A. Wani, V.
More informationTakao Komatsu School of Mathematics and Statistics, Wuhan University
Degenerate Bernoulli polynomials and poly-cauchy polynomials Takao Komatsu School of Mathematics and Statistics, Wuhan University 1 Introduction Carlitz [6, 7] defined the degenerate Bernoulli polynomials
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationOn Generalized k-fibonacci Sequence by Two-Cross-Two Matrix
Global Journal of Mathematical Analysis, 5 () (07) -5 Global Journal of Mathematical Analysis Website: www.sciencepubco.com/index.php/gjma doi: 0.449/gjma.v5i.6949 Research paper On Generalized k-fibonacci
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More informationMATH ASSIGNMENT 1 - SOLUTIONS September 11, 2006
MATH 0-090 ASSIGNMENT - September, 00. Using the Trichotomy Law prove that if a and b are real numbers then one and only one of the following is possible: a < b, a b, or a > b. Since a and b are real numbers
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationHankel Operators plus Orthogonal Polynomials. Yield Combinatorial Identities
Hanel Operators plus Orthogonal Polynomials Yield Combinatorial Identities E. A. Herman, Grinnell College Abstract: A Hanel operator H [h i+j ] can be factored as H MM, where M maps a space of L functions
More informationApplied Mathematics Letters
Applied Mathematics Letters 5 (0) 554 559 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml On the (s, t)-pell and (s, t)-pell Lucas
More informationLinks Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers
Links Between Sums Over Paths in Bernoulli s Triangles and the Fibonacci Numbers arxiv:1611.09181v1 [math.co] 28 Nov 2016 Denis Neiter and Amsha Proag Ecole Polytechnique Route de Saclay 91128 Palaiseau
More information4 Linear Recurrence Relations & the Fibonacci Sequence
4 Linear Recurrence Relations & the Fibonacci Sequence Recall the classic example of the Fibonacci sequence (F n ) n=1 the relations: F n+ = F n+1 + F n F 1 = F = 1 = (1, 1,, 3, 5, 8, 13, 1,...), defined
More informationOn identities with multinomial coefficients for Fibonacci-Narayana sequence
Annales Mathematicae et Informaticae 49 08 pp 75 84 doi: 009/ami080900 http://amiuni-eszterhazyhu On identities with multinomial coefficients for Fibonacci-Narayana sequence Taras Goy Vasyl Stefany Precarpathian
More informationA Recursive Relation for Weighted Motzkin Sequences
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 8 (005), Article 05.1.6 A Recursive Relation for Weighted Motzkin Sequences Wen-jin Woan Department of Mathematics Howard University Washington, D.C. 0059
More informationOn arithmetic functions of balancing and Lucas-balancing numbers
MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur
More informationON GENERALIZED BALANCING SEQUENCES
ON GENERALIZED BALANCING SEQUENCES ATTILA BÉRCZES, KÁLMÁN LIPTAI, AND ISTVÁN PINK Abstract. Let R i = R(A, B, R 0, R 1 ) be a second order linear recurrence sequence. In the present paper we prove that
More informationFrame Diagonalization of Matrices
Frame Diagonalization of Matrices Fumiko Futamura Mathematics and Computer Science Department Southwestern University 00 E University Ave Georgetown, Texas 78626 U.S.A. Phone: + (52) 863-98 Fax: + (52)
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
More information1 Introduction 1. 5 Rooted Partitions and Euler s Theorem Vocabulary of Rooted Partitions Rooted Partition Theorems...
Contents 1 Introduction 1 Terminology of Partitions 1.1 Simple Terms.......................................... 1. Rank and Conjugate...................................... 1.3 Young Diagrams.........................................4
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationBALANCING NUMBERS : SOME IDENTITIES KABERI PARIDA. Master of Science in Mathematics. Dr. GOPAL KRISHNA PANDA
BALANCING NUMBERS : SOME IDENTITIES A report submitted by KABERI PARIDA Roll No: 1MA073 for the partial fulfilment for the award of the degree of Master of Science in Mathematics under the supervision
More informationSign elements in symmetric groups
Dept. of Mathematical Sciences University of Copenhagen, Denmark Nagoya, September 4, 2008 Introduction Work in progress Question by G. Navarro about characters in symmetric groups, related to a paper
More informationEigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function
Eigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function Will Dana June 7, 205 Contents Introduction. Notations................................ 2 2 Number-Theoretic Background 2 2.
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationEigenspaces in Recursive Sequences
Eigenspaces in Recursive Sequences Ben Galin September 5, 005 One of the areas of study in discrete mathematics deals with sequences, in particular, infinite sequences An infinite sequence can be defined
More informationPermutation Statistics and q-fibonacci Numbers
Permutation Statistics and q-fibonacci Numbers Adam M Goyt and David Mathisen Mathematics Department Minnesota State University Moorhead Moorhead, MN 56562 Submitted: April 2, 2009; Accepted: August 2,
More information2-ADIC PARTIAL STIRLING FUNCTIONS AND THEIR ZEROS. 1. Introduction
2-ADIC PARTIAL STIRLING FUNCTIONS AND THEIR ZEROS DONALD M. DAVIS Abstract. Let P n (x = 1 ( n n! 2i+1 (2i + 1 x. This extends to a continuous function on the 2-adic integers, the nth 2-adic partial Stirling
More informationA q-analogue OF THE GENERALIZED FACTORIAL NUMBERS
J. Korean Math. Soc. 47 (2010), No. 3, pp. 645 657 DOI 10.4134/JKMS.2010.47.3.645 A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS Seok-Zun Song, Gi-Sang Cheon, Young-Bae Jun, and LeRoy B. Beasley Abstract.
More informationA completely entangled subspace of maximal dimension
isibang/ms/2006/6 March 28th, 2006 http://www.isibang.ac.in/ statmath/eprints A completely entangled subspace of maximal dimension B. V. Rajarama Bhat Indian Statistical Institute, Bangalore Centre 8th
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationEigenvectors and Reconstruction
Eigenvectors and Reconstruction Hongyu He Department of Mathematics Louisiana State University, Baton Rouge, USA hongyu@mathlsuedu Submitted: Jul 6, 2006; Accepted: Jun 14, 2007; Published: Jul 5, 2007
More informationThe 4-periodic spiral determinant
The 4-periodic spiral determinant Darij Grinberg rough draft, October 3, 2018 Contents 001 Acknowledgments 1 1 The determinant 1 2 The proof 4 *** The purpose of this note is to generalize the determinant
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationHIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION
ISSN 2066-6594 Ann Acad Rom Sci Ser Math Appl Vol 10, No 1/2018 HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION Mircea Merca Dedicated to Professor Mihail Megan on
More informationABSTRACT 1. INTRODUCTION
THE FIBONACCI NUMBER OF GENERALIZED PETERSEN GRAPHS Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-8010 Graz, Austria e-mail: wagner@finanz.math.tu-graz.ac.at
More informationEquivalence constants for certain matrix norms II
Linear Algebra and its Applications 420 (2007) 388 399 www.elsevier.com/locate/laa Equivalence constants for certain matrix norms II Bao Qi Feng a,, Andrew Tonge b a Department of Mathematical Sciences,
More informationarxiv: v1 [math.nt] 20 Sep 2018
Matrix Sequences of Tribonacci Tribonacci-Lucas Numbers arxiv:1809.07809v1 [math.nt] 20 Sep 2018 Zonguldak Bülent Ecevit University, Department of Mathematics, Art Science Faculty, 67100, Zonguldak, Turkey
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationk-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities and Norms of Hankel Matrices
International Journal of Mathematical Analysis Vol. 9, 05, no., 3-37 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.4370 k-pell, k-pell-lucas and Modified k-pell Numbers: Some Identities
More informationALGEBRAIC GEOMETRY I - FINAL PROJECT
ALGEBRAIC GEOMETRY I - FINAL PROJECT ADAM KAYE Abstract This paper begins with a description of the Schubert varieties of a Grassmannian variety Gr(k, n) over C Following the technique of Ryan [3] for
More informationPELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES. Nurettin Irmak and Murat Alp
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 100114 016, 59 69 DOI: 10.98/PIM161459I PELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES Nurettin Irmak and Murat Alp Abstract. We introduce a novel
More informationThe distribution of run lengths in integer compositions
The distribution of run lengths in integer compositions Herbert S Wilf University of Pennsylvania Philadelphia PA 19104-6395, USA wilf@mathupennedu Submitted: Mar 7, 2010; Accepted: Oct 9, 2011; Published:
More informationAsymptotics of Integrals of. Hermite Polynomials
Applied Mathematical Sciences, Vol. 4, 010, no. 61, 04-056 Asymptotics of Integrals of Hermite Polynomials R. B. Paris Division of Complex Systems University of Abertay Dundee Dundee DD1 1HG, UK R.Paris@abertay.ac.uk
More informationMutually Orthogonal Latin Squares: Covering and Packing Analogues
Squares: Covering 1 1 School of Computing, Informatics, and Decision Systems Engineering Arizona State University Mile High Conference, 15 August 2013 Latin Squares Definition A latin square of side n
More informationarxiv: v1 [math.co] 11 Aug 2015
arxiv:1508.02762v1 [math.co] 11 Aug 2015 A Family of the Zeckendorf Theorem Related Identities Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Abstract
More informationMath 123, Week 2: Matrix Operations, Inverses
Math 23, Week 2: Matrix Operations, Inverses Section : Matrices We have introduced ourselves to the grid-like coefficient matrix when performing Gaussian elimination We now formally define general matrices
More informationBalancing And Lucas-balancing Numbers With Real Indices
Balancing And Lucas-balancing Numbers With Real Indices A thesis submitted by SEPHALI TANTY Roll No. 413MA2076 for the partial fulfilment for the award of the degree Master Of Science Under the supervision
More informationTOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology
TOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology DONALD M. DAVIS Abstract. We use ku-cohomology to determine lower bounds for the topological complexity of mod-2 e lens spaces. In the
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationCHAPTER 8 Advanced Counting Techniques
96 Chapter 8 Advanced Counting Techniques CHAPTER 8 Advanced Counting Techniques SECTION 8. Applications of Recurrence Relations 2. a) A permutation of a set with n elements consists of a choice of a first
More information( ε > 0) ( N N) ( n N) : n > N a n A < ε.
CHAPTER 1. LIMITS OF SEQUENCES 1.1. An Ad-hoc Definition. In mathematical analysis, the concept of limits is of paramount importance, in view of the fact that many basic objects of study such as derivatives,
More informationAutomatic Proofs of Identities: Beyond A=B
Bruno.Salvy@inria.fr FPSAC, Linz, July 20, 2009 Joint work with F. Chyzak and M. Kauers 1 / 28 I Introduction 2 / 28 Examples of Identities: Definite Sums, q-sums, Integrals n k=0 + 0 1 2πi n=0 ( ) H n
More informationMATH 320, WEEK 7: Matrices, Matrix Operations
MATH 320, WEEK 7: Matrices, Matrix Operations 1 Matrices We have introduced ourselves to the notion of the grid-like coefficient matrix as a short-hand coefficient place-keeper for performing Gaussian
More informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
More informationREPRESENTATIONS OF PARABOLIC AND BOREL SUBGROUPS
REPRESENTATIONS OF PARABOLIC AND BOREL SUBGROUPS SCOTT H MURRAY Abstract We demonstrate a relationships between the representation theory of Borel subgroups and parabolic subgroups of general linear groups
More informationNecessary and Sufficient Conditions for Oscillation of Certain Higher Order Partial Difference Equations
International Journal of Difference Equations ISSN 0973-6069, Volume 4, Number 2, pp 211 218 (2009 http://campusmstedu/ijde Necessary and Sufficient Conditions for Oscillation of Certain Higher Order Partial
More information