with an even sum and for k 1mod4 1, 2,, n with an odd sum. ,, n of Pascal s triangle count the subsets of 1, 2,, n
|
|
- Simon Newton
- 6 years ago
- Views:
Transcription
1 Some remars o Rogers-Szegö olyomials ad Losaitsch s triagle Joha Cigler Faultät für Mathemati Uiversität Wie johacigler@uivieacat Abstract I this exository aer we collect some simle facts about aalogues of Pascal s triagle where the etries cout subsets of the itegers with a eve or odd sum ad show that they are related to q Newto ad Rogers-Szegö olyomials I articular we cosider a iterestig triagle due to Losaitsch from this oit of view We also setch some extesios of these results to sets whose sums have fixed residues modulo a rime 1 Itroductio This exository aer has bee isired by a Pascal-lie triagle which has bee obtaied by the chemist S Losaitsch (Sima Lozaic) [6] Some of its roerties ca be foud i [1] ad [7] A We show that the elemets L( ) of Losaitsch s triagle have several iterestig iterretatios: a) For 1mod4 L( ) is the umber of subsets of 1 with a eve sum ad for 1mod4 1 with a odd sum b) Let the umber of subsets of W be the set of all tules w with ad i i1 The L( ) is the umber of those tules which have a eve umber of iversios c) For w W let w 1 1 be the reversal of w The L( ) also couts the set of all equivalece classes ww d) Let be a q biomial coefficiet The L ( ) L ( ) q modq 1 For helful remars I wat to tha J Schoissegeier ad V Losert 11 As is well ow the etries of Pascal s triagle cout the subsets of 1 with elemets which will be called sets for short A set S will be called eve if the sum ( S) of its elemets is eve ad odd if this sum is odd By covetio the emty set is eve i
2 E be the set of all eve subsets of 1 Let elemets ad let umber of its elemets For examle (53) 6 O be the set of all odd subsets of 1 ad e ( ) E the umber of its ad o ( ) O the e because E 53 {13}{15}{134}{145}{35}{345} Let us ote the trivial fact e ( ) o ( ) (11) Lemma 11 e ( ) e ( ) o ( ) 1 o ( ) o ( ) e ( ) 1 (1) This is a refiemet of the formula 1 Proof Let S be a subset of 1 To rove (1) cosider 3 ossibilities: a) S 1 b) S cotais recisely oe of the umbers 1 ad The remaiig ( 1) set ca be a arbitrary subset of 1 because oe of these umbers is eve ad the other oe is odd There are such subsets 1 c) S cotais both 1 ad Sice ( 1) is odd the remaiig ( ) subset must have the oosite arity of the give subset 1 To each set S we associate its idicator fuctio c S defied by cs () i 1if i S ad cs () i 0else or equivaletly the tule ws ( ) 1 with i cs() i Let W be the set of all tules w with 01 1 let iv( w) 1 i j : i 1 j 0 ad i i For each w be the umber of iversios of w We call a tule eve if iv( w ) is eve ad odd else i1
3 For examle there are 4 eve ad odd quadrules with iv iv iv 0110 iv 1001 because iv iv Istead of W we could also cosider the set of all roducts w CC 1 C of elemets A ad elemets B which satisfy BA qab A iversio is the a air iv(w) C C ( B A) with i j which gives CC C q A B i j Let us associate to each S i1 i i S 1 i 1 i 1 i 1 with 1 i1 i i the set 1 1 Lemma 1 For each set S 1 Proof 1 ( ) iv we have S ws This holds for 1 ad all because iv ws i 1 11 Thus i i1 S i imlies S 1 i Let us assume that it is true for 1 ad all ad cosider a set S It is trivially true for Let us suose that it is true for 1 Let S 0 be the restrictio of S to {1 1} S c ( ) S 1 1 If S ad ( S ) i ad the If S the ( S) ( S0) ivws0 iv ws If S the 1 1 ( S) S0 iv ws0 iv w S0 iv w S because there are w S elemets 0 i 0 We will ow cosider matrices whose colums are either e or o where e is the colum with etries e ( ) ad o the colum with etries o ( ) for 3
4 Sets with a eve sum 1 Let us first cosider the matrix e ( ) e0 e1 e e3 whose etries are the umber of eve sets (cf OEIS [7] A8011) The first terms are Closely related is the matrix ( ) sets (cf OEIS [7] A ) o o o o o whose etries are the umber of odd Sice i both triagles the colums c ad c have the same arity by Lemma 11 the etries a ( ) of these matrices satisfy a ( ) a ( ) a ( ) ad thus 1 1 a ( ) a ( ) a ( ) (1) 1 Therefore the olyomials a ( x) a( ) x satisfy the recursio 0 a ( x) 1 x a ( x) x(1 x) () 1 By alyig this to ad 1 we get the homogeeous recursio a ( x) (1 x) a ( x) 1 x a ( x) (1 x) 1 x a ( x) (3) 1 3 Sice z 3 (1 x) z 1 x z(1 x) 1 x z(1 x) z 1 x z 1 x we see that a ( x) c0(1 x) c1 1x c 1 x for some coefficiets c i Let ow e ( x) e( ) x ad 0 o ( x) o( ) x 0 4
5 From the iitial values e0( x) 1 e1( x) 1 e( x) 1 x we comute 1 1x 1x 1x 1x c0 c1 c 4 1x 4 1x This gives e (1 x) 1x ( x) (1 x) (1 x) 1 x e 1( x) ad aalogous formulae for o ( x ) 1 (4) From (4) we see that e ( x ) is alidromic ie 1 x e e( x) x if 03mod 4 The geeratig fuctios are 1xz 1x z (1 x) z ad 1 (1 ) 1 1 e ( x) z 0 xz x z (5) 1 (1 ) 11 xz x z xz o ( x) z 0 xz x z (6) 1 (1 ) (1 x) z 1 (1 ) 11 xz x z From (5) we coclude that the geeratig fuctio of 1 e( x) e( ) x x e 0 x is 1 (1 ) 1 1 1z x 1 z ( x 1) z e ( x) z 0 xz x z (7) 1 (1 ) 1 1 xz x z It is ow easy to derive some exlicit formulae From (4) we see that (1 x) (1 x) j e ( x) (1 x) (1 x) x (8) j j 5
6 This imlies 1 e ( ) (9) j j j As secial case we get the well-ow formula e( ) (10) If we write (5) i the form zxz exz ( ) 0 1 z xz 1 1z x z 1 1 z 1z we see by comarig coefficiets of x that z 1 ( 1) (1 z) (1 ) 1 z e ( ) z (11) z z 1 ( 1) (1 ) 1 z 1 1 e ( 1) z (1) 1 0 z Remar It is erhas iterestig that these geeratig fuctios ca also be writte i the followig way: x e4 ( x) 4 41 e ( 4 x ) (1 x) (1 x) 4 1 x o4 1( x) 41 4 e ( 41) x (1 x) (1 x) 4 x o4 ( x) 4 43 e ( 4) x (1 x) (1 x) 4 3 x e4 3( x) e ( 43) x (1 x) (1 x) (13) 6
7 3 Losaitsch s triagle 31 Let us ow cosider aother class of triagles where the colums c ad c have oosite arity By Lemma 11 the etries of these matrices satisfy b ( ) b ( ) b ( ) 1 (31) Therefore the olyomials b( x) bx ( ) satisfy the recursio 0 b ( x) 1 x b ( x) x(1 x) (3) By alyig this to ad 1 we get b ( x) (1 x) b ( x) 1 x b ( x) (1 x) 1 x b ( x) (33) 1 3 The best ow secial case of a matrix satisfyig (31) is Losaitsch s triagle L ( ) (cf [1] [7] A034851) which is defied by the recursio L ( ) L ( ) L ( ) 1 with iitial values L(0 ) [ 0] ad L(1 ) [ 1] ad L ( ) 0 for 0 (34) The first terms are This matrix has bee obtaied by the chemist SM Losaitsch (or Lozaic) [6] i his ivestigatio of araffi Therefore we call the umbers L ( ) Losaitsch umbers The same triagle has also bee cosidered i [1] i the study of some sort of eclaces where these umbers have bee called eclace umbers Further iformatio ca be foud i OEIS [7] A Let us first observe that L e o o e e o ( ) (35) For the right-had side satisfies (34) with the same iitial ad boudary values as Losaitsch s triagle 7
8 By (4) we see that e ( ) 1 if 03mod 4 ad o ( ) 1 if 1 mod 4 Therefore we get Proositio 31 Losaitsch s triagle is the uiquely determied matrix where for each the th colum is either e or o ad all elemets of the mai diagoal are 1 Let us give aother characterizatio of Losaitsch s triagle which aears as secial case i [5] Theorem 3 (Stehe G Harte ad AJ Radcliffe) The Losaitsch umber L ( ) is the umber of all tules L W with a eve umber of iversios Proof from all subsets of {1 } to W is 1 a bijectio betwee the sets for which ( S) mod ad L 1 For 1mod4 we have 0mod ad therefore L e( ) ad for 1 1 mod 4 we have 1mod ad therefore L o ( ) Thus L L( ) By Lemma 1 we see that the ma S ws 3 The oosite matrix L ( ) o e e o o e also A The first terms are is OEIS [7] A03485 ad essetially The Losaitsch olyomials recursio (33) L ( x) L( ) x ad 0 L ( x) L( ) x satisfy the 0 I the same way as above we see that 8
9 (1 x) 1x 1x 1x 1x L ( x) 1x 1 x 4 1x 4 1x This ca be simlified to L L (1 x) 1x ( x) 1 1 (1 x) (1 x) 1x ( x) (36) Note that ad or L 1( x) (1 x) L( x) (37) 1 x L L( x) x (38) L ( ) L ( ) (39) Thus we get (cf [1] Theorem 8) by observig (11) 1 L( 1) L( 1) L ( ) ad L ( ) else (310) I the same way as above we get the geeratig fuctio 1 (1 ) xx z (1 x) z L ( x) z 0 xz x z (311) 1 (1 ) 11 xz x z Some other roerties of the Losaitsch olyomials ca be foud i [1] Comarig with (13) we get Proositio 33 xe( x) Lx ( ) L ( x ) 1 (1 x) (1 x) (31) 9
10 There exists also aother iterestig relatio betwee the umbers e ( ) ad L ( ) Proositio 34 Proof z e ( z ) L ( z) (1 z) 1z (313) It suffices to comute the coefficiet of x i (7) This gives 1 1 (1 ) 1 z z (1 z) z z z e ( z ) (1 ) z 1 z (1 z) 1 z z L 1 ( z) 1 (1 z) 1z ad (1 ) 1 (1 ) 1 z z z z z z e ( 1) z (1 ) z 1 z (1 z) 1 z 1 z L 1 3( z) 3 (1 z) 1z 33 Let us ow derive aother iterestig combiatorial iterretatio of the Losaitsch umbers For w1 W let w 1 be the reversal of w Defie a equivalece relatio o W by w w If w w we call w alidromic Theorem 35 ww ad let P be the subset of all alidromic classes Let r ( ) R ad ( ) P deote the umber of their elemets The r ( ) L ( ) ( ) L ( ) L ( ) R be the set of all equivalece classes Let (314) 10
11 Proof By (310) we have L ( 1) L ( 1) 0 ad L ( ) L ( ) else For ( ) we get the same result: ( ) because each alidromic set is uiquely determied by its restrictio to 1 ad each subset of 1 has a uique extesio to a alidromic set of 1 It is clear that ( 1) 0 (11) alidromic set of 1 1 Thus ( ) L ( ) L ( ) Sice there are 1 ( ) because each subset of 1 1 has a uique extesio to a o-alidromic classes i W we get 1 1 r ( ) ( ) ( ) ( ) L ( ) Therefore 1 L( ) ( ) is the umber of o-alidromic equivalece classes Examle For examle W 5 has 6 equivalece classes Thus L(5 ) 6 ad L(5) 4 ad (5) L(5] L(5) Remar Some secial cases of Theorem 35 are metioed i OEIS A0060 A A ad A i the followig formulatio: Let B( ) be the umber of bracelets ie eclaces allowig turig over with white 1 blue ad red beads the B( ) L ( ) To verify this it suffices to choose a reresetative of the bracelet whose first term is the blue bead If we relace the first 1 letters 1 by 10 we see that Theorem 35 imlies [1]Theorem 4 11
12 4 Rogers-Szegö olyomials ad Losaitsch s triagle 41 There are close coectios with some q biomial theorems For the relevat facts about q calculus I refer to [] Let be a q biomial coefficiet It turs out that both e ( ) ad L( ) are residues modulo q q 1 of q biomial coefficiets Theorem 41 1 e ( ) oq ( ) q mod q 1 L ( ) Lq ( ) modq 1 (41) Proof Recall that 1 j 1 qxq x j1 0 (4) j1 j j Sice 1 qx j q x e ( ) oq ( ) x modq 1 j1 we get the first lie of (41) j1 j Now observe that mod ad mod Therefore 1 mod q 1q modq 1 e ( ) oq ( ) ad 1 mod q 1qq mod q 1 o ( ) qe ( ) Comarig with (35) we get the secod lie of (41) for 03mod 4 for 1mod 4 1
13 Corollary 4 The Losaitsch olyomials are related to the Rogers-Szegö olyomials by ( ) ( ) ( )mod 1 r ( x q) 0 x L x ql x r x q q (43) ad the olyomials e ( x ) are related to the q Newto olyomials 1 j ( x q) 1q x q x j1 0 by e( x) qo( x) ( x q)mod q 1 (44) From (43) it is obvious that L ( x ) is alidromic We already ow that e ( x ) is alidromic if 03mod 4 This ca also be deduced from (41) For For 3mod4 this follows from 0mod4 we have 44 1 mod 41 mod This imlies that q q o(4 ) qe(4 )modq 1 4 we have e(4 ) o(4 ) e ( x) o ( x) 1 x sice by (4) if 1mod But i this case 4 Several theorems about q biomial coefficiets give results for Losaitsch umbers or for the umbers of eve or odd sets if we relace the olyomials e ( x ) ad L ( x) by the equivalece classes ( x) e ( x) qo ( x) ad ( x) L ( x) ql ( x) modulo q 1 The first terms of the matrix e ( ) qo ( ) are 13
14 Let us ote that 1 (1 q) ( x) (1 q) 1x 1x mod q 1 (45) This holds for 0 ad 1 By iductio we get j (1 q) ( x) (1 q) 1q x 1 q x (1 q) ( x) 1 j1 1 1 x(1 q) 1 x 1 x (1 q) 1 x 1 x ad 1 j 1 (1 q) ( x) (1 q) 1q x 1 q x (1 q) ( x) 1 j1 1 qx q x x q x x x q x x q Here we have used that 1 qx(1 q) 1 qx q x (1 x)(1 q)modq 1 1 (1 ) 1 1 (1 )(1 ) 1 1 (1 ) 1 1 mod 1 The first terms of L ( ) ql ( ) are I this case we get 1 (1 q) ( x) (1 q) 1x mod q 1 ( x) (1 x) ( x) (46) The recurrece 1 1 r ( x q) ( x1) r ( x q) q 1 xr ( x q) (47) for the Rogers-Szegö olyomials (cf eg []) imlies 1( x) (1 x) ( x) ad 1 Sice 1 ( x) ( x 1) ( x) q 1 x ( x) 1 (1 q) q 1 (1 q) (1 q) mod q 1 we get 1 q ( x) ( x 1) 1 q ( x) 1 q x ( x) 1 ( x1) 1 q ( x) 1 q x ( x) 1q x 1 ( x) which imlies the first lie of (46) by iductio 14
15 Now it is well ow that q iv( w q ) (48) ww This follows for examle from the q biomial theorem AB A B 0 for q commutig variables BA qab (cf eg []) For if we write ( AB) C C with Ci A B we get iv( w) ( A B) A B q ww i1 i If we reduce (48) modulo q 1 we get agai Theorem 3 43 Sice each equivalece class modulo q 1 ( q1)( q 1) is also a equivalece class modulo q 1 ad modulo q 1 we see that L ( ) L ( ) ad L ( ) L ( ) q1 q1 Thus 1 L ( ) q1 q1 (49) By (310) we get the well-ow result 1 The first terms of the table q1 q1 0 q1 0 are else (410) 15
16 Remar If we comare (410) with Theorem 35 we see that the umber of alidromic tules i W coicides with ( ) (411) (47) imlies q1 1 1 r ( x 1) ( x1) r ( x 1) ( 1) 1 xr ( x 1) with iitial values r 0 ( x 1) 1 ad r( x 1) 1 x 1 This gives by iductio r x x 1 ( 1) 1 ( 1) (1 ) 1 r x x x (41) Of course this also follows from (36) I the geeral case we get from the defiig relatio Pascal matrix 1 1 q 1 of the q Proositio 43 The equivalece classes ( ) e ( ) qo ( ) satisfy ( ) q ( 1 ) ( 1 1) (413) with ( 0) 1for all ad (0 ) 0 for 0 ad the equivalece classes ( ) L ( ) ql ( ) satisfy ( ) q( 1 ) ( 1 1) (414) with ( 0) 1 for all ad (0 ) 0 for 0 Remar It is clear that ( ) ad ( ) are uiquely determied by these rules Thus we get a very simle aroach to the matrices L( ) ad e ( ) ad their roerties From ( ) q ( 1 ) q ( 1 1) ( ) ( 1) q( 1) ( ) ( ) q( ) 1 we get e ( ) e ( ) e ( ) 1 ad thus agai (1) I the same way we get (34) 16
17 Formula (414) imlies that L ( ) L ( 1 ) L ( 11) L ( 1) L ( 11) L ( 1 ) (415) This is obvious for the iterretatio of L( ) as the set of w W with a eve umber of iversios if we cosider the last etry of w 44 Let us give some more examles: a) The recurrece (47) imlies L 1( x) ql 1( x) ( x 1) L( x) ql( x) which agai gives (37) ad L( x) ql( x) ( x 1) L 1( x) ql 1( x) ( q 1) x L( x) ql( x) which imlies L x x L x xl x xl x x L x xl x x x ( ) ( 1) 1( ) ( ) ( ) ( 1) 1( ) ( ) (1 ) b) The well-ow idetity q q 0 1 q 0 imlies L ( ) ql ( ) q L ( 1) ql ( 1) L( ) ql( ) which gives L( ) L( ) L( 1) L( 1) L( ) (416) c) A more trasaret roof of (31) rus as follows: The well-ow idetity x x 0 imlies (1 x)(1 qx) 1q x (1 qx) 1 q x(1 x)(1 qx) 1 q x x (1 x) 1 q x 1 q x x x q x 0 If we reduce this idetity modulo q 1 we get (31) 4 j The same roof also gives agai (13) We have oly to observe the arity of 17
18 d) The q Fiboacci olyomials 1 1 ( 1) F ( s q) q s 0 satisfy F ( s q) F ( s q) q sf ( s q) (cf [3]) 3 1 For q 1 we get the Fiboacci olyomials Note that (1) F () s s 0 F gives the Fiboacci umbers For q 1 we get Therefore the olyomials F s F s ( 1) F ( s 1) F s sf s 1 1 (417) 1 ( sq) ( 1 s ) F( sq)modq 1 0 satisfy ( sq) ( sq) q s ( sq)mod q The first terms are 0111 s1 s sq1 s s sq1 s s s s q Let ow ( sq) f() s qf() s The We get 1 f() s L( 1 ) s (418) 0 f () s f () s sf () s 1 1 f () s f () s sf () s 1 This gives by iductio or by cosiderig (417) f f F () s F s () s 1 F 1() s F 1 s sf s () s (419) 18
19 For s 1 we get a aalogue of the Fiboacci umbers The first terms are f (1) f(1) L( 1 ) (40) 0 This sequece also occurs i OEIS[7] A1056 F F F 1F From (419) we get f(1) f 1(1) e) As is well ow the sequece 1 1 F ( 1) ( 1) is eriodic with 0 eriod 6 Cosider the q aalogue 1 1 f( ) ( 1) q 0 The first terms are Note that these are artial sums of Euler s etagoal umber series q q q q q q q q q As show i [4] it satisfies f( ) f( 1) q f( 3) q f( 4) Let ( ) f( )mod( q 1) The it is easy to verify that ( 1) ( ) with iitial values 0111 q q q 0 q q q1 1 1 Therefore we get Proositio 44 1 The sequece ( 1) e ( 1 ) is eriodic with eriod 1 with iitial values
20 5 A more geeral case 51 Let e ( j ) be the umber of subsets of 1 whose sums are cogruet to j modulo The 1 j j1 j j qxx q xe jq q j1 1 ( ) mod 1 j1j j j0 O the other had we ow that j1 1 j 1 qxq x 0 Therefore we get q Let ow 1 j e ( j ) q q modq 1 q (41) 1 1 j ( q ) e ( j q ) q modq 1 j0 (4) The equivalece classes ( q ) satisfy ( q ) q ( 1 q ) ( 1 1 q ) mod q 1 (43) with ( 0 q) 1for all ad (0 q) 0 for 0 q For examle the first terms of ( 3 q) are 0
21 5 Let us first derive a aalogue of (): Proositio 51 Let e ( j x ) e( j ) x For ad each j we get i e( j x ) 1 x e ( j x ) x 1 x i1 i (44) Proof To show this observe first that e ( j ) e ( 0 ) for all j with 0 j if 1 1 This imlies 1 e ( j ) for all j J Schoissegeier has show me a simle roof due to V Losert: Cosider the grou of itegers modulo ad let E( i ) be the set of all subsets S of whose sum of elemets is cogruet to i modulo Let S 1 be the the set of elemets s 1 with s S The ma S S 1 gives a bijectio from E( i ) to E( i ) Iteratig this ma we see that all sets E( i ) have the same size because the multiles of exhaust Now cosider the elemets i with 1 i The umber of sets whose sums are cogruet to j modulo which cotai oe of these umbers is e ( j ) Sice the sum of cosecutive umbers is divisible by the umber of sets which cotai all elemets 1 i is e ( j ) Let ow 1 1 For each ( ) subset of 1 there are recisely 1 subsets of 1 such hat their uio is jmod because cosecutive umbers cotai all residues modulo This gives This gives for 1 sets which are j mod 1 1 e( j ) e( j ) e( j ) 1 which imlies (44) 1
22 By alyig (44) to ad 1 we get the homogeeous recursio e( j x ) (1 x) e 1( j x ) 1 x e( j x ) (1 x) 1 x e 1( j x ) 0 (45) By summig over all j we get 1 1 (46) 1 1 ( q ) ( q ) 1 q q ( q ) For a rimitive th root of uity q (46) reduces to ( ) ( ) ( ) (47) 53 Let us ow derive a aalogue of (4) Let be a rimitive th root of uity The j1 1 j j 1 x x e( j ) Observe that j j j x x e j e x 0 j1 0 j0 1 ( ) ( 0 ) O the other had we have 1 1 j j x x x 1 (1 ) 1 0 j1 1 j1 Sice each roduct of 1 j x over cosecutive values of j equals 1 x we see that 1 i j 1 xbi ( x) 1x 1 j1 for some olyomial bi ( x ) of degree i Therefore the olyomial e ( ) ( 0 ) x e x satisfies e i i (1 x) bi ( x) 1x ( x ) (48)
23 This imlies 1 i ( ) 1 1 bi x z i0 e ( x ) z (49) 0 1 ( x1) z 11x z Observe that this also follows from (45) 54 We defie ow Losaitsch umbers L ( j ) by or equivaletly by j L ( j ) q modq 1 (430) q 1 j ( q ) L ( j q ) modq 1 j0 (431) q The equivalece classes ( q ) satisfy ( ) q q ( 1 q) ( 1 1 q) mod q 1 (43) with ( 0 q) 1for all ad (0 q) 0 for 0 For examle the first terms of ( 3) are The olyomials L ( x j) L( j ) x will be called Losaitsch olyomials 0 Note that all olyomials L ( x j ) are alidromic j Sice e ( j ) [ q] q modq 1 1 we see that 1 L ( j ) e j modq 1 Therefore each colum L ( j ) coicides with a colum ( ai for some i
24 Therefore we get Proositio 5 The matrix L ( 0 ) 0 ei ( for some i ad where each elemet of the mai diagoal is 1 0 From (431) ad (48) we coclude Theorem 53 is the uiquely determied matrix whose colums are L ( 0 ) is the umber of elemets w W such that iv( w ) is a multile of Refereces [1] Tewodros Amdeberha Mahir Bile Ca ad Victor H Moll Broe bracelets Molie series Paraffi wax ad a ellitic curve of coductor 48 SIAM J Discr Math 5 (011) [] Joha Cigler Elemetare q Idetitäte Sémiaire Lotharigie de Combiatoire B05a (1981) [3] Joha Cigler q Fiboacci olyomials Fiboacci Quarterly 41 (003) [4] Joha Cigler A ew class of q Fiboacci olyomials Electr J Comb 10 (003) R19 [5] Stehe G Harte ad AJ Radcliffe Sigatures of strigs AComb 17 (013) [6] SM Losaitsch Die Isomerie- Arte bei de Homologe der Paraffi-Reihe Chem Berichte 30 (1897) [7] OEIS htt://oeisorg/ 4
Abstract. 1. Introduction This note is a supplement to part I ([4]). Let. F x (1.1) x n (1.2) Then the moments L x are the Catalan numbers
Abstract Some elemetary observatios o Narayaa polyomials ad related topics II: -Narayaa polyomials Joha Cigler Faultät für Mathemati Uiversität Wie ohacigler@uivieacat We show that Catala umbers cetral
More informationHankel determinants of some polynomial sequences. Johann Cigler
Hael determiats of some polyomial sequeces Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We give simple ew proofs of some Catala Hael determiat evaluatios by Ömer Eğecioğlu
More informationSum of cubes: Old proofs suggest new q analogues
Sum of cubes: Old proofs suggest ew aalogues Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We show how old proofs of the sum of cubes suggest ew aalogues 1 Itroductio I
More informationq-lucas polynomials and associated Rogers-Ramanujan type identities
-Lucas polyomials associated Rogers-Ramauja type idetities Joha Cigler Faultät für Mathemati, Uiversität Wie johacigler@uivieacat Abstract We prove some properties of aalogues of the Fiboacci Lucas polyomials,
More informationSum of cubes: Old proofs suggest new q analogues
Sum of cubes: Old proofs suggest ew aalogues Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We prove a ew aalogue of Nicomachus s theorem about the sum of cubes ad some
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationSolutions to Problem Set 7
8.78 Solutios to Problem Set 7. If the umber is i S, we re doe sice it s relatively rime to everythig. So suose S. Break u the remaiig elemets ito airs {, }, {4, 5},..., {, + }. By the Pigeohole Pricile,
More informationYALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Crytograhy ad Comuter Security Notes 16 (rev. 1 Professor M. J. Fischer November 3, 2008 68 Legedre Symbol Lecture Notes 16 ( Let be a odd rime,
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More information0,1,1, 2,3,5,8,13, 21,
Catala umbers, Hael determiats ad Fiboacci polyomials Joha Cigler Faultät für Mathemati Uiversität Wie joha.cigler@uivie.ac.at Abstract I this (partly expository) paper we cosider some Hael determiats
More informationPERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z
PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized
More informationPROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).
PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio
More informationSimple proofs of Bressoud s and Schur s polynomial versions of the. Rogers-Ramanujan identities. Johann Cigler
Simple proofs of Bressoud s ad Schur s polyomial versios of the Rogers-Ramaua idetities Joha Cigler Faultät für Mathemati Uiversität Wie A-090 Wie, Nordbergstraße 5 Joha Cigler@uivieacat Abstract We give
More informationON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS
ON SUPERSINGULAR ELLIPTIC CURVES AND HYPERGEOMETRIC FUNCTIONS KEENAN MONKS Abstract The Legedre Family of ellitic curves has the remarkable roerty that both its eriods ad its suersigular locus have descritios
More informationFibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers
Fiboacci polyomials, geeralied Stirlig umbers, ad Beroulli, Geocchi ad taget umbers Joha Cigler oha.cigler@uivie.ac.at Abstract We study matrices hich trasform the sequece of Fiboacci or Lucas polyomials
More informationq-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time.
-Fiboacci polyoials ad -Catala ubers Joha Cigler The Fiboacci polyoials satisfy the recurrece F ( x s) = s x = () F ( x s) = xf ( x s) + sf ( x s) () with iitial values F ( x s ) = ad F( x s ) = These
More informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationOn Some Identities and Generating Functions for Mersenne Numbers and Polynomials
Turish Joural of Aalysis ad Number Theory, 8, Vol 6, No, 9-97 Available olie at htt://ubsscieubcom/tjat/6//5 Sciece ad Educatio Publishig DOI:69/tjat-6--5 O Some Idetities ad Geeratig Fuctios for Mersee
More informationFLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A58 FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS H. W. Gould Departmet of Mathematics, West Virgiia Uiversity, Morgatow, WV
More informationChapter 2. Finite Fields (Chapter 3 in the text)
Chater 2. Fiite Fields (Chater 3 i the tet 1. Grou Structures 2. Costructios of Fiite Fields GF(2 ad GF( 3. Basic Theory of Fiite Fields 4. The Miimal Polyomials 5. Trace Fuctios 6. Subfields 1. Grou Structures
More informationSome Hankel determinants with nice evaluations. Johann Cigler Talk at the occasion of Peter Paule s 60 th birthday
Some Hakel determiats with ice evaluatios Joha Cigler Talk at the occasio of Peter Paule s 6 th birthday Itroductio For each we cosider the Hakel determiat H ( a ) + = det. i j i, j= We are iterested i
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More informationMath 2112 Solutions Assignment 5
Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger
More informationVIETA-LIKE PRODUCTS OF NESTED RADICALS
VIETA-IKE PRODUCTS OF ESTED RADICAS Thomas J. Osler athematics Deartmet Rowa Uiversity Glassboro, J 0808 Osler@rowa.edu Itroductio The beautiful ifiite roduct of radicals () π due to Vieta [] i 9, is oe
More informationOn the distribution of coefficients of powers of positive polynomials
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 49 (2011), Pages 239 243 O the distributio of coefficiets of powers of positive polyomials László Major Istitute of Mathematics Tampere Uiversity of Techology
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationNotes on the prime number theorem
Notes o the rime umber theorem Keji Kozai May 2, 24 Statemet We begi with a defiitio. Defiitio.. We say that f(x) ad g(x) are asymtotic as x, writte f g, if lim x f(x) g(x) =. The rime umber theorem tells
More informationThe r-generalized Fibonacci Numbers and Polynomial Coefficients
It. J. Cotemp. Math. Scieces, Vol. 3, 2008, o. 24, 1157-1163 The r-geeralized Fiboacci Numbers ad Polyomial Coefficiets Matthias Schork Camillo-Sitte-Weg 25 60488 Frakfurt, Germay mschork@member.ams.org,
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationA GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca
Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity
More informationTHE TUTTE POLYNOMIAL OF A FINITE PROJECTIVE SPACE
THE TUTTE POLYNOMIAL OF A FINITE PROJECTIVE SPACE MICHAEL BARANY AND VICTOR REINER Abstract We comute a -exoetial geeratig fuctio collatig the Tutte olyomials for the family of matroids comig from fiite
More informationCourse : Algebraic Combinatorics
Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationLECTURE NOTES, 11/10/04
18.700 LECTURE NOTES, 11/10/04 Cotets 1. Direct sum decompositios 1 2. Geeralized eigespaces 3 3. The Chiese remaider theorem 5 4. Liear idepedece of geeralized eigespaces 8 1. Direct sum decompositios
More informationPRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION
PRIME RECIPROCALS AND PRIMES IN ARITHMETIC PROGRESSION DANIEL LITT Abstract. This aer is a exository accout of some (very elemetary) argumets o sums of rime recirocals; though the statemets i Proositios
More informationTHE INTEGRAL TEST AND ESTIMATES OF SUMS
THE INTEGRAL TEST AND ESTIMATES OF SUMS. Itroductio Determiig the exact sum of a series is i geeral ot a easy task. I the case of the geometric series ad the telescoig series it was ossible to fid a simle
More informationChapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:
Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationAN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.
AN ALMOST LINEAR RECURRENCE Doald E. Kuth Calif. Istitute of Techology, Pasadea, Calif. form A geeral liear recurrece with costat coefficiets has the U 0 = a l* U l = a 2 " ' " U r - l = a r ; u = b, u,
More informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationA Note on Bilharz s Example Regarding Nonexistence of Natural Density
Iteratioal Mathematical Forum, Vol. 7, 0, o. 38, 877-884 A Note o Bilharz s Examle Regardig Noexistece of Natural Desity Cherg-tiao Perg Deartmet of Mathematics Norfolk State Uiversity 700 Park Aveue,
More informationUSA Mathematical Talent Search Round 3 Solutions Year 27 Academic Year
/3/27. Fill i each space of the grid with either a or a so that all sixtee strigs of four cosecutive umbers across ad dow are distict. You do ot eed to prove that your aswer is the oly oe possible; you
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationGENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California
GENERALIZATIONS OF ZECKENDORFS THEOREM TilVIOTHY J. KELLER Studet, Harvey Mudd College, Claremot, Califoria 91711 The Fiboacci umbers F are defied by the recurrece relatio Fi = F 2 = 1, F = F - + F 0 (
More informationAlmost all hyperharmonic numbers are not integers
Joural of Number Theory 7 (207) 495 526 Cotets lists available at ScieceDirect Joural of Number Theory www.elsevier.com/locate/jt Almost all hyerharmoic umbers are ot itegers Haydar Göral a, Doğa Ca Sertbaş
More informationq-chebyshev polynomials
-Chebyshev polyomials Joha Cigler Faultät für Mathemati, Uiversität Wie oha.cigler@uivie.ac.at Abstract I this overview paper a direct approach to Chebyshev polyomials ad their elemetary properties is
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationA REFINEMENT OF JENSEN S INEQUALITY WITH APPLICATIONS. S. S. Dragomir 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 1,. 153-164, February 2010 This aer is available olie at htt://www.tjm.sysu.edu.tw/ A REFINEMENT OF JENSEN S INEQUALITY WITH APPLICATIONS FOR f-divergence
More informationarxiv: v1 [math.fa] 3 Apr 2016
Aticommutator Norm Formula for Proectio Operators arxiv:164.699v1 math.fa] 3 Apr 16 Sam Walters Uiversity of Norther British Columbia ABSTRACT. We prove that for ay two proectio operators f, g o Hilbert
More informationProposition 2.1. There are an infinite number of primes of the form p = 4n 1. Proof. Suppose there are only a finite number of such primes, say
Chater 2 Euclid s Theorem Theorem 2.. There are a ifiity of rimes. This is sometimes called Euclid s Secod Theorem, what we have called Euclid s Lemma beig kow as Euclid s First Theorem. Proof. Suose to
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationWeil Conjecture I. Yichao Tian. Morningside Center of Mathematics, AMSS, CAS
Weil Cojecture I Yichao Tia Morigside Ceter of Mathematics, AMSS, CAS [This is the sketch of otes of the lecture Weil Cojecture I give by Yichao Tia at MSC, Tsighua Uiversity, o August 4th, 20. Yuaqig
More informationEquations and Inequalities Involving v p (n!)
Equatios ad Iequalities Ivolvig v (!) Mehdi Hassai Deartmet of Mathematics Istitute for Advaced Studies i Basic Scieces Zaja, Ira mhassai@iasbs.ac.ir Abstract I this aer we study v (!), the greatest ower
More informationSketch of Dirichlet s Theorem on Arithmetic Progressions
Itroductio ad Defiitios Sketch of o Arithmetic Progressios Tom Cuchta 24 February 2012 / Aalysis Semiar, Missouri S&T Outlie Itroductio ad Defiitios 1 Itroductio ad Defiitios 2 3 Itroductio ad Defiitios
More informationIntroduction To Discrete Mathematics
Itroductio To Discrete Mathematics Review If you put + pigeos i pigeoholes the at least oe hole would have more tha oe pigeo. If (r + objects are put ito boxes, the at least oe of the boxes cotais r or
More informationTutorial F n F n 1
(CS 207) Discrete Structures July 30, 203 Tutorial. Prove the followig properties of Fiboacci umbers usig iductio, where Fiboacci umbers are defied as follows: F 0 =0,F =adf = F + F 2. (a) Prove that P
More informationNon-Archimedian Fields. Topological Properties of Z p, Q p (p-adics Numbers)
BULETINUL Uiversităţii Petrol Gaze di Ploieşti Vol. LVIII No. 2/2006 43-48 Seria Matematică - Iformatică - Fizică No-Archimedia Fields. Toological Proerties of Z, Q (-adics Numbers) Mureşa Alexe Căli Uiversitatea
More informationOn the Jacobsthal-Lucas Numbers by Matrix Method 1
It J Cotemp Math Scieces, Vol 3, 2008, o 33, 1629-1633 O the Jacobsthal-Lucas Numbers by Matrix Method 1 Fikri Köke ad Durmuş Bozkurt Selçuk Uiversity, Faculty of Art ad Sciece Departmet of Mathematics,
More informationADVANCED PROBLEMS AND SOLUTIONS
ADVANCED PROBLEMS AND SOLUTIONS EDITED BY FLORIAN LUCA Please sed all commuicatios cocerig ADVANCED PROBLEMS AND SOLUTIONS to FLORIAN LUCA, SCHOOL OF MATHEMATICS, UNIVERSITY OF THE WITWA- TERSRAND, WITS
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationClassification of DT signals
Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {
More informationANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION
ANOTHER GENERALIZED FIBONACCI SEQUENCE MARCELLUS E. WADDILL A N D LOUIS SACKS Wake Forest College, Wisto Salem, N. C., ad Uiversity of ittsburgh, ittsburgh, a. 1. INTRODUCTION Recet issues of umerous periodicals
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,
More informationP. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA
RISES, LEVELS, DROPS AND + SIGNS IN COMPOSITIONS: EXTENSIONS OF A PAPER BY ALLADI AND HOGGATT S. Heubach Departmet of Mathematics, Califoria State Uiversity Los Ageles 55 State Uiversity Drive, Los Ageles,
More informationA NOTE ON PASCAL S MATRIX. Gi-Sang Cheon, Jin-Soo Kim and Haeng-Won Yoon
J Korea Soc Math Educ Ser B: Pure Appl Math 6(1999), o 2 121 127 A NOTE ON PASCAL S MATRIX Gi-Sag Cheo, Ji-Soo Kim ad Haeg-Wo Yoo Abstract We ca get the Pascal s matrix of order by takig the first rows
More informationBijective Proofs of Gould s and Rothe s Identities
ESI The Erwi Schrödiger Iteratioal Boltzmagasse 9 Istitute for Mathematical Physics A-1090 Wie, Austria Bijective Proofs of Gould s ad Rothe s Idetities Victor J. W. Guo Viea, Preprit ESI 2072 (2008 November
More informationSome q-analogues of Fibonacci, Lucas and Chebyshev polynomials with nice moments
Some -aaloges o Fiboacci, Lcas ad Chebyshev polyomials with ice momets Joha Cigler Faltät ür Mathemati, Uiversität Wie Ui Wie Rossa, Osar-Morgester-Platz, 090 Wie ohacigler@ivieacat http://homepageivieacat/ohacigler/
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationElliptic Curves Spring 2017 Problem Set #1
18.783 Ellitic Curves Srig 017 Problem Set #1 These roblems are related to the material covered i Lectures 1-3. Some of them require the use of Sage; you will eed to create a accout at the SageMathCloud.
More informationOn Divisibility concerning Binomial Coefficients
A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/
More information1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1
Biomial Coefficiets ad Permutatios Mii-lecture The followig pages discuss a few special iteger coutig fuctios You may have see some of these before i a basic probability class or elsewhere, but perhaps
More informationFinite q-identities related to well-known theorems of Euler and Gauss. Johann Cigler
Fiite -idetities elated to well-ow theoems of Eule ad Gauss Joha Cigle Faultät fü Mathemati Uivesität Wie A-9 Wie, Nodbegstaße 5 email: oha.cigle@uivie.ac.at Abstact We give geealizatios of a fiite vesio
More informationOn bar partitions and spin character zeros
Formal Power Series ad Algebraic Combiatorics Séries Formelles et Combiatoire Algébrique Sa Diego, Califoria 2006 O bar artitios ad si character zeros Christie Besserodt Abstract. The mai combiatorial
More informationarxiv: v1 [math.co] 23 Mar 2016
The umber of direct-sum decompositios of a fiite vector space arxiv:603.0769v [math.co] 23 Mar 206 David Ellerma Uiversity of Califoria at Riverside August 3, 208 Abstract The theory of q-aalogs develops
More informationA Combinatoric Proof and Generalization of Ferguson s Formula for k-generalized Fibonacci Numbers
Jue 5 00 A Combiatoric Proof ad Geeralizatio of Ferguso s Formula for k-geeralized Fiboacci Numbers David Kessler 1 ad Jeremy Schiff 1 Departmet of Physics Departmet of Mathematics Bar-Ila Uiversity, Ramat
More informationA symmetrical Eulerian identity
Joural of Combiatorics Volume 17, Number 1, 29 38, 2010 A symmetrical Euleria idetity Fa Chug, Ro Graham ad Do Kuth We give three proofs for the followig symmetrical idetity ivolvig biomial coefficiets
More information~W I F
A FIBONACCI PROPERTY OF WYTHOFF PAIRS ROBERT SILBER North Carolia State Uiversity, Raleigh, North Carolia 27607 I this paper we poit out aother of those fasciatig "coicideces" which are so characteristically
More informationMT5821 Advanced Combinatorics
MT5821 Advaced Combiatorics 1 Coutig subsets I this sectio, we cout the subsets of a -elemet set. The coutig umbers are the biomial coefficiets, familiar objects but there are some ew thigs to say about
More informationThe log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences
Aales Mathematicae et Iformaticae 43 2014 pp. 3 12 http://ami.etf.hu The log-cocavity ad log-covexity properties associated to hyperpell ad hyperpell-lucas sequeces Moussa Ahmia ab, Hacèe Belbachir b,
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationRoger Apéry's proof that zeta(3) is irrational
Cliff Bott cliffbott@hotmail.com 11 October 2011 Roger Apéry's proof that zeta(3) is irratioal Roger Apéry developed a method for searchig for cotiued fractio represetatios of umbers that have a form such
More informationGAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile. s: /
THE GELIN-CESÀRO IDENTITY IN SOME THIRD-ORDER JACOBSTHAL SEQUENCES arxiv:1810.08863v1 [math.co] 20 Oct 2018 GAMALIEL CERDA-MORALES 1 1 Istituto de Matemáticas Potificia Uiversidad Católica de Valparaíso
More informationCOMPUTING FOURIER SERIES
COMPUTING FOURIER SERIES Overview We have see i revious otes how we ca use the fact that si ad cos rereset comlete orthogoal fuctios over the iterval [-,] to allow us to determie the coefficiets of a Fourier
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationSolutions to Problem Set 8
8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +
More informationSolutions to Final Exam
Solutios to Fial Exam 1. Three married couples are seated together at the couter at Moty s Blue Plate Dier, occupyig six cosecutive seats. How may arragemets are there with o wife sittig ext to her ow
More informationOn Generalized Fibonacci Numbers
Applied Mathematical Scieces, Vol. 9, 215, o. 73, 3611-3622 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.215.5299 O Geeralized Fiboacci Numbers Jerico B. Bacai ad Julius Fergy T. Rabago Departmet
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More information1/(1 -x n ) = \YJ k=0
ADVANCED PROBLEMS AND SOLUTIONS Edited by RAYMOND E.WHITNEY Lock Have State College, Lock Have, Pesylvaia Sed all commuicatios cocerig Advaced Problems ad Solutios to Eaymod E. Whitey, Mathematics Departmet,
More informationMath 172 Spring 2010 Haiman Notes on ordinary generating functions
Math 72 Sprig 200 Haima Notes o ordiary geeratig fuctios How do we cout with geeratig fuctios? May eumeratio problems which are ot so easy to hadle by elemetary meas ca be solved usig geeratig fuctios
More information