On the Binomial Interpolated Triangles
|
|
- Lindsey Phelps
- 5 years ago
- Views:
Transcription
1 Journal of Integer Sequences, Vol. 20 (2017), Artcle On the Bnomal Interpolated Trangles László Németh Insttute of Mathematcs Unversty of Sopron Bajcsy Zs. u. 4 H9400 Sopron Hungary nemeth.laszlo@un-sopron.hu Abstract The bnomal nterpolated transform of a sequence s a generalzaton of the wellknown bnomal transform. We examne a Pascal-lke trangle, on whch a bnomal nterpolated transform works between the left and rght dagonals, focusng on bnary recurrences. We gve the sums of the elements n rows and n rsng dagonals, and we defne two specal classes of these arthmetcal trangles. 1 Introducton Let us defne the sequence b = {b n } n=0 R as the bnomal transform of the gven sequence a = {a n } n=0 R by b n = n n ( ) a. Ths transformaton s nvertble wth formula a n = n n ( ) ( 1) n b. Several researchers [1, 2, 3, 5, 7] examned the propertes and the generalzatons of the bnomal transformaton. One of ts generalzatons s the so-called bnomal nterpolated transform [1] gven by b n = n ( ) n u v n a (1) for any non-zero u,v R. Bhadoura at al. [2] and Falcon and Plaza [3] showed for some (fallng and rsng) k-bnomal transform cases, when u = 1, v = k; u = k, v = 1 or u = v = k, that there are specal nfnte (Pascal-lke) trangles, whose left dagonal (left leg) contans the terms of a and the rght one (rght leg) the terms of b. 1
2 ... In our paper, we examne the nner part of ths type of trangle n a generalzed form focusng exclusvely on the bnary recurrence sequences a. We determne the sums and alternatng sums of rows, rsng dagonals and central term sequence and gve explct forms for entres of the trangle. Fnally, we defne and examne two specal classes of our arthmetcal trangles. 2 Bnomal nterpolated trangle Let an arthmetcal trangle (called derangement trangle [2]) be defned by terms a n,k (k-th entry n row n see Fgure 1) from the sequence {a n,0 } n=0, where a n,k = ua n,k 1 +va n 1,k 1 (1 k n), (2) u,v R and uv 0. We shall show that the rght dagonal sequence s a bnomal nterpolated transform of the left dagonal sequence wth parameters u and v. Moreover, we shall prove that the converse also holds, wth the parameters v/u and 1/u. a n,k 1 a n 1,k 1 u v a n,k a 0,0 a 1,0 a 1,1 a n 1,k 1 v u 1 u a n,k 1 a n,k a 2,0 a 2,1 a 2,2 a 3,0 a 3,1 a 3,2 a 3,3 a 4,0 a 4,1 a 4,2 a 4,3 a 4, Fgure 1: Bnomal nterpolated trangle Theorem 1. For all nteger r, k such that k 0 k n, where k 0 0 s a fxed nteger, we have k k 0 ( ) k k0 a n,k = u v k k0 a n k+k0 +,k 0. (3) Proof. We prove t by nducton on n and k. If k = k 0, then the formula (3) trvally holds for any n. We suppose that (3) s true up to k 0 k 1. Let 1 k = k k 0. Then 2
3 a n,k = ua n,k 1 +va n 1,k 1 k 1 ( ) k 1 k 1 ( ) k 1 = u u v k 1 a n k++1,k0 +v u v k 1 a n k+,k0 = = k 1 ( ) k 1 k 1 ( ) k 1 u +1 v k 1 a n k++1,k0 + u v k a n k+,k0 k =1 ( ) k 1 k 1 u v k a 1 n k+,k0 + =1 ( k 1 ) u v k a n k+,k0 k 1 ( ) k 1 k 1 = u k a n,k0 + u v k a 1 n k+,k0 +v k a n k,k0 + k 1 (( ) k 1 = v k a n k,k = k =1 ( ) k u v k a n k+,k0. ( k 1 =1 ( k 1 )) u v k a n k+,k0 +u k a n,k0 ) u v k a n k+,k0 Consderng the substtutons k 0 = 0 and k = n, or consderng a fxed term a n0,k 0 leads us to the followng corollary. Corollary 2. The rght dagonal sequence s the bnomal nterpolated transform of the left dagonal sequence, so n ( ) n b n = a n,n = u v n a,0. (4) Furthermore, let us fx k 0 and n 0, so that 0 k 0 n 0. Then the terms a,j = a n,k form a bnomal nterpolated sub-trangle (see Fgure 2), where = n n 0, j = k k 0 n 0 n, k 0 k n (n 0 k 0 ). The sub-trangle s rght dagonal sequence s the bnomal nterpolated transform of ts left dagonal sequence. We now express the terms a n,k by the rght dagonal sequence {a n,n } n=0. Theorem 3. For any 0 k n n k ( n k a k n = )( 1 u ) ( v ) n k a k+ k+ u. (5) 3
4 ... a 0,0 k 0 a 1,0 a 1,1... n a 0,0. a 1,0. a 1, Fgure 2: Sub-trangle of the bnomal nterpolated trangle Proof. We suppose that the sequence {b n = a n,n } wth {b n } n=0 = {a n,n } n=0 s gven. Let U = 1/u and V = v/u, then the rght equalty s a n,k 1 = Ua n,k +Va n 1,k 1, accordng to (2). Based on ths connecton, we can wrte the entres of the bnomal nterpolated trangle (from rght to left) by b n,r, where b n,0 = b n, b n,r = Ub n,r 1 +Vb n 1,r 1 (1 r n). Usng relaton (3), proved n Theorem 1, we obtan b n,r = r ( ) r U V r b n r+,0. Snce b n,r = a n,n r, consderng the substtuton k = n r, the thess follows. If k = 0, as a drect consequence of Theorem 3, the nverse transformaton of the bnomal nterpolated transform (1) s a n,0 = n ( n )( 1 u ) ( v u) n a,. (6) 3 Bnary bnomal nterpolated trangle Let a n,0 = a n, where {a n } n=0 s a bnary recursve sequence defned by a n = αa n 1 +βa n 2 (2 n, α,β R, αβ 0), (7) wth ntal values a 0,a 1 R ( a 0 + a 1 0). Then we call the bnomal nterpolated trangle bnary bnomal nterpolated trangle and we let BIT (a 0,a 1,α,β;u,v) (n short BIT ) denote t. Bhadoura et al. [2] gave three specal examples, where the trangles are generated by the 4-Lucas sequence. They are BIT (2,4,4,1;1,1), BIT (2,4,4,1;4,1) and BIT (2,4,4,1;4,4). 4
5 From now on, we wll use two mportant varables A = uα+2v and B = u 2 β uvα v 2. Frst of all, we gve some recursve formulas for terms a n,k. The results of the next techncal lemma wll be useful durng the proofs of the further theorems. Lemma 4. The followng recurrence relatons hold a n,k = αa n 1,k +βa n 2,k (2 k +2 n), (8) a k n = uβ v a n 1,k B v a n 1,k 1 (2 k +1 n), (9) a n,k = uα+v a n 1,k + B u u a n 2,k 1 (2 k +1 n), (10) a n,k = (uα+v)a n 1,k 1 +uβa n 2,k 1 (2 k +1 n), (11) a n,k = u2 β +v 2 a n 1,k 1 ub v v a n 1,k 2 (2 k n), (12) a n,k = Aa n 1,k 1 +Ba n 2,k 2 (2 k n), (13) a n,k = 2uβ vα a n,k 1 B β β a n,k 2 (2 k n). (14) Proof. Frst we prove relaton (8) by nducton. For k = 0 t corresponds to defnton (7). Let us suppose that ths formula s true up to k 1. So, f x = a n 3,k 1 and y = a n 2,k 1, then a n 1,k 1 = βx+αy and a n,k 1 = αβx+(β +α 2 )y hold. Fgure 3, whch s a sutable part of Fgure 1, depcts t. Now a n 2,k = vx + uy, a n 1,k = uβx + (uα + v)y and a n,k = (uαβ+vβ)x+(uα 2 +vα+uβ)y, whch gves (8). Moreover, we proved wth t, that Fgure 3 could be any part of Fgure 1. In order to prove the further equatons we can also use the relevant part of Fgure 3. For example, n the case (11) a n,k = (uα+v)y +uβx = uβx+(uα+v)y. The relaton (13) gves that the rght dagonal sequence b (and the -th dagonals parallel to t) satsfes the bnary recurrence relaton n 2 b n = Ab n 1 +Bb n 2 (15) wth ntal values b 0 = a 0, b 1 = ua 1 +va 0 (generally, b 0 = a,0, b 1 = a +1,1, 0). Moreover, the system of equatons A = 0, B = 0 gves v = uα/2 and u 2 (α 2 + 4β) = 0. Thus, as the condton uv 0 holds, f v uα/2 or α 2 + 4β 0, then A + B = 0, otherwse A = B = 0. 5
6 x y vx+uy βx+αy αβx+(α 2 +β)y uβx+(uα+v)y (uαβ +vβ)x + (uα 2 +vα+uβ)y (u 2 β +v 2 )x + (u 2 α+2uv)y (u 2 αβ +2uvβ)x + (u 2 α 2 +u 2 β +2uvα+v 2 )y Fgure 3: A part of the growng 3.1 Sums and alternatng sums of rows Let s = {s n } n=0 be the sequence whose elements are the sums of the values belongng to the n-th row of a bnomal nterpolated trangle. We have s n = n a n,k = k=0 n k=0 k ( ) k u v k a n k+,0. (16) We obtan a lnear recurrence for s, whose coeffcents depend only on α, β, A and B,.e., the coeffcents of the bnary recurrences related to sequences a and b. Theorem 5. The sequence s satsfes the followng fourth order lnear homogeneous recurrence n 4 s n = (α+a)s n 1 +(β αa+b)s n 2 (αb +βa)s n 3 βbs n 4. (17) Proof. The sum of row n can be gven by the prevous two ones n form s n = α(s n 1 a n 1,n 1 )+βs n 2 +a n,n 1 +a n,n. (18) Snce ua n,n 1 = a n,n va n 1,n 1 then from (18) we obtan us n = uαs n 1 +uβs n 2 +(u+1)a n,n (αu+v)a n 1,n 1. (19) Applyng (13) and as A αu v = v we have us n = uαs n 1 +uβs n 2 +(Au+v)a n 1,n 1 +B(u+1)a n 2,n 2. (20) Now we transform (19) nto us n 1 = uαs n 2 +uβs n 3 +(u+1)a n 1,n 1 (αu+v)a n 2,n 2. (21) 6
7 Transformng agan (19) nto form us n 2 = uαs n and usng (13) we gan ubs n 2 = ub(αs n 3 +βs n 4 ) (αu+v)a n 1,n 1 +(B(u+1)+(αu+v)A)a n 2,n 2. (22) Fnally, let us express a n 1,n 1 and a n 2,n 2 from (20) and (21), respectvely. We substtute them nto (22) and obtan (17). Remark 6. It should be notced that the recurrence (18) s the mnmal order recurrence of s when B(u+1) 2 +(αu+v)(au+v) 0. Indeed, n ths case the determnant of coeffcents of the system (from (20) and (21)) { (Au+v)a n 1,n 1 +B(u+1)a n 2,n 2 = us n uαs n 1 uβs n 2 (u+1)a n 1,n 1 (αu+v)a n 2,n 2 = us n 1 uαs n 2 uβs n 3 s dfferent from 0, so the system has a unque soluton, otherwse when B(u+1) 2 +(αu+v)(au+v) = 0 or, equvalently, wth a lttle bt of calculatons, when B(u + 1) 2 + (α u)(v + uα) = 0 the mnmal order of the lnear recurrence of s should be less then four. For example, the soluton u = 1 and v = α mples that A = α and B = β. Then the relaton (20) becomes n 2 s n = αs n 1 +βs n 2. (23) Obvously, summng relatons s n = αs n 1 + βs n 2, αs n 1 = α 2 s n 2 αβs n 3 and βs n 2 = αβs n 3 β 2 s n 4 we fnd that the recurrence (17) also holds for sequence s, but t s not the mnmal order one. Let the sequence s = { s n } n=0 be the alternatng sum sequence, where the terms are the values of rows of a bnomal nterpolated trangle, so that n n k ( ) k s n = ( 1) k a n,k = ( 1) k u v k a n k+,0. k=0 k=0 Theorem 7. The sequence s satsfes the followng fourth order lnear homogeneous recurrence n 4 s n = (α A) s n 1 +(β +αa+b) s n 2 (αb βa) s n 3 βb s n 4. (24) Proof. Rowbyrowthesgnsoftheentresnthealternatngsumsdonotchangendrectons parallel to the left dagonal (sgn(( 1) k a n,k ) = sgn(( 1) k a n 1,k )), but parallel to the rght dagonal they change (sgn(( 1) k a n,k ) sgn(( 1) k 1 a n 1,k 1 )). Hence we only have to change the sgn of A n the summaton relaton (17). Remark 8. If u = 1 and v = α, then the relaton (24) becomes more smple, n 3 s n = (α 2 +2β) s n 2 β 2 s n 4. (25) 7
8 3.2 Rsng dagonal sum sequence The sequence d = {d n } n=0 of sums of elements n rsng dagonals has the followng defnton n n 2 n 0 d n = a k,n k = a n k,k. (26) k= n 2 k=0 When we consder the Pascal arthmetcal trangle t s well-known that these sums provde the Fbonacc sequence. We gve the recurrence relaton for the sequence of sums of elements belongng to rsng dagonal (.e., shallow dagonal as they are defned n Wolfram Math World [8]) of our bnomal nterpolated trangles. Theorem 9. The rsng dagonals sums sequence d of a BIT satsfes the sxth order lnear recurrence relaton n 6 D n = AD n 2 +BD n 4, (27) where D n = d n +αd n 1 +βd n 2. Moreover, for even n (n = 2k, n 2), D n = b k also holds. We pont out that wth the equaton (27) s a concse expresson for the followng sxth order recurrence relaton d n = αd n 1 +(β +A)d n 2 αad n 3 +( βa+b)d n 4 αbd n 5 βbd n 6. (28) Proof. Wthout loss of generalty, let n = 2k. The values of d n+2 and d n+3 can be gven by the prevous two ones n forms d n+2 = αd n+1 +βd n +a k+1,k+1, d n+3 = α(d n+2 a k+1,k+1 )+βd n+1 +a k+2,k+1, generally for even and odd ndexes we have d n+2 = αd n+2 1 +βd n+2 2 +a k+,k+, d n+2+1 = α(d n+2 a k+,k+ )+βd n+2 1 +a k++1,k+. When we consder D n, wth n even, we obtan and accordng to (13) 1 a k+,k+ = d n+2 αd n+2 1 βd n+2 2 = D n+2, D n+6 AD n+4 BD n+2 = a k+3,k+3 +Aa k+2,k+2 +Ba k+1,k+1 = 0. 8
9 If we deal wth the case D n, wth n odd, then, usng relatons (10) and (2), we fnd Thus d n+3 = αd n+2 +βd n+1 + v u a k+1,k+1 + B u a k,k, d n+5 = αd n+4 +βd n+3 + va+b a k+1,k+1 + vb u u a k,k, d n+7 = αd n+6 +βd n+5 + va2 +vb +AB a k+1,k+1 + u vab +B2 a k,k. u u(d n+7 AD n+5 BD n+3 ) = ( (va 2 +vb +AB)+A(vA+B)+vB)a k+1,k+1 +( (vab +B 2 )+vab +B 2 )a k,k = Central elements The central elements of the bnomal trangles are the terms a 2k,k wth k 0. In ths subsecton we gve the relaton between them, moreover t turns out that the before mentoned recurrence relaton holds for all the columns (whch are parallel to the vertcal axs of the trangle). These sequences are defned by {a 2k+l,k } k=k 0 wth l Z and { 0, f l 0; k 0 = (29) l, f l < 0. Moreover, f l = 0, then t s the sequence of the central elements. Theorem 10. All the sequences {a 2k+l,k } k=k 0 of the bnomal nterpolated trangle wth l Z and k 0 defned by (29) satsfy the same bnary homogeneous recurrence relaton where c k = a 2k+l,k. Proof. We have to prove that c k+2 = (α 2 u+αv +2βu)c k+1 βbc k, (30) a 2(k+2)+l,k+2 = (α 2 u+αv +2βu)a 2(k+1)+l,k+1 β(u 2 β uvα v 2 )a 2k+l,k. (31) Frst, supposng that uα+v 0 and recallng (11) and (8) we obtan a 2k+3+l,k+1 = (uα+v)a 2k+2+l,k +uβa 2k+1+l,k = (uα+v)(αa 2k+1+l,k +βa 2k+l,k )+uβa 2k+1+l,k = (uα 2 +vα+uβ) a 2k+2+l,k+1 uβa 2k+l,k uα+v +(uα+v)βa 2k+l,k, 9
10 furthermore a 2k+4+l,k+2 = (uα+v)a 2k+3+l,k+1 +uβa 2k+2+l,k+1 = (uα 2 +vα+uβ)(a 2k+2+l,k+1 uβa 2k+l,k )+(uα+v) 2 βa 2k+l,k +uβa 2k+2+l,k+1 = (uα 2 +vα+2uβ)a 2k+2+l,k+1 +β( u 2 β +uvα+v 2 )a 2k+l,k. Second, when v = uα the equalty (30) becomes or explctly c k+2 = 2uβc k+1 u 2 β 2 c k, a 2(k+2)+l,k+2 = 2uβa 2(k+1)+l,k+1 u 2 β 2 ca 2k+l,k. (32) Thus, snce the sequence s a geometrc progresson we have a 2(k+2)+l,k+2 = uβa 2(k+1)+l,k+1 = u 2 β 2 a 2k+l,k, and clearly (32) holds because t corresponds to the dentty uβa 2(k+1)+l,k+1 = 2uβa 2(k+1)+l,k+1 uβa 2(k+1)+l,k Explct formula Theorem 11. Let D = α 2 +4β. If D 0, then the explct formula of a n,k s a n,k = (vd+αv 2βu)a n,0 +2βa n,1 2vD where x 1 = (α+d)/2, x 2 = (α D)/2 and a n,0 = (D α)a 0,0 +2a 1,0 2D a n,1 = (D α)a 0,0 +2a 1,0 x n 1 2D ( ) k βu vx2 + β If D = 0 and A 0, then the explct formula s a n,k = (vd αv +2βu)a n,0 2βa n,1 2vD ( ) k βu vx1, (33) x n 1 + (D+α)a 0,0 2a 1,0 x n 2D 2, (34) 1 (ux 1 +v)+ (D+α)a 0,0 2a 1,0 2D ( ( αan,1 )) ( ) k a n,0 +k A a A n,0, α 10 β x n 1 2 (ux 2 +v). (35)
11 where ( a n,0 = a 0,0 +n 2a ) 1,0 αa (α ) n 0,0 (36) α 2 ( a n,1 = ua n,0 +v a 0,0 +(n 1) 2a ) 1,0 αa (α ) 0,0 n 1. (37) α 2 If D = 0 and A = 0, then ( a n,0 = a 0,0 +n 2a ) 1,0 αa (α ) n 0,0 (38) α 2 a n,1 = u 2a 1,0 αa ( 0,0 α ) n. (39) α 2 and a n,k = 0, f k 2. Proof. We suppose that α 2 + 4β 0. Frstly, we gve the explct form of the elements n case of the man path (k = 0). As the recurson s bnary wth coeffcent α and β, then the characterstc equaton of (7) s x 2 αx β = 0 wth roots x 1 x 2. Consequently, for all n 0 the term a n,0 s a lnear combnaton of the powers x n 1, x n 2. In order to determne the coeffcents of ths lnear combnaton, we need to solve the system of equatons px 1 +qx 2 = a,0, = 0,1. From ths system we fnd p = a 1,0 a 0,0 x 2 x 1 x 2 and q = a 1,0x 1 a 1,0. Thus observng that x 1 = a+d 2,x 2 = a D,x 1 x 2 = D, 2 x 1 x 2 where D = α 2 +4β, we easly fnd equalty (34). Moreover a n,1 = ua n,0 + va n 1,0 yelds (35). Secondly, we gve smlarly the explct formula of the sequence {a n,k } n k=0 wth ntal condtons a n,0 and a n,1. Because of (14), ts characterstc equaton s and the roots are 2βu αv +vd y 1 = 2β y 2 2βu αv y αuv βu2 +v 2 β β = u+ v(d α) 2β = βu vx 2 β = 0 and y 2 = βu vx 1. β When we consder the case D 2 = α 2 +4β = 0 and A 0 (or, equvalently, β = α 2 /4 and v = uα/2) we use the same method adopted before. Takng n account that the characterstc equaton x 2 αx β = 0 has the unque root x 0 = α/2, we have to solve the system (p+q)x 0 = a,0, = 0,1, whch provdes the coeffcents p, q for a n,0 = (p+qn)x n 0 n equalty (36). In ths case the characterstc equaton of sequence {a k n} n k=0 also has just one root y 0 = A/α 0 and the equatons ( p+ q)y 0 = a n, = 0,1 and k yeld the fnal formula. Fnally, we examne the case D 2 = α 2 +4β = 0 and A = 0. Now the equvalent condtons β = α 2 /4 and v = uα/2 mply that B = 0 and the equalty (37) s smplfed nto (39). Moreover f k 2, then the relaton (14) becomes a n,k = 0a n,k 1 +0a n,k 2 = 0. 11
12 4 Specal types of bnary bnomal nterpolated trangles The classcal Pascal trangle has vertcal symmetry and ts nner elements satsfy the wellknown rule of addton, namely every elements s the sum of the two terms drectly above t. In ths secton we gve the classes of our trangles whch have the same propertes, and we answer the queston, Is Pascal s trangle a bnomal nterpolated trangle? A bnomal nterpolated trangle s (vertcally) symmetrcal f a n,k = a n,n k (0 k n). Theorem 12. Let a 0,0 0 and a 1,0 be gven. A bnary bnomal nterpolated trangle s symmetrcal f and only f or where u 1 or u = 1, v = α = 2a 1,0 a 0,0 α = 2a 1,0, β = α2 a 0,0 4, v = α(u 1), 2 u = 1, v = α = 2a 1,0 a 0,0, β = α2 4. (See [1] for the bnomal transform n a specal case). Proof. Indeed clearly the condton a n,k = a n,n k mples the followng system of equatons α = A = uα+2v β = B = u 2 β uvα v 2. b 1 = a 1,0 = ua 1,0 +va 0,0 From the frst equaton we fnd v = α(u 1)/2 and substtutng n the second equaton we obtan, wth some calculatons, (α 2 +4β)(u+1)(u 1) = 0. Now, we have the three possbltes α 2 + 4β = 0, u = 1, u = 1. Obvously the case u = 1 mples v = 0, a contradcton. The case u = 1 gves v = α and α = 2a 1,0 /a 0,0. Consderng the case α 2 +4β = 0 we obtan the second part of the statement of the theorem. Fnally, the equaltes α 2 +4β = 0 and u = 1 yeld the thrd last case. Corollary 13. Let λ = a 1,0 /a 0,0 and a 0,0 0, u 1. Then the form of a symmetrcal bnomal nterpolated trangle can be wrtten by BIT (a 0,λa 0,2λ,β; 1,2λ), (40) 12
13 or BIT (a 0,λa 0,2λ, λ 2 ;u,λ(1 u)), (41) BIT (a 0,λa 0,2λ, λ 2 ; 1,2λ). (42) Fgure 4 shows a symmetrcal bnomal nterpolated trangle, namely BIT (2, 1, 1, 1; 1, 1) generated by Lucas numbers (A n [6]) Fgure 4: Symmetrcal bnomal nterpolated trangle BIT (2, 1, 1, 1; 1, 1) Remark 14. Accordng to (23) the recurson of s n the symmetrcal bnomal nterpolated trangles case s s n = 2λs n 1 +βs n 2 or s n = 2λs n 1 λ 2 s n 2. Moreover, when we consder the trangle (42) for the sequence d we obtan d n = λd n 1 +λd n 2 λ 2 d n 3. Theorem 15. Pascal s trangle s not a bnomal nterpolated trangle. Proof. The sum of above terms condton and relaton (9) should mply aβ/v = B/v = 1 and the vertcal symmetry mples β = B. Thus we fnd u = 1 and v = β. Now the frst set of solutons comng from Theorem 12 gves v = β = α = 2, snce n Pascal s trangle we have a 0,0 = a 1,0 = 1. The recurrence (7) becomes a n,0 = 2a n 1,0 2a n 2,0 whch s clearly not satsfed n Pascal s trangle by the frst elements (all equal to 1) of any row. From the second set of solutons we fnd α = 2, β = 1, v = 1 u, but, snce u = 1, from these solutons we must have v = 2 and on the other hand snce v = β = 1 we fnd a contradcton. Now we gve the condtons of u and v, so that an nner entry of BIT could be the sum of values not only left but also drectly above t by coeffcents u and v. Usng (9), we can gan t n two dfferent ways (see Fgure 5). Our cases are case 1: u = uβ v, v = B v, case 2: v = uβ v, u = B v. 13
14 a n 1,k 1 v a n,k a n 1,k u a n 1,k 1 a n 1,k u v a n,k Fgure 5: Coeffcents of summng downwards a Case 1 a 1 βa 0 +αa 1 βa 0 +αa 1 αβa 0 + (α 2 +β)a 1 (α 2 β +β 2 )a 0 + (α 3 +2αβ)a 1 αβa 0 + (α 2 +β)a 1 (α 2 β +β 2 )a 0 + (α 3 +2αβ)a 1 (α 3 β +2αβ 2 )a 0 + (α 4 +3α 2 β +β 2 )a 1 (α 4 β +3α 2 β 2 +β 3 )a 0 + (α 5 +4α 3 β +3αβ 2 )a 1 Fgure 6: BIT (a 0,a 1,α,β;α,β) Solvng the system { u = uβ v v = B v we can easly obtan that u = α and v = β, thus the trangle s, BIT (a 0,a 1,α,β;α,β). (43) We derve some nterestng propertes of ths trangle. From Fgure 6, whch shows the frst four rows of trangle BIT (a 0,a 1,α,β;α,β) (see also Fgure 7), we notce that the rows and the left dagonal satsfy the same recurrence. Indeed, usng the equaltes u = α, v = β, the recurrence relaton (14) becomes a n,k = αa n,k 1 + βa n,k 2. Moreover, the terms along the rsng dagonals are the same. The next theorem and corollary wll provde t precsely. β a n+1,k 1 a n,k 1 a n 1,k 1 α β a n,k α β α a n 1,k α a n,k+1 Fgure 7: Coeffcents of summng n case 1 14
15 Theorem 16. The entres n trangle BIT (a 0,a 1,α,β;α,β) can be wrtten (n 1) by a n,k = a 0 n+k 2 2 ( n+k 2 ) α n+k 2 2 β +1 +a 1 n+k 1 2 ( n+k 1 ) α n+k 2 1 β. Proof. We consder the results of Theorem 11. Indeed, usng the equaltes u = α, v = β and x 1 +x 2 = α, αx 1 +β = x 2 1, αx 2 +β = x 2 2, D +α = 2x 1, D α = 2x 2 the equatons (33) (35) become a n,k = a n,0x 2 +a n,1 D where D = α 2 +4β = x 1 x 2 0 and a n,0 = a 0x 2 +a 1 D a n,1 = a 0x 2 +a 1 x n+1 D A lttle calculaton shows that ( x n+k 1 2 a n,k = a 0 β x 1 x 2 Usng the Grard-Warng formula [4] 1 x n+k 1 x k 1 + a n,0x 1 a n,1 x k D 2, x n 1 + a 0x 1 a 1 x n D 2, 1 + a 0x 1 a 1 D )+a 1 ( x n+k x n x2 n+k x 1 x 2 X N+1 Y N+1 N 2 ( ) N = ( 1) (X +Y) N 2 (XY), X Y ). (44) where, n our case, X = x 1, Y = x 2, X + Y = α, XY = β and N = n + k 2 or N = n+k 1, the thess follows. The Grard-Warng formula also holds n the case x 1 = x 2,.e., D = 0, takng the lmt x 1 x 2 on both members. We menton that D = 0 mples A 0. Corollary 17. In case of the trangle BIT (a 0,a 1,α,β;α,β) the rsng dagonal sequence {a n k,k } n 2 k=0 s a constant sequence for any k. Proof. We apply the formula proved n Theorem 16 to a n k,k and obtan an expresson that does not depend on the ndex k. Fgure 8 shows BIT (a 0,a 1,1,1;1,1) as an example for case 1. Usng the result of Theorem 16, n the case α = 1 and β = 1, the bnomal coeffcents are the coeffcents of the elementsnthersngdagonals. Thusa n,k = a 0 f n+k 1 +a 1 f n+k, wheref n sthen th Fbonacc number (A000045), so that, f 0 = 0,f 1 = f 1 = 1. (We also fnd from the above relaton (44) the connecton wth Fbonacc numbers.) The specal Fbonacc bnomal nterpolated trangle s BIT (1,1,1,1;1,1) (A199512). Falcon and Plaza [3] provded an other example n Table 4 for ths case, namely BIT (0,1,3,1;3,1), whch s generated by the 3-Fbonacc sequence (A006190). 15
16 a Case 2 a 1 p+a 1 a 0 +a 1 a 0 +2a 1 2a 0 +3a 1 a 0 +2a 1 2a 0 +3a 1 3a 0 +5a 1 5a 0 +8a 1 2a 0 +3a 1 3a 0 +5a 1 5a 0 +8a 1 8a 0 +13a 1 13a 0 +21a 1 From the equatons system we obtan Fgure 8: BIT (a 0,a 1,1,1;1,1) v 1 = α 1+ (α 1) 2 +4β, u 1 = v2 1 2 β, v 2 = α 1 (α 1) 2 +4β, u 2 = v2 2 2 β. If (α 1) 2 +4β = 0,.e., β = (1/4)(α 1) 2, then, replacng the correspondng values for u and v, after smplfcaton we have BIT (a 0,a 1,α, (α 1)2 ; 1, α 1 ). (45) 4 2 If (α 1) 2 +4β 0, then the trangles are BIT (a 0,a 1,α,β;u 1,v 1 ), (46) BIT (a 0,a 1,α,β;u 2,v 2 ). (47) Fnally, we compare the trangles (43) (47) wth the symmetrcal ones (40) (42). In all the cases for the symmetrcal bnary nterpolated bnomal trangle wth some calculatons we gan the followng corollary. Corollary 18. The symmetrcal bnary nterpolated bnomal trangles whose an nner entry could be the sum of values not only left but also drectly above t by coeffcents u and v are whch has only terms a 0 and ±a 0 /2 and whch has only terms a 0. BIT (a 0, a 0 2, 1, 1; 1, 1), BIT (a 0,a 0,2, 1;2, 1), 16
17 Remark 19. When both parameters a 0,0, a 1,0 are zero we fnd the trval trangle exclusvely composed of null entres. The trangle wth all entres equal to 1 correspond to more bnomal nterpolated trangles, for example, BIT (1,1,2, 1; 1,2) or BIT (1,1,2, 1; 1,2). The trangle whose left dagonal and rows are the sequences of natural numbers (A000027) s BIT (1,2,2, 1;2, 1) (A094727). 5 Acknowledgment The author would lke to thank the anonymous referee for carefully readng the manuscrpt and for hs/her useful suggestons and mprovements. References [1] S. Barbero, U. Cerrut and N. Murru, A generalzaton of the bnomal nterpolated operator and ts acton on lnear recurrent sequences, J. Integer Sequences 13 (2010), Artcle [2] P. Bhadoura, D. Jhala and B. Sngh, Bnomal transforms of the k-lucas sequences and ts propertes, J. Math. Computer Sc. 8 (2014), [3] S. Falcon and A. Plaza, Bnomal transform of k-fbonacc sequence, Int. J. Nonln. Sc. Num. 10 (2009), [4] H. W. Gould, The Grard-Warng power sum formulas for symmetrc functons and Fbonacc sequences, Fbonacc Quart. 37 (1999) [5] J. Pan, Some propertes of the multple bnomal transform and the Hankel transform of shfted sequences, J. Integer Sequences 14 (2011), Artcle [6] N. J. A. Sloane, The On-Lne Encyclopeda of Integer Sequences, [7] M. Z. Spvey and L. L. Stel, The k-bnomal transforms and the Hankel transform, J. Integer Sequences 9 (2006), Artcle [8] Wolfram Math World, Pascal s trangle, Mathematcs Subject Classfcaton: Prmary 11B37; Secondary 11B39, 11B65, 11B75. Keywords: bnomal operator, bnomal transform, bnomal nterpolated transform, recurrence sequence. 17
18 (Concerned wth sequences A000027, A000032, A000045, A006190, A094727, and A ) Receved Aprl ; revsed verson receved July Publshed n Journal of Integer Sequences, July Return to Journal of Integer Sequences home page. 18
Binomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationHyper-Sums of Powers of Integers and the Akiyama-Tanigawa Matrix
6 Journal of Integer Sequences, Vol 8 (00), Artcle 0 Hyper-Sums of Powers of Integers and the Ayama-Tangawa Matrx Yoshnar Inaba Toba Senor Hgh School Nshujo, Mnam-u Kyoto 60-89 Japan nava@yoto-benejp Abstract
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationPower sums in hyperbolic Pascal triangles
Power sums n hyperbolc Pascal trangles László Németh, László Szalay arxv:170304938v1 [mathco] 15 Mar 2017 Abstract In ths paper, we descrbe a method to determne the power sum of the elements of the rows
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationA summation on Bernoulli numbers
Journal of Number Theory 111 (005 37 391 www.elsever.com/locate/jnt A summaton on Bernoull numbers Kwang-Wu Chen Department of Mathematcs and Computer Scence Educaton, Tape Muncpal Teachers College, No.
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationCOMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A 2 2 MATRIX
COMBINATORIAL IDENTITIES DERIVING FROM THE n-th POWER OF A MATRIX J Mc Laughln 1 Mathematcs Department Trnty College 300 Summt Street, Hartford, CT 06106-3100 amesmclaughln@trncolledu Receved:, Accepted:,
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
More informationh-analogue of Fibonacci Numbers
h-analogue of Fbonacc Numbers arxv:090.0038v [math-ph 30 Sep 009 H.B. Benaoum Prnce Mohammad Unversty, Al-Khobar 395, Saud Araba Abstract In ths paper, we ntroduce the h-analogue of Fbonacc numbers for
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationON A DIOPHANTINE EQUATION ON TRIANGULAR NUMBERS
Mskolc Mathematcal Notes HU e-issn 787-43 Vol. 8 (7), No., pp. 779 786 DOI:.854/MMN.7.536 ON A DIOPHANTINE EUATION ON TRIANGULAR NUMBERS ABDELKADER HAMTAT AND DJILALI BEHLOUL Receved 6 February, 5 Abstract.
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationSome congruences related to harmonic numbers and the terms of the second order sequences
Mathematca Moravca Vol. 0: 06, 3 37 Some congruences related to harmonc numbers the terms of the second order sequences Neşe Ömür Sbel Koaral Abstract. In ths aer, wth hels of some combnatoral denttes,
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationThe KMO Method for Solving Non-homogenous, m th Order Differential Equations
The KMO Method for Solvng Non-homogenous, m th Order Dfferental Equatons Davd Krohn Danel Marño-Johnson John Paul Ouyang March 14, 2013 Abstract Ths paper shows a smple tabular procedure for fndng the
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationarxiv: v2 [math.ca] 24 Sep 2010
A Note on the Weghted Harmonc-Geometrc-Arthmetc Means Inequaltes arxv:0900948v2 [mathca] 24 Sep 200 Gérard Maze, Urs Wagner e-mal: {gmaze,uwagner}@mathuzhch Mathematcs Insttute Unversty of Zürch Wnterthurerstr
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LIX, 013, f.1 DOI: 10.478/v10157-01-00-y ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION BY ION
More informationPHYS 705: Classical Mechanics. Canonical Transformation II
1 PHYS 705: Classcal Mechancs Canoncal Transformaton II Example: Harmonc Oscllator f ( x) x m 0 x U( x) x mx x LT U m Defne or L p p mx x x m mx x H px L px p m p x m m H p 1 x m p m 1 m H x p m x m m
More informationThe exponential map of GL(N)
The exponental map of GLN arxv:hep-th/9604049v 9 Apr 996 Alexander Laufer Department of physcs Unversty of Konstanz P.O. 5560 M 678 78434 KONSTANZ Aprl 9, 996 Abstract A fnte expanson of the exponental
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationSELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:
SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be
More informationCombinatorial Identities for Incomplete Tribonacci Polynomials
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015, pp. 40 49 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM Combnatoral Identtes for Incomplete
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationOn the symmetric character of the thermal conductivity tensor
On the symmetrc character of the thermal conductvty tensor Al R. Hadjesfandar Department of Mechancal and Aerospace Engneerng Unversty at Buffalo, State Unversty of New York Buffalo, NY 146 USA ah@buffalo.edu
More informationErratum: A Generalized Path Integral Control Approach to Reinforcement Learning
Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationEvaluation of a family of binomial determinants
Electronc Journal of Lnear Algebra Volume 30 Volume 30 2015 Artcle 22 2015 Evaluaton of a famly of bnomal determnants Charles Helou Pennsylvana State Unversty, cxh22@psuedu James A Sellers Pennsylvana
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationFundamental loop-current method using virtual voltage sources technique for special cases
Fundamental loop-current method usng vrtual voltage sources technque for specal cases George E. Chatzaraks, 1 Marna D. Tortorel 1 and Anastasos D. Tzolas 1 Electrcal and Electroncs Engneerng Departments,
More informationCausal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim
Causal Damonds M. Aghl, L. Bombell, B. Plgrm Introducton The correcton to volume of a causal nterval due to curvature of spacetme has been done by Myrhem [] and recently by Gbbons & Solodukhn [] and later
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationCALCULUS CLASSROOM CAPSULES
CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules
More informationPRIMES 2015 reading project: Problem set #3
PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationAGC Introduction
. Introducton AGC 3 The prmary controller response to a load/generaton mbalance results n generaton adjustment so as to mantan load/generaton balance. However, due to droop, t also results n a non-zero
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More information