Course : Algebraic Combinatorics

Similar documents
Course : Algebraic Combinatorics

Math 155 (Lecture 3)

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

Enumerative & Asymptotic Combinatorics

Math 475, Problem Set #12: Answers

MT5821 Advanced Combinatorics

REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

1 Generating functions for balls in boxes

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

Ma 530 Infinite Series I

Unit 4: Polynomial and Rational Functions

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

Solutions to Final Exam

Zeros of Polynomials

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

Properties and Tests of Zeros of Polynomial Functions

Axioms of Measure Theory

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

Solutions to Problem Set 8

TEACHER CERTIFICATION STUDY GUIDE

Generating Functions II

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

4 The Sperner property.

Generating Functions. 1 Operations on generating functions

Once we have a sequence of numbers, the next thing to do is to sum them up. Given a sequence (a n ) n=1

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

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

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

AN ALMOST LINEAR RECURRENCE. Donald E. Knuth Calif. Institute of Technology, Pasadena, Calif.

Enumerative & Asymptotic Combinatorics

REVIEW FOR CHAPTER 1

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes

Combinatorially Thinking

Math 172 Spring 2010 Haiman Notes on ordinary generating functions

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

PROBLEMS ON ABSTRACT ALGEBRA

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

Lecture 1: Generating Functions

Algebraic Geometry I

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

Infinite Sequences and Series

CHAPTER 1 SEQUENCES AND INFINITE SERIES

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

7.1 Convergence of sequences of random variables

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

GENERALIZED HARMONIC NUMBER IDENTITIES AND A RELATED MATRIX REPRESENTATION

Recurrence Relations

Random Models. Tusheng Zhang. February 14, 2013

1. By using truth tables prove that, for all statements P and Q, the statement

Math 104: Homework 2 solutions

MT5821 Advanced Combinatorics

Legendre-Stirling Permutations

V. Adamchik 1. Recursions. Victor Adamchik Fall of x n1. x n 2. Here are a few first values of the above sequence (coded in Mathematica)

Mathematics review for CSCI 303 Spring Department of Computer Science College of William & Mary Robert Michael Lewis

2.4 - Sequences and Series

Definition An infinite sequence of numbers is an ordered set of real numbers.

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

Chapter 6. Advanced Counting Techniques

GENERATING FUNCTIONS AND RANDOM WALKS

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

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

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

The r-generalized Fibonacci Numbers and Polynomial Coefficients

Sequences of Definite Integrals, Factorials and Double Factorials

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

FLOOR AND ROOF FUNCTION ANALOGS OF THE BELL NUMBERS. H. W. Gould Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA

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

CHAPTER 10 INFINITE SEQUENCES AND SERIES

LECTURE NOTES, 11/10/04

Chapter 7: The z-transform. Chih-Wei Liu

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

Singular Continuous Measures by Michael Pejic 5/14/10

arxiv: v1 [math.co] 23 Mar 2016

Lecture 7: Properties of Random Samples

CALCULATION OF FIBONACCI VECTORS

A Study on Some Integer Sequences

arxiv: v1 [math.fa] 3 Apr 2016

arxiv: v1 [math.co] 3 Feb 2013

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

CHAPTER 5. Theory and Solution Using Matrix Techniques

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

1 Counting and Stirling Numbers

Solutions to Homework 1

Math 61CM - Solutions to homework 3

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

Lecture 4: Grassmannians, Finite and Affine Morphisms

Worksheet on Generating Functions

q-lucas polynomials and associated Rogers-Ramanujan type identities

Math 312 Lecture Notes One Dimensional Maps

Week 5-6: The Binomial Coefficients

Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers

Math 299 Supplement: Real Analysis Nov 2013

Injections, Surjections, and the Pigeonhole Principle

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Curve Sketching Handout #5 Topic Interpretation Rational Functions

Lecture Notes for Analysis Class

Transcription:

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 way of expressig this data. We begi with the otio of ordiary geeratig fuctios. To illustrate this defiitio, we start with the example of the Fiboacci umbers. {F } =0 = {F 0, F, F 2, F 3,...} defied by F 0 =, F =, ad F = F + F 2 for 2. We defie,, 2, 3, 5, 8, 3, 2, 34,... F(X) := F 0 + F x + F 2 x2 + F 3 x3 + F 4 x4 +... = + x + 2x2 + 3x3 + 5x4 + 8x5 +.... I other words, F(X) is the formal power series =0 F x. Remar. This is called a formal power series because we will cosider x to be a idetermiate variable rather tha a specific real umber. I geeral, give a sequece of umbers {a i } i=0 = {a 0, a, a 2, a 3,...}, the associated formal power series is A(X) := a x = a 0 + a x + a 2 x2 + a 3 x3 +.... =0 We will shortly write dow F(X) i a compact form, but we begi with a easier example that you have already see.

( )! Recall that =. For example,!( )! {( ) 8 } 8 = {, 8, 28, 56, 70, 56, 28, 8, }. =0 ( ) ( ) 8 8 I fact if > 8, (e.g. ) equals zero. Thus we ca cosider the etire ifiite 9 sequece as {( ) 8 } = {, 8, 28, 56, 70, 56, 28, 8,, 0, 0, 0,...}, =0 ad the the associated formal power series + 8x + 28x2 + 56x3 + 70x4 + 56x5 + 28x6 + 8x7 + x8 + 0x9 + 0x0 +... ca be writte compactly as ( + x) 8. {( )} Geeralizig this to ay positive iteger, has associated power series ( ) =0 ( + x), sice ( + x) = =0 x by the Biomial Theorem. This illustrates that from a formal power series, we ca recover a sequece of umbers. We call these umbers the coefficiets of the formal power series. For ( ) example, we say that is the coefficiet of x i ( + x). This is sometimes ( ) ( ) writte as ( + x) = or [x ]( + x) =. x. More complicated formal power series We ow wat to write a similar expressio for F(X) = =0 F x, where F = F + F 2 for 2 ad F 0 = F =. Notice that a x ± b x = (a ± b )x. =0 =0 =0 As a cosequece, F = F + F 2 for 2 implies F(X) = + F x + =2 F x = + F x + (F + F 2 )x =2 = + F x + F x + F 2 x =2 =2 ( ) = + F x + xf(x) F 0 x + x2 F(X).

Thus ad we obtai the ratioal expressio F(X)( x x2 ) = + (F F 0 )x = + 0x F(X) =. x x 2 If we loo at the Taylor series for this ratioal fuctio, we ideed obtai coefficiets that are the Fiboacci umbers. Geeratig Fuctios are also helpful for obtaiig closed formulas or asymptotic formulas. If we use partial fractio decompositio, we see that A B F(X) = +. λ x λ 2 x We ow that ( λ x)( λ 2 x) = x x 2 so Thus {λ, λ 2 } = { + 2 5, 5 }. 2 λ λ 2 λ λ 2 = ad = Exercise : Solve for A ad B ad use this to obtai a closed form expressio for F. Notice that as a cosequece we ca compute that {F + /F } = {/, 2/, 3/2, 5/3, 8/5, 3/8,...} ( ) coverges to 5 sice 5 0 as, so + 2 2 Aλ + + Bλ + 2 Aλ + = λ. Aλ + Bλ 2 Aλ.2 A Combiatorial Iterpretatio of the Fiboacci Numbers Give a sequece of itegers S = {s 0, s, s 2,...}, a combiatorial iterpretatio of S is a family F of objects (of various sizes) such that the umber of objects i F of size is exactly couted by s. For example, a combiatorial iterpretatio of ( ) is as the umber of subsets of a {, 2,..., } of size. A domio tilig of a rectagular regio R is a coverig of R by horizotal (-by-2) domio tiles ad vertical (2-by-) domio tiles such that every square of R is covered by exactly oe domio.

For example, if we let R be a 2-by-2 grid, the there are two possible domio tiligs. Either both tiles are vertical or both are horizotal. If we let R be a 2-by-3 grid, the there are three possible domio tiligs, ad a 2-by-4 grid would have five such domio tiligs. Propositio. The umber of domio tiligs of a 2-by- grid is couted by the th Fiboacci umber, F for. Proof. Let DT deote the umber of domio tiligs of the 2-by- grid. We first chec the iitial coditios. There is oe way to tile the 2-by- grid, ad there are two ways to tile the 2-by-2 grid. Thus DT = = F ad DT 2 = 2 = F 2. (Recall that F 0 =, but we do ot use this quatity i this combiatorial iterpretatio.) Domio tiligs of the 2-by- grid either loo lie a domio tilig of the 2-by ( ) grid with a vertical tile taced oto the ed, or a domio tilig of the 2-by-( 2) grid with two horizotal tiles taced oto the ed. Cosequetly, DT = DT + DT 2, the same recurrece as the F s. Exercise 2: Show that this combiatorial iterpretatio ca be rephrased as the statemet F = The umber of subsets S of {a, a 2,...,a } such that a i ad a i+ are ot both cotaied i S..3 Covolutio Product Formula I additio to addig formal power series together, we ca also multiply them. If A(X) = =0 a x ad B(X) = =0 b x, where a (resp. b ) couts the umber of objects of type A (resp. B) ad size, the A(X)B(X) = C(X) = c x where c = a b, ad has a combiatorial iterpretatio as the umber of =0 objects of size formed by taig a object of type A ad cocateatig it with a object of type B. =0

.4 Coectio betwee Liear Recurreces ad Ratioal Geeratig Fuctios The behavior we saw of the Fiboacci umbers ad its geeratig fuctio is a example of a more geeral theorem. Theorem. (Theorem 4.. of Eumerative Combiatorics by Richard Staley) Let α, α 2,...,α d be a fixed sequece of complex umbers, d, ad α d = 0. The followig coditios o a fuctio f : N C are equivalet: i) The geeratig fuctio F(X) equals f()x = =0 P(x) Q(x) where Q(x) = + α x + α 2 x 2 +... + α d x d ad P(x) is a polyomial of degree < d. ii) For all 0, f() satisfies the liear recurrece relatio f( + d) + α f( + d ) + α 2 f( + d 2) +... + α d f() = 0. where iii) For all 0, f() = P i ()γ i i= + α x + α 2 x2 +... + α d xd = ( γ i x) e i with the γ i s distict ad each P i () is a uivariate polyomial (i ) of degree less tha e i. i= Defitio. A geeratig fuctio of the form eratig fuctio. P (x) is a called a ratioal ge- Q(x)

MIT OpeCourseWare http://ocw.mit.edu 8.32 Algebraic Combiatorics Sprig 2009 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.