1 / 35

15-251

15-251. AWESOME. Some. Great Theoretical Ideas in Computer Science. about. Generating. Functions. MORE Generating Functions. Lecture 7 (February 2, 2010) Adam Blank. Announcements. You are now breathing manually. Homework 3 is due tonight. Please submit a collaborators graph again.

quinn-nielsen
Download Presentation

15-251

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 15-251 AWESOME Some Great Theoretical Ideas in Computer Science about Generating Functions

  2. MORE Generating Functions Lecture 7 (February 2, 2010) Adam Blank

  3. Announcements You are now breathing manually Homework 3 is due tonight • Please submit a collaborators graph again. • It doesn’t matter what you name it. • You do not also have to list your collaborators in the pdf Homework 4 is out • This assignment is non-trivial • Start early! Exam 1 will be in recitation next week • Don’t be late! • We will (tentatively) have a review session on Saturday • We will email you with updates

  4. What good are Generating Functions anyway?

  5. What good are Generating Functions anyway? They're fun! Solving recurrences precisely They are often easier than the alternative!

  6. Some Terminology Closed form of a Generating Function Closed form for a Recurrence

  7. Let’s do some problems!

  8. Domino Domination We have a board, and we would like to fill it with dominos. We have two colors of dominos: green and blue. The green ones must be used in pairs (so that they don’t get blue!), and they must be vertical. How many ways can we tile our board?

  9. Domino Domination This is a combinatorial question! How should we proceed?!?! Write a recurrence! We have a board, and we would like to fill it with dominos. We have two colors of dominos: green and blue. The green ones must be used in pairs (so that they don’t get blue!), and they must be vertical. How many ways can we tile our board?

  10. Domino Domination So now we have a recurrence…but now what?

  11. Domino Domination Now we derive a closed form using generating functions! Let We know the base cases: Note that these base cases are actually correct. is the number of ways to tile a board.

  12. Domino Domination Now we derive a closed form using generating functions! Let

  13. Domino Domination Now we derive a closed form using generating functions! Let

  14. Domino Domination Now we have a closed form for the generating function! …what now? Let

  15. Domino Domination Now we have a closed form for the generating function! …what now? Let

  16. Domino Domination Now we have a closed form for the generating function! …what now? Let

  17. Rogue Recurrence for n>2 , , Solve this recurrence…or else! Let

  18. Rogue Recurrence for n>2 , , Solve this recurrence…or else! Let

  19. Rogue Recurrence for n>2 , , Solve this recurrence…or else! Let

  20. Rogue Recurrence for n>2 , , Solve this recurrence…or else! Let What next? Partial fractions?

  21. Rogue Recurrence No. Let’s be sneaky instead!

  22. Rogue Recurrence for n>2 , , Now back to the recurrence… Let

  23. Double Sums OMGWTFBBQ! Let’s revisit the last lecture… We would like to swap the summations. All we have done here is re-group the addition.

  24. Double Sums OMGWTFBBQ! We know that…

  25. Double Sums OMGWTFBBQ! We know that… So…

  26. Dainty Diners 2n nobles want to sit down to dinner at a table and shake hands. They are picky and will not shake hands in any way, in which one or more noble reaches over another. How many ways can the nobles shake hands?

  27. Dainty Diners Look at an arbitrary person, and think about who he could shake hands with.

  28. Dainty Diners Noble 0 can shake hands with 2, 4, or 6. He can shake hands with even numbered people! When he shakes hands with someone, it splits the remaining people into two groups. 0 6 2 5 4 3

  29. Dainty Diners First, we choose which person the 0th person shakes hands with, then we choose the two sub-groups created by this choice # of ways 2(n-k-1) nobles can shake hands # of ways 2k nobles can shake hands # of ways 2n nobles can shake hands Choose which person the 0th person shakes hands with

  30. Dainty Diners n=1: n>1: Let

  31. Dainty Diners What now? Our usual trick of putting the terms in terms of P(x) doesn’t seem to be possible!

  32. Dainty Diners Idea! Isolate the double summation and list out some terms. Is there a pattern??

  33. Dainty Diners Let C(x) be an arbitrary generating function! Suppose we take k terms from the left. We need n-k from the second to make n total powers of k.

  34. Dainty Diners After some “magic” (see Newton’s Binomial Theorem):

  35. Generating Functions • How to solve recurrences • Summation techniques • Simple partial fractions • Simple differentiation (mostly remember how to use generating functions to solve recurrences) Here’s What You Need to Know…

More Related