* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Formal power series
Survey
Document related concepts
Jordan normal form wikipedia , lookup
Exterior algebra wikipedia , lookup
Eigenvalues and eigenvectors wikipedia , lookup
Matrix (mathematics) wikipedia , lookup
Symmetric cone wikipedia , lookup
Capelli's identity wikipedia , lookup
Four-vector wikipedia , lookup
Singular-value decomposition wikipedia , lookup
System of linear equations wikipedia , lookup
Orthogonal matrix wikipedia , lookup
Linear least squares (mathematics) wikipedia , lookup
Matrix calculus wikipedia , lookup
Gaussian elimination wikipedia , lookup
Non-negative matrix factorization wikipedia , lookup
Cayley–Hamilton theorem wikipedia , lookup
Transcript
Applying linear algebra to number-sequences and countingproblems. Any questions about the homework or the material? Fibonacci numbers, understood via matrices Domino tilings of 3-by-n rectangles For all non-negative n, let a_n = number of domino tilings of a 3-by-2n rectangle (a_0 = 1) and let b_n = number of domino tilings of a 3-by-(2n+1) rectangle with a bite taken out of one corner. a_n = 2b_{n-1} + a_{n-1} b_n = a_n+b_{n-1} = 3b_{n-1} + a_{n-1}. Initial values: a_0 = 1, a_1 = 3, b_0 = 1, b_1 = 4. Generating function approach: A la Wilf. “Transfer matrix approach”: Write a_n = 2b_{n-1} + a_{n-1} b_n = 3b_{n-1} + a_{n-1} in matrix form (a_n) ( 1 2 ) (a_{n-1}) ( )=( )( ) (b_n) ( 1 3 ) (b_{n-1}) and repeat this to obtain n (a_n) ( 1 2 ) (1) ( )=( ) ( ) (b_n) ( 1 3 ) (1) . Use linear algebra to find a formula for a_n. Alternative approach: Find a clever way to combine the recurrence relations so as to eliminate b and find a recurrence relation governing a alone.