This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MATH 681 Notes Combinatorics and Graph Theory I 1 Recurrence relations, continued yet again One last lousy class of recurrences we should be able to solve: 1.1 Systems of recurrence relations Sometimes multiple recurrences working in tandem are more effective than a single recurrence. Lets see how such a thing might be of assistance. Question 1: Let a n represent the number of strings from { , 1 , 2 } of length n with an even number of 0s. Find a recurrence for a n . Answer 1: Note that recurrences are not actually the best way to solve this particular problem: it would be a lot easier to do it with the exponential generating function e x + e x 2 e x e x = e 3 x + e x 2 = n =0 3 n +1 2 x n n ! to get a n = 3 n +1 2 . But, armed with that knowledge, lets look at how we might tackle it as a recurrence We introduce an auxiliary sequence b n , which counts the bitstrings of length n with an odd number of zeroes. Now, we know: a n = 2 a n 1 + b n 1 b n = a n 1 + 2 b n 1 and a = 1 and b = 0 . This uniquely determines a n , but solving it might be tricky. We can have recourse to either OGFs or EGFs to solve it, depending whether you prefer algebra or differential equations. Lets suppose we use an OGF; letting f ( x ) = n =0 a n x n and g ( x ) = n =0 b n x n . Then the first equation in the recurrence can be simplified to f ( x ) a = 2 xf ( x ) + xg ( x ) ; the second will become g ( x ) b = xf ( x ) + 2 xg ( x ) . Collecting terms, well get the system: f ( x ) = xg ( x ) + 1 1 2 x g ( x ) = xf ( x ) 1 2 x so, solving for f ( x ) in terms of itself, f ( x ) = x xf...
View
Full
Document
This note was uploaded on 01/12/2012 for the course MATH 681 taught by Professor Wildstrom during the Fall '09 term at University of Louisville.
 Fall '09
 WILDSTROM
 Combinatorics, Graph Theory

Click to edit the document details