A FIBONACCI MATRIX AND THE PERMANENT FUNCTION

Similar documents
a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

Math 155 (Lecture 3)

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

ANOTHER GENERALIZED FIBONACCI SEQUENCE 1. INTRODUCTION

LINEAR RECURSION RELATIONS - LESSON FOUR SECOND-ORDER LINEAR RECURSION RELATIONS

CALCULATION OF FIBONACCI VECTORS

2.4 - Sequences and Series

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

is also known as the general term of the sequence

CERTAIN GENERAL BINOMIAL-FIBONACCI SUMS

Chapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Chimica Inorganica 3

Hoggatt and King [lo] defined a complete sequence of natural numbers

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Mon Feb matrix inverses. Announcements: Warm-up Exercise:

Polynomial Functions and Their Graphs

Matrices and vectors

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

AH Checklist (Unit 3) AH Checklist (Unit 3) Matrices

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Chapter Unary Matrix Operations

ENGI Series Page 6-01

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Math 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1

1. INTRODUCTION. P r e s e n t e d h e r e is a generalization of Fibonacci numbers which is intimately connected with the arithmetic triangle.

UNIVERSITY OF NORTHERN COLORADO MATHEMATICS CONTEST. First Round For all Colorado Students Grades 7-12 November 3, 2007

MATH10212 Linear Algebra B Proof Problems

1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1

Course : Algebraic Combinatorics

SEQUENCE AND SERIES NCERT

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

Sequences, Sums, and Products

SOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Indian Statistical Institute, Calcutta, India

Recurrence Relations

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

CHAPTER 1 SEQUENCES AND INFINITE SERIES

The path polynomial of a complete graph

CHAPTER I: Vector Spaces

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

Lemma Let f(x) K[x] be a separable polynomial of degree n. Then the Galois group is a subgroup of S n, the permutations of the roots.

MATH 304: MIDTERM EXAM SOLUTIONS

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

arxiv: v1 [math.nt] 10 Dec 2014

Random Models. Tusheng Zhang. February 14, 2013

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

CALCULATING FIBONACCI VECTORS

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

Benaissa Bernoussi Université Abdelmalek Essaadi, ENSAT de Tanger, B.P. 416, Tanger, Morocco

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

1 Last time: similar and diagonalizable matrices

+ au n+1 + bu n = 0.)

Generating Functions. 1 Operations on generating functions

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

1/(1 -x n ) = \YJ k=0

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

Chapter Vectors

On the distribution of coefficients of powers of positive polynomials

Roger Apéry's proof that zeta(3) is irrational

PROBLEM SET I (Suggested Solutions)

<aj + ck) m (bj + dk) n. E E (-D m+n - j - k h)(i) j=0 k=0 \ / \ /

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Fibonacci numbers and orthogonal polynomials

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

CHAPTER 5. Theory and Solution Using Matrix Techniques

Lesson 10: Limits and Continuity

Induction proofs - practice! SOLUTIONS

Linear chord diagrams with long chords

A 2nTH ORDER LINEAR DIFFERENCE EQUATION

SEQUENCES AND SERIES

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Solutions to Final Exam

6.3 Testing Series With Positive Terms

Complex Analysis Spring 2001 Homework I Solution

THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION. In Memory of Robert Barrington Leigh. March 9, 2014

Tutorial F n F n 1

Infinite Series. Definition. An infinite series is an expression of the form. Where the numbers u k are called the terms of the series.

Sigma notation. 2.1 Introduction

Formulas for the Number of Spanning Trees in a Maximal Planar Map

Chapter 6. Advanced Counting Techniques

Section 11.8: Power Series

Q-BINOMIALS AND THE GREATEST COMMON DIVISOR. Keith R. Slavin 8474 SW Chevy Place, Beaverton, Oregon 97008, USA.

Zeros of Polynomials

Solutions to Math 347 Practice Problems for the final

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

NUMERICAL METHODS FOR SOLVING EQUATIONS

Essential Question How can you recognize an arithmetic sequence from its graph?

Section 5.1 The Basics of Counting

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Homework 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

Stochastic Matrices in a Finite Field

ADVANCED PROBLEMS AND SOLUTIONS

On the Determinants and Inverses of Skew Circulant and Skew Left Circulant Matrices with Fibonacci and Lucas Numbers

Transcription:

A FIBONACCI MATRIX AND THE PERMANENT FUNCTION BRUCE W. KING Burt Hiils-Ballsto Lake High School, Ballsto Lake, New York ad FRANCIS D. PARKER The St. Lawrece Uiversity, Cato, New York The permaet of a -square matrix [a..] is defied to be a, " S i=l J i where a = <Ji»J2»*»3 ) is a member of the symmetric group S of permutatios o distict objects. For example, the permaet of the matrix a i i a l 2 a i 3 a 2 i a22 a 2 3 is a 3 a 32 a 33 a l i a 2 2 a 3 3 - + a li a 23 a 32 + a i2 a 2 a 33 + a i2 a 23 a 3 + a i3 a 2i a 32 + a 3 a 22 a 3 This is similar to the defiitio of the determiat of [a.. ], which is ^ ii ^. a e S i=l where e^. is or - depedig upo whether " is a eve or a odd permutatio. There are other similarities betwee the permaet ad the determiat fuctios, amog them; (a) iterchagig two rows, or two colums, of a matrix chages the sig of the determiat but it does ot chage the permaet at all. Thus, the permaet of a matrix remais ivariat uder arbitrary permutatios of its rows ad colums; ad J i I this otatio, (j 9 j2? w > 3 ) \Ji 32 3 / i s a abbreviatio for the permutatio 539

54 A FIBONACCI MATRIX AND THE PERMANENT FUNCTION [Dec. (b) there is a Laplace expasio for the permaet of a matrix as well as for the determiat. I particular, there is a row or colum expasio for the permaet. For example, if we use "per [ a.. ] " for the permaet of the matrix [ a.. ], the expasio alog the first colum yields that per a l i a 2. a 3 a i 2 a 22 a 32 a 3* a 23 a 33. = a iiper [a 22 [ a 32 a 2 3 ] + a p e r [ a i 2 a i3l + a 3 l P e r r a i 2 a 2 F 33j [ a 32 a 3 F 33j (j* 22 a i3l ^ J For further iformatio o properties of the permaet, the reader should see [, p. 578] ad [3, pp. 25-26], Ufortuately, oe of the most useful prpperties of the determiat its ivariace uder the additio of a multiple of a row (or colum) to aother row (or colum) is false for the permaet fuctio. As a result, evaluatig the permaet of a matrix i s, geerally, a much more difficult problem tha evaluatig the correspodig determiat. Let P be the -square matrix whose etries are alio, except that each etry alog the first diagoal above the mai diagoal is equal to, ad the etry i the row ad first colum also is. (P is a "permutatio matrix. ") For example, PR = ' ". The reader ca verify that ad Pi = P 3 5 = "" _ ro Lo *

969] A FIBONACCI MATRIX AND THE PERMANENT FUNCTION We ow defie the matrix Q(,r) to be 54 L«J 3= For example, Q(5,2) P B + Ps =. It is ot difficult to see that perq(,l) = per P =, per Q(,2) = 2, ad that perq(,) = L It has bee show [2] that () ^^^.(i-l^^i^iy The strategy used i the derivatio of () was to use techiques for the solutio of a liear differece equatio o a certai recurrece ivolvig perq(,3). There are, also, expressios available for perq(,4), p e r Q (, - ) ad p e r Q (, - 2 ). (See [3], [ 3, pp. 22-28] ad [3, pp. 3-35], respectively.) However, per Q(,r) has ot bee determied for 5 < r < - 3. The objectives of this paper are to use a "Fiboacci matrix" to derive (), ad to derive a explicit expressio for perq(,3) other tha that provided by (). (By J a "Fiboacci matrix" we mea a matrix M for which M = per ^ M - - + p e r M _ 2. ) Let F be the matrix ff..], where f.. = if li - jl < ad f.. = L 3 3 J - r j otherwise. The, by startig with a expasio alog the first colum, we fid that F is a Fiboacci m a t r i x / Sice per F 2 = 2 ad per F 3 = 3, per F yields the ( + ) well kow that the term of the Fiboacci sequece,, 2, 3, 5, a. It is Fiboacci umber is give by *There are other Fiboacci matrices. See problem E553 i the 962 volume of the America Mathematical Mothly, for example.

542 A FIBONACCI MATRIX AND THE PERMANENT FUNCTION [Dec. ( + ^ ) - ( - */5) 2 -v/5 This, it follows that i (2) 9 \ per F v = J + V5 - - ^ 5 ),-. + 2 V 5 by It is ot quite as well kow that the Fiboacci umber is also give EH- ). where is the greatest iteger i M - (See [4, pp. 3-4] for a proof.) From this it follows that (3) * "»= ("; k ) Now let U (i, j) be the -square matrix all of whose etries are except the etry i row i ad colum j, which is. If we let R = F + U (,l), by expasio alog the first row of R we fid that

969] A FIBONACCI MATRIX AND THE PERMANENT FUNCTION 543 p e r R = per F + p e r f F ^ - ^(2,) + U ^ -,)]. But, by expadig alog the first colum, (4) per [ F _ - ^(2,) + U ^ ^ -,)] = per F _ 2 +. Thus, per R = per F + per F + = + per F K ^ ^ - ^ -2 If we ow let S = R +U (l,), by expasio alog the first row of S we fid that per S = per F ^ + per [ F ^ - ^(2,) + U ^ f o -,)] (5) + per [Q( -,2) - U ( - 2,) - u - ( - i. 2 ) + p ; : J ]. If we substitute from (4) ad use Z for the matrix of the third term of the right member of (5), we have per S = per F - + per F «+ + per Z = per F + + per Z. Now expad Z alog its first colum to obtai per Z = + per F 9. The ^ per S = 2 + per F + per F ~. Sice per S = perq(,3) (because S ca be obtaied from Q(,3) by a permutatio of colums), it follows that per Q(,3) = 2 + per F + per F. & By usig (2), we obtai a expressio for per Q(,3) which reduces to that give by Mie i [ ]. By usig (3), we obtai:

544 A FIBONACCI MATRIX AND THE PERMANENT FUNCTION Dec. 969 k= k= REFERENCES. Marvi Marcus ad Heryk Mie, " P e r m a e t s, f f The America Mathematical Mothly, Vol. 72 (965), No. 6, pp. 477-59. 2. Heryk Mie,, " P e r m a e t s of (,)-Circulats, " Caadia Mathematical Bulleti, Vol. 7 (964), pp. 253-263. 3. H e r b e r t J, R y s e r, Combiatorial Mathematics, MAA Carus Moograph No. 4, J. Wiley ad Sos, New York, 963. 4. N. N. Vorob f ev, Fiboacci N u m b e r s, Blaisdell Publishig Compay, New York, 96. [Cotiued from page 538. ] SOLUTIONS TO PROBLEMS T ^ = 5T + 2T - - 9T Q - 5T Q + - -2-3 2 ' T + = 5 T " 4 T - l " 9 T - 2 + 7 T - 3 + 6 T - 4 3. T ^ = 5T - 7T - + 3T + - - 2 T ^ = 4 T ^Q - 2T ^ - 5T _ + 2T +4 +3 +2 + T j C = 2 T l C + 4T, - 4T, - 6T l + T +6 +5 +4 +3 +2 * * * * *