201 GF

f ac u lty of sci ence MATH 895-4 Fall 2010
d ep ar tment of m athemat ics Course Schedule

MACM 201 Discrete Mathematics II
Week Date Sections Part/ References Topic/Sections Notes/Speaker

from FS2009
1 Sept 7 I.1, I.2, I.3

Combinatorial Symbolic methods
Lectures
2 14
outline
I.4, I.5, I.6
(next
Structures3 lectures)
Unlabelled structures
FS: Part A.1, A.2
Comtet74
3 21 II.1, II.2, II.3 Labelled structures I
Handout #1
4 28
Generating II.4, functions
II.5, II.6 (self study)
Labelled
have a bad structures II
reputation, as a complicated topic. This is not
Combinatorial Combinatorial
5 Oct 5 III.1, III.2 Asst #1 Due
justified.
parameters Parameters
FS A.III
6
The 12
first IV.1,
thing IV.2 to understand Multivariable
is thatGFsa Generating Function, is not really a
(self-study)
7 19 IV.3, IV.4 Complex Analysis

function. In fact it Analytic
should Methods
FS: Part B: IV, V, VI
be called a formal power series. It is a not a function
8 26 Appendix B4 Singularity Analysis
IV.5 V.1that, for us at least, we will never evaluate it at a given value of x.
Stanley 99: Ch. 6
in the sense
9 Nov 2 Asymptotic methods Asst #2 Due
Handout #1
(self-study)
9 VI.1 is just a compact way to encode
A 10GF/FPS Sophie
an infinite sequence of numbers,
12 A.3/ C Introduction to Prob. Mariolys
which for us will most of the time be the counting sequence of a family of
18 IX.1 Limit Laws and Comb Marni
11
Random Structures
combinatorial objects.
20 IX.2 Discrete Limit Laws Sophie
and Limit Laws
Combinatorial FS: Part C
23 IX.3 Mariolys recurrences, but with GFs.
(rotating
instances of discrete
We will illustrate this link by revisiting solving
12
presentations)
Note.25 WeIX.4 will not thoroughlyContinuous
follow Limit Laws Marni
the textbook for this material, but the
Quasi-Powers and
13 30 IX.5 Sophie
material presented Gaussian limit
here corresponds laws
roughly to Sections 9.1, 9.2, and 10.4.
14 Dec 10 Presentations Asst #3 Due
Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

Version of: 11-Dec-09
Dr. Cedric Chauve, Dr. Bojan Mohar, Spring 2018 Generating Functions 1 1
Generating
Week Date Functions
Sections
from FS2009
and their Topic/Sections
Part/ References calculus Notes/Speaker
1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods
“A2 generating Structures

14 I.4, I.5, I.6 function is a clothesline
FS: Part A.1, A.2
on which we hang up a sequence of
Comtet74
numbers for display.” Handout #1
4 28 II.4, II.5, II.6 (self study)
Labelled structures II
Herbert Wilf, Generatingfunctionology (1994)
As6 in12 most FS A.III
IV.1, IV.2 Multivariable GFs
(self-study)
of the counting problems we looked at, we consider a family of
7 19
combinatorialIV.3, IV.4 objects, that we Complex
Analytic Methods
denote C now, together with a notion of size for
Analysis
8
these 26 objects. WeAppendix
IV.5 V.1
denote B4 by CSingularity subset of objects of C of size n and by cn
n the Analysis
Stanley 99: Ch. 6
9 Nov 2
the number #1 Cn (cnAsymptotic
Handout in
of objects |). TheAsstsequence
= |Cnmethods #2 Due
of integers c0, c1, c2, . . .
(self-study)
9 VI.1 Sophie
is10called the counting sequence for C.

11
Take 20 IX.2
for example BRandom
theStructures Discrete Limit Laws
set of all binary strings; Sophie
then bn is the number of binary
and Limit Laws
strings of size n and FS: Part
theC corresponding
Combinatorial infinite (counting) sequence of integers is
23 IX.3 Mariolys
(rotating instances of discrete
1,122, 4, 8, 16, 32, . .presentations)
. . We want to find a way to represent this infinite sequence
25 IX.4 Continuous Limit Laws Marni
Quasi-Powers and
of integers.
13 30 IX.5 Sophie
Gaussian limit laws
14 Dec 10
We did see that from Presentations Asst #3 Due
direct counting, we have a closed form formula for bn:
n
bn = 2 . We can easily program this to obtain the value of bn for any n.
We could also define bn through a first-order linear recurrence relation: b0 =

1, bn = 2bn−1 n ≥ 1. Again we can easily program this recurrence to obtain
arbitrary values for bn or solve it to find that bn = 2n.
introduce now a different way to represent the infinite sequence b0, b1, b2, . . . :
We
X
bn x n
1
B(x) = =
1 − 2x
n≥0
This function is easy to program and manipulate with a computer and contains
all the information we need about our infinite sequence.
Week Date Sections

Definition. Let a0,Part/
from FS2009
a1References
, a2, . . . beTopic/Sections
a, possibly Notes/Speaker
infinite, sequence of numbers.
1
The Sept 7 I.1, I.2, I.3 Generating
(ordinary) Combinatorial Symbolic methods
Function (GF) associated to this sequence is the
Structures
2 14 power
I.4, I.5, I.6series Unlabelled structures
formal FS: Part A.1, A.2
Comtet74
X
Handout #1
(self study)
A(x) = an x n .
4 28 II.4, II.5, II.6 Labelled structures II
n≥0
parameters n Parameters
We denote also a by [x ]A(x) to be read as the coefficient of the monomial
n A.III
FS
of6 degree
12 IV.1, IV.2
n in the A(x). Multivariable GFs (self-study)
7 19 IV.3, IV.4 Analytic Methods Complex Analysis

IV.5 few
V.1
In9 theNovnext Stanley 99: Ch. 6
2 Asst #2 Due
lectures, we are going to use GFs to answer the two following
Asymptotic methods
Handout #1
(self-study)
general9 VI.1
questions. Sophie
10
1. Given
18 IX.1
the text description ofLimitaLaws and Comb
combinatorialMarni family A, find the GF C (x) of
11
20
its counting Random Structures
IX.2 sequence. Discrete Limit Laws Sophie
and Limit Laws
FS: Part C Combinatorial
23 IX.3
12
Question. What is(rotating instances
the GF of the family B ofMariolys
of discrete binary strings.
presentations)
25
Answer: B(x)
IX.4 = 1/(1 − 2x). Continuous Limit Laws Marni
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws
2.14 Given
Dec 10
the GF A(x) associated
Presentations
to a familyAsst
of#3combinatorial
Due
objects A, deduce
from it a formula for an. This is the problem of coefficient extraction.
Question. Knowing that the GF of the family B of binary sequences is B(x) =
(1 − 2x)−1, what is the number bn of binary sequences of size n?
Answer: bn = [x n](1 − 2x)−1 = 2n.

Example.
Week Date an =Part/
Sections
from FS2009
Let n ≥ 0. What
1, References is A(x)?Notes/Speaker
Topic/Sections

Structures
2 14 I.4, I.5, I.6 Unlabelled structures
FS: Part A.1, A.2
Comtet74
Handout #1
4 28 II.4, II.5, II.6 (self study) Labelled structures II
FS A.III
6 12 IV.1, IV.2 (self-study) Multivariable GFs

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
20 IX.2 Random Structures Discrete Limit Laws Sophie
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Example.
Week Date bn =Part/
Sections
from FS2009
Let n, References
n ≥ 0. What is B(x)?Notes/Speaker
Topic/Sections

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

From now we will assume that we are familiar with this GF.
Week Date Sections Part/ References

Let from FS2009 XTopic/Sections Notes/Speaker
X
n
1 Sept 7 I.1, I.2, I.3
A(x) = Symbolic
Combinatorial
anmethods
x , B(x) = bn x n
Structures n≥0 n≥0
FS: Part A.1, A.2
Comtet74
be3 two
21 GF.II.1, II.2, II.3 Labelled structures I
Handout #1
Definition: the sum of two GF. The GF C (x) = A(x) + B(x) is defined by
parameters Parameters X
6 12 IV.1, IV.2
FS A.III
C (x) = A(x)Multivariable
(self-study) + B(x)GFs= (an + bn)x n.
7 19 IV.3, IV.4 Analytic Methods Complex Analysis n≥0
IV.5 V.1
Stanley 99: Ch. 6
Definition:
9 Nov 2 GF Cmethods
scaling a GF. TheAsymptotic (x) = kA(x)
Asst #2 Dueis defined by
Handout #1
(self-study)
9 VI.1 XSophie
10
12 A.3/ C C (x) =Introduction
kA(x)to = Prob. (kan)x n.
Mariolys
18 IX.1 Limit Laws and Comb

n≥0Marni
11
and Limit Laws
Definition: CombinatorialThe GF C (x) = A(x) × B(x) is defined
IX.3 the product of two GF.
FS: Part C
23 Mariolys
(rotating
12
presentations)
by 25 IX.4 Continuous Limit Laws (Marni )
n
Quasi-Powers and
X X
13 30 IX.5
C (x) = A(x) × Gaussian = laws Sophie ak bn−k x n.
B(x) limit
n≥0 k=0
Definition: substituting variables in a GF. Let k, ` be two integers. Then

the GF C (x) = A(kx ` ) is defined by
X
`
C (x) = A(kx ) = (k nan)x `n.
n≥0
Example.
Week Date IfSections
from FS2009
Part/ References Topic/Sections Notes/Speaker
1 1
1 Sept 7 A(x) =Symbolic methods
I.1, I.2, I.3 , B(x) =
Combinatorial
2 14 I.4, I.5, I.6
1−x Structures
(1 − x)2
FS: Part A.1, A.2
Comtet74
3 21is C II.1,
(x)II.2,=II.3 A(x) + B(x)? Labelled structures I
what Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Example.
Week Date IfSections
from FS2009
1 1
1 Sept 7 A(x) =Symbolic methods
I.1, I.2, I.3 , B(x) =
Combinatorial
2 14 I.4, I.5, I.6
1−x Structures
(1 − x)2
FS: Part A.1, A.2
Comtet74
3 21is C II.1,
(x)II.2,=II.3 A(x) × B(x)? Labelled structures I
what Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Example.
Week Date Sections canPart/
from FS2009
How weReferences
find that Topic/Sections Notes/Speaker
the GF of binary sequences is
1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods1
Structures
FS: Part A.1, A.2 1 − 2x
Comtet74
Handout #1
4 28
without II.4, II.5, II.6
much effort? (self study) Labelled structures II
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Summary.
Week Date Sections
from FS2009
Part/ References
That is all for now forTopic/Sections
the calculus Notes/Speaker
of GF.
1 Sept 7 I.1, I.2, I.3
Combinatorial Symbolic methods
Structures
We know two simple GF:
FS: Part A.1, A.2
Comtet74
3
For 1,21 1, 1,II.1,.II.2,
. .II.3, i.e. a = 1, n ≥
Labelled structures I
Handout
0 we have n #1
Combinatorial Combinatorial 1
5 Oct 5 III.1, III.2
parameters A(x) =
Parameters
Asst #1 Due
FS A.III (1 − x)
7 19 IV.3, IV.4
Analytic Methods Complex Analysis
For
8
0,
26
1, 2, 3, . . . , i.e.PartaB:nIV,=
FS: V, VI n, n ≥ 0 we have
Singularity Analysis
Appendix B4
IV.5 V.1
Stanley 99: Ch. 6
9 Nov 2 Asymptotic methods 1Asst #2 Due
Handout #1
9 VI.1
(self-study) A(x) =
10 (1 −Sophie
x)2

11
20 IX.2 Random Structures
We can perform four operationsDiscrete
on Limit
GF:Laws Sophie
and Limit Laws
23C (x)
IX.3= A(x) + B(x) Mariolys
12
Sum:
presentations)
Product: C (x) = A(x)B(x)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws
14 Dec 10
Scaling: C (x) = kA(x) Presentations Asst #3 Due
Substitution: C (x) = A(kx ` )
We will be able to design more complex GF from this.

Recurrences
Week Date and Generating
Sections
from FS2009
Part/ References Functions
Topic/Sections Notes/Speaker

Structures
2 14to get
I.4, I.5,
aI.6better understanding Unlabelledofstructures
FS: Part A.1, A.2
Now what we can do with GFs, we get back
Comtet74
to3 a 21problem
II.1, II.2, which
II.3 is fresh inLabelled our structures
Handout #1 memory: I solving recurrence relations. The
nice property of GFs is that we can handle in a unique framework both the
5 Oct 5 III.1, III.2 and non-homogeneous case. Asst #1 Due
homogeneous parameters Parameters
FS A.III
n
P
Example.
7 19 IV.3, IV.4
Consider a
Analytic0Methods
= 1, a −
nComplex Analysis
2a n−1 = 0 n ≥ 1 and let A(x) = n≥0 an x .
We8 can
26
IV.5 V.1
multiply Appendixterm
each B4 Singularity
of the Analysis
recurrence by x n
Stanley 99: Ch. 6
Handout #1
(self-study) n
10
9 VI.1 (an − 2an−1)x =Sophie
0n≥1
Then18we can
IX.1 sum over the values Limit Laws n Comb
of and Marni
for which the recurrence holds:
11
20 IX.2 Random StructuresXDiscrete Limit Laws Sophie
and Limit Laws n
FS: Part C n −
Combinatorial
(a 2a n−1 )x =0
23 IX.3 Mariolys
(rotating
12
presentations) n≥1instances of discrete
We
13
can
30
split
IX.5
this GF of the leftQuasi-Powers
hand-side and inSophie
two:
Gaussian limit laws
   
X X
n
 anx −  2an−1x n = 0
n≥1 n≥1
Now we want to use this equation to try to find a formula for A(x). So we need
to “see” A(x) in the equation above
Week have
Date Sections Part/ References Topic/Sections Notes/Speaker
from FS2009
We    
1 Sept 7 I.1, I.2, I.3 Symbolic
n  methods
X X
2 14 I.4, I.5, I.6
Combinatorial
Structures
 −structures 2an−1x n = 0
anx Unlabelled 
FS: Part A.1, A.2
Comtet74 n≥1 n≥1
Handout #1
(self study)
4
The 28
first II.4, II.5, is
sum A(x):structures II
II.6 almost the GF Labelled
 
FS A.III X
6 12 IV.1, IV.2 (self-study) Multivariable
(A(x) − a0) −  GFs
2an−1x n = 0
n≥1
IV.5 V.1
Stanley 99: Ch. 6
9
For Nov 2 second sum it is a little
the Asymptotic
trickiermethodsbut Asst
Handout #1 can see A(x):
we#2 Due
(self-study)
9 VI.1  Sophie 
10
12 A.3/ C Introduction to Prob.
X Mariolys
n−1 
18 IX.1 (A(x) − a0)Limit
− Laws
2x andComb aMarnin−1 x =0
11
20 IX.2 Random Structures Discrete Limit Laws
n≥1 Sophie
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Through a change of the summation index we obtain
25 IX.4 Continuous Limit Laws Marni 
Quasi-Powers and X
13 30 IX.5 Sophie
Gaussian limit laws
(A(x) − a0) − 2x  anx n = 0
n≥0
(A(x) − 1) − 2xA(x) = 0
Now we factor A(x) and move the constant term to the right hand-side
A(x) (1 − 2x) = 1
And we obtain what we are looking for, a closed form for A(x):
= (1 − 2x)−1
1
A(x) =
(1 − 2x)
So now we have a formula for A(x), which is considered as a solution to the

recurrence, as to obtain an we only need to do coefficient extraction:
an = [x n]A(x).
The
Week general
Date case.
Sections
from FS2009

Structures
2 14 I.4, I.5, I.6 C a + C1aUnlabelled
FS: Part C2an−2 = g(n), n ≥ 2
n−1 +structures
0 A.1,
n A.2
Comtet74
Handout #1
4 28 II.4, II.5, II.6
(C a + C1Labelled
(self study)
0 n + C2IIan−2) x n = g(n)x n
an−1structures
X X
Combinatorial Combinatorial n n
5 Oct 5 III.1, III.2 a
parameters
(C 0 n + C1 a n−1
Parameters
+ C2 an−2 x
Asst)#1 Due = g(n)x
FS A.III
6 12 IV.1, IV.2 n≥2
(self-study) Multivariable GFs n≥2
     
FS:nPart B: IV, V, VI
X X X
n
8 26  IV.5 V.1 C0a x  +  nStanley 99:B4Ch. 6
Appendix Singularity Analysis
C1an−1x  +  C2an−2x n = G(x)
9 Nov 2 Asst #2 Due
n≥2 Handout #1 n≥2Asymptotic methods n≥2
(self-study)
9 VI.1 Sophie
10
     
12 A.3/ C
X XIntroduction to Prob. Mariolys X
n n
11
18 C0 IX.1
 anx + C1 Limit Laws
 an−1 x Marni
and Comb + C2  an−2x n = G(x)
n≥2 and Limit Laws
n≥2 n≥2
FS: Part C
Combinatorial
23 IX.3 Mariolys
   
(rotating
12 X presentations) X
Continuous Limit Laws n 
25 IX.4
C0 (A(x) − a0 − a1x) + C1  an−1x Marni
+ C2  an−2x n = G(x)
Quasi-Powers and
13 30 IX.5 n≥2limit laws Sophie n≥2
Gaussian

   
X X
n−1 
C0 (A(x) − a0 − a1x) + xC1  an−1x + x C2 
2
an−2x n−2 = G(x)
n≥2 n≥2
   
X X
n
C0 (A(x) − a0 − a1x) + xC1  anx + x C2 
2
anx n = G(x)
n≥1 n≥0
Version of: 11-Dec-09 0 C (A(x) − a − a x) + xC (A(x) − a0) + x 2C2A(x) = G(x)
0 1 1

A(x) C0 + C1x + C2x = G(x) + C0a0 + (C0a1 + C1a0)x
2
G(x) + C0a0 + (C0a1 + C1a0)x

A(x) =
C0 + C1x + C2x 2
Week Date Sections

Theorem. If a0, a1,Part/
from FS2009
a2References Topic/Sections
, . . . is defined by theNotes/Speaker
recurrence
2 14 I.4, I.5, I.6

C a + C1an−1 + C2an−2 = g(n), n ≥ 2
Structures
0 n
FS: Part A.1, A.2
Comtet74
3 21 II.1, II.2, II.3
anx nLabelled structures I
P
then the GF A(x) = Handout #1
(self study)n≥0
is defined by

parameters
G(x)Combinatorial
Combinatorial + C0a0 + (CAsst
Parameters
0 a#11 Due
+ C1a0)x
A(x) =
FS A.III

6 12 IV.1, IV.2 (self-study) C0 +GFsC1x + C2x
Multivariable
2

and so FS: Part B: IV, V, VI
8 26 Singularity Analysis
IV.5 V.1 G(x)
Appendix B4 + C0a0 + (C0a1 + C1a0)x
Stanley 99: Ch. 6n
9 Nov 2 a = [x ] Asymptotic methods Asst #2 Due 2
n #1
Handout
9 VI.1
(self-study) C0 + C1xSophie+ C2x
10

Remarks.
11
and Limit Laws
FS: Part C
Combinatorial
23 good IX.3 exercise to make sure you understand Mariolys
(rotating
12
1. A this computation, is to redo
presentations)
it25 for aIX.4 recurrence whose initial
Continuous terms Marni ak and ak+1 for an arbitrary k.
Limit Laws are
Quasi-Powers and
13 30 IX.5 Sophie
2. If this GF is nice (it depends Gaussian
onlimitG(x)),
laws then the coefficient extraction tech-
14 Dec 10
niques of the next Presentations
section give us an quite Asst #3 Due
easily, much more easily than
the recurrences solving methods of the previous chapter.
3. What is nice is that we have a general result, that applies to homogeneous
and non-homogeneous recurrences and avoids to deal with complex numbers
if ∆ < 0 or the tedious case analysis that we had to go through for non-
homogeneous recurrences.
Example.
Week Date Sections
from FS2009
Consider Part/
theReferences Topic/Sections
recurrence Notes/Speaker
1 Sept 7 I.1, I.2, I.3

3, a = 7, Symbolic
a0 =Combinatorial
Structures 1
an =methods
5an−2 − 6an−1 + 2, n ≥ 2
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Link
Week with
Date the
Sections
from FS2009
characteristic
Part/ References polynomial.
Topic/Sections Notes/Speaker
We can finally understand why the
1
roots α and β ofCombinatorial
Sept 7 I.1, I.2, I.3
the characteristicSymbolic methods
polynomial play such a role in solving
Structures
FS: Part A.1, A.2
recurrences.
Comtet74
Handout #1
Fact
4
1. If II.4, II.5, II.6
28 (self study) Labelled structures II

C r + CCombinatorial
Combinatorial0 1 r + C2 = (rAsst
2
−#1α)(r
Due
− β)
FS
2 A.III
6
then 12 IV.1,by
divide IV.2 1/r andGFssubstitute x for 1/r and you obtain
Multivariable
on both sides (self-study)
8 26
C + C1x Singularity
FS: Part B: + C2xAnalysis
0 IV, V, VI
2
= (1 − αx)(1 − βx)
Appendix B4
IV.5 V.1
Stanley 99: Ch. 6
So A(x) can be rewritten as Handout #1
(self-study)
9 VI.1 Sophie
10
12 A.3/ C G(x) + C0a0 +Introduction
(C0a1 to+Prob. C1aMariolys
0 )x A1(x) A2(x)
18
A(x)
IX.1
= Limit Laws and Comb Marni
= +
11 (1 − αx)(1 − βx) (1 − αx) (1 − βx)
and Limit Laws
for some
23
AIX.31(x) and A (x) that we
Combinatorial FS: Part
2C
will learn Mariolys
to get later.
12
presentations)
Fact 252. The
IX.4 coefficient extraction
Continuous Limit Laws Marni
techniques will tell us that
Quasi-Powers and
13 30 IX.5 Sophie
[x ](1 − αx)−1 = α n
n
Gaussian limit laws
[x n](1 − αx)−2 = nα n
Putting both facts together, we understand where the terms α n and β n stem
from.
For the case where α = β, we have
G(x) + C a + (C a + C a0)x
Dr. Marni MISHNA, Department of Mathematics, SIMON
0 0 FRASER0UNIVERSITY A1(x) A2(x)
Version of: 11-Dec-09 A(x) =
1 1
= +
(1 − αx)2 (1 − αx) (1 − αx)2
and coefficient extraction explains us why we see the nα n factor appear.
Coefficients
Week Date extraction
Sections
from FS2009
2
Now 14we are
I.4, I.5, I.6 question: given a GF A(x), how can we
Structures
looking at the following FS: Part A.1, A.2
Comtet74
3 21
deduce a II.1, II.2, II.3
formula Labelled structures
for the associated Handout #1
I
sequence a0, a1, a2 . . . ? In a sense, we
want to reverse-engineer the GF.
Definition (reminder). Let FS A.III
X
7 19 IV.3, IV.4 Analytic Methods A(x) =
Complex Analysis anx n
IV.5 V.1 n≥0
Stanley 99: Ch. 6
Handout #1
We denote also an by
be a9 GF. VI.1 (self-study)
Sophie
10
n
[x ]A(x)
11
to be read as the and Limit Laws
coefficient of the monomial of degree n in the A(x).
23 IX.3 Mariolys
12
presentations)
What25we aimIX.4 at is the following: Continuous Limit Laws
if A(x) canMarni
be obtained from the set of known
Quasi-Powers and
13 30 GF IX.5using the calculus operations introduced Sophie
simple Gaussian limit laws previously (sum, product,
14 Dec 10
substitution), how can Presentations
we also trace through Asst #3 Due
these operations the formula for
the coefficients an of A(x)?

Computational
Week Date Sections techniques.
from FS2009
We1 first
Sept 7 establish
I.1, I.2, I.3 aCombinatorial
correspondance Symbolic methods
between all the operations we did introduce
Structures
on2 GF14 and I.4, I.5,
their I.6
FS: Part A.1, A.2
coefficients. Unlabelled structures
Comtet74
A few simple but Handout useful
(self
#1
study)
rules.
Let
X X
Parametersn
parameters
FS A.IIIA(x) = anx , B(x) = anx n
n≥0 n≥0
be8 two FS: Part B: IV, V, VI
26 Singularity Analysis
GF.
Appendix B4
IV.5 V.1
Stanley 99: Ch. 6
1.9 (Sum
Nov 2 rule).
Handout #1 Asymptotic methods Asst #2 Due
(self-study)
9 VI.1 Sophie
10 n n
12 A.3/ C [x ](A(x) + B(x))
Introduction
=to([x
Prob. ]A(x)) + ([x n]B(x))
Mariolys

11
20 IX.2 rule). Random Structures Discrete Limit Laws Sophie
and Limit Laws
2. (Product
23 IX.3
12
(rotating
presentations)
X Mariolys n
n
25 IX.4 [x ](A(x) × B(x))
Continuous ([x k ]A(x))([x
= Limit Laws Marni
n−k
]B(x))
Quasi-Powers
k=0 and
13 30 IX.5 Sophie
Gaussian limit laws

3. (Power rule).
[x n]A(kx) = k n([x n]A(x))
4. (Reduction rule).
[x n](kx mA(x)) = k[x n−m]A(x)

Examples.
Week Date Sections
from FS2009

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws


from FS2009

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Week Date Sections Part/ References

An extended from FS2009
binomial theorem. Topic/Sections Notes/Speaker
1
Let nSeptbe7 an
I.1, I.2,arbitrary
I.3 Combinatorial
real number methodsk be a positive integer. Then
Symbolicand
2 14 Structures
I.4, I.5, I.6
FS: Part A.1, A.2
3 21 II.1, II.2, II.3
n Comtet74 n(n − − · · ·
Labelled structures I
1)(n 2) (n − k + 1) n
Handout
= #1 , =1
4 28 II.4, II.5, II.6k (self study) k! II
Labelled structures 0
Combinatorial
Combinatorial
k parameters
n n Parameters
n
X n k
6 12 IV.1, IV.2
[x ](1 + x)
FS A.III
=
(self-study)
orMultivariable GFs
equivalently (1 + x) = x .
k k
7 19 IV.3, IV.4 Complex Analysis
k≥0
Analytic Methods
It8 follows
26 that, for m and n positive integers and a a real number, we have:
Singularity Analysis
Appendix B4
IV.5 V.1
Stanley 99: Ch. 6
9 Nov 2
n Asst
Asymptotic methods
Handout #1
#2 Due
9 VI.1
n
(self-study)
X
Sophie k k
10 (1 + ax)n = a x
12 A.3/ C Introduction to Prob. k
Mariolys
k=0
11
20 IX.2 Random Structures n Sophie
Discrete Limit Laws

and Limit Laws m n
X n km
23 IX.3
FS: Part C x ) =
(1 + Combinatorial Mariolys
x
12
(rotating instances of discrete k
presentations) k=0
25 IX.4 Continuous Limit Laws
Marni
n+1 n
13 30 IX.5
1 − x
Quasi-Powers and
X
k
Sophie
Gaussian limit=
laws x
14 Dec 10
(1 − x)
Presentations k=0Asst #3 Due
X
xk
1
=
(1 − x)
k≥0
X
ak x k
1
=
(1 − ax)
k≥0

X −n X
1 k k n + k − 1 km
Version of: 11-Dec-09 x x
(1 + x)n
= = (−1)
k k
k≥0 k≥0
X −n X n + k − 1
1 k km
x
(1 − x)n
= (−x) =
k k
k≥0 k≥0
Examples.
Week Date Sections
from FS2009

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws


from FS2009

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

Applications.
Week Date Sections
from FS2009
We1 have
Sept 7 now
I.1, I.2, I.3all the
Combinatorial
tools we need Symbolic methods
to extract coefficients from a GF defined as
Structures
a 2sum14 of simple
I.4, I.5, I.6 GFFS: Part
ofA.1,the
A.2 form
Comtet74
Handout #1 m1
4 28 II.4, II.5, II.6 (self study) kLabelled
1 x structures II k` x m`
A(x) = + ··· + .
Combinatorial p1x)n1
(1 +Combinatorial Asst #1 Due
(1 + p ` x)n`
FS A.III
6 12
Indeed, byIV.1,the
IV.2 sum rule (self-study) Multivariable GFs

m1 Analysis
m`

8 26 Appendix B4 kSingularity
1x k ` x
9 Nov 2 [x c ]A(x) =
IV.5 V.1 c
· ·#2+Due [x c ]
[x ] Asymptotic nmethods+ ·Asst
Stanley 99: Ch. 6
Handout #1
(self-study)
(1 + p1x) 1 (1 + p` x)n`
9 VI.1 Sophie
10
Then,12 we A.3/
can C consider each coefficient
Introduction to Prob. Mariolys
extraction independently and apply the
11
extended binomial theorem to each.
and Limit Laws
FS: Part C m m
23 IX.3
(rotating c kx
Combinatorial
instances of discrete cMariolys x
12
presentations) = k[x ]
px)nLimit Laws Marni (1 + px)n
[x ]
25 IX.4 Continuous
(1 +
Quasi-Powers and
13 30 IX.5 c < m the coefficient is 0 so weSophie consider now that c ≥ m.
note that if Gaussian limit laws

m
x
k[x c ] c−m 1
k[x
(1 + px)n (1 + px)n
= ]

n − m) − n − c m
k[x c−m] = k(−p)c−m = k(−p)c−m
1 + (c 1 + + 1
(1 + px)n c−m c−m
So all together:

n c − m −
[x c ]A(x) = k1(−p1)c−m1
+ 1
+ ···
1 1
c − m1

n` c − m ` −
+ k` (−p` )c−m`
+ 1
.
c − m`
Example.
Week Date Sections
from FS2009

Structures 3x 4
2x 1
A(x) =
FS: Part A.1, A.2
Comtet74
− +
3 21 II.1, II.2, II.3
Handout #1
x/3structures
1 +Labelled 1− I 2x (1 − 2x)2
Then
FS A.III
6 12 IV.1, IV.2 (self-study) Multivariable GFs 4
[xIV.3,c ]A(x) c
− [x c ] + [x c ]
2x 1 3x
7 19 IV.4 Complex Analysis
=Analytic[xMethods
]
1 + x/3
1 − 2x (1 − 2x)2
IV.5 V.1
Stanley 99: Ch. 6
9
and Nov 2 can work on the three Asymptotic
we coefficient methods Asst #2 Due
extractions independently.
Handout #1
(self-study)
1.10 9 VI.1 Sophie
12 A.3/ C 2x Introduction to Prob. Mariolys

[x c ] = 2[x c−1]
1
, c≥1
11
18 IX.1 1 + x/3
Limit Laws and Comb 1 Marni
+ x/3
20 IX.2 Random
Structuresc−1 Discrete Limit Laws Sophie c−1
−1
and Limit
FS: Part C
Laws 1 + (c
Combinatorial
− 1) − 1 −1
23 IX.3 Mariolys
= 2 = 2
12
presentations)
3 c−1 3
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws
2.
14 Dec 10 Presentations 1+c−1 Asst #3 Due
[x c ] = 2c = 2c
1
1 − 2x c
3.
3x 4 c
c−4 1
[x ] = 3[x ] , c≥4
(1 − 2x)2 (1 − 2x)2

− − c −
= 3 × 2c−4SIMON FRASER UNIVERSITY
Dr. Marni MISHNA, Department of Mathematics,
= 3 × 2c−4
2 + (c 4) 1 3
c−4 c−4
So
c−1
−1
[x c ]A(x) = 2 − 2c + 3 × 2c−4
5
3 c−4
Partial
Week DateFraction
Sections
from FS2009
Decomposition.
1
The Sept 7 coefficient
last I.1, I.2, I.3 Combinatorial Symbolic methods we will introduce deals with rational
extraction techniques
Structures
GF.
2 14 I.4, I.5, I.6
FS: Part A.1, A.2
Comtet74
Definition. A GFHandout A(x)
(self
#1
study)
is rational if there exists two polynomials p(x) and
q(x) such that Combinatorial Combinatorial
parameters Parameters p(x)
6 12 IV.1, IV.2
FS A.III
(self-study)
A(x) =
Multivariable GFs
.
q(x)
8
Our 26
goal Singularity
with this technique is Analysis
to transformAppendix B4
a GF into the form seen at the
IV.5 V.1
Stanley 99: Ch. 6
9 Nov 2 slide, where we described
previous AsymptoticA(x)
methodsas Asst
Handout #1
a sum#2 Due of rational GF.
(self-study)
9 VI.1 Sophie
10
The general idea will be to describe a technique to transform
18 IX.1 Limit Laws and Comb
11 1Marni
20 IX.2 Random Structures A(x)
Discrete
= Limit Laws Sophie 2
and Limit Laws
FS: Part C
(x − 3)(x − 2)
Combinatorial
23 IX.3 Mariolys
12
presentations)
25 IX.4
1 Continuous Limit
1 Laws 1Marni
into
−1 −1 1
13 30 IX.5
A(x) Quasi-Powers and
(1 − Sophie
= + +
3 (1 − x/3) Gaussian limit2laws x/2) 4 (1 − x/2)2
14 Dec 10 Presentations
and then to apply the coefficient extraction Asst #3 Due
rules seen previously.
The important rule is the following: if the factorization of q(x) contains a term
(x + a)k , then the Partial Fraction Decomposition of A(x) = 1/q(x) contains
terms
A1 A2 Ak
· · ·
(x + a)k
+ + +
(x + a) (x + a)2
Dr. Marniwe
MISHNA,
and need Department of Mathematics,
to find the SIMON FRASER
values A1, A2, . . . , Ak .
ofUNIVERSITY
To do so, we will set up a system of equations in all the unknowns and solve it.
Example.
Week Date Sections
from FS2009

Structures
1
FS: Part A.1, A.2 A(x) =
3 21 II.1, II.2, II.3
Comtet74
Handout #1
(x − 3)(x
Labelled structures I − 2)2
and we want to find A, B1 and Labelled
B2 such structures II
that
FS A.III
6 12 IV.1, IV.2 (self-study)
1 MultivariableA
GFs B1 B2
= + +
7 19 IV.3, IV.4 − 3)(x
(xAnalytic − 2)2Complex(xAnalysis
Methods − 3) (x − 2) (x − 2)2
So9 we
Nov 2
IV.5 V.1
multiply both sides by q(x) = (x − 3)(x − 2)2 which gives
Stanley 99: Ch. 6
Asst #2 Due
Handout #1 Asymptotic methods
(self-study)
9 VI.1 Sophie
10
12 A.3/ C 1 = A(x − 2)2 Introduction
+ B1(xto Prob.
− 3)(xMariolys
− 2) + B2(x − 3)
11
20
We can IX.2
expand allRandom Structures to Discrete
products obtain Limit Laws Sophie
and Limit Laws
23 IX.3 Mariolys
12
presentations) 2
25 IX.41 = (a + B1)x + (−4A −Limit
Continuous 5BLaws B2)x + (4A + 6B − 3C )
1 +Marni
Quasi-Powers and
13 30 IX.5 Sophie
which implies Gaussian limit laws
the following system

 1 = 4A + 6B1 − 3B2
0 = −4A − 5B1 + B2
0 = A + B1

This is a system of three equations, with three unknowns, that can be solved
and give:
A = 1, B1 = −1, B2 = −1
So we have
1 1 −1 −1
A(x) = = + +
(x − 3)(x − 2)2 (x − 3) (x − 2) (x − 2)2
Week Date Sections

therefrom can Part/ References Topic/Sections extraction
Notes/Speaker as previously:
FS2009
From we then apply coefficient
1 Sept 7 I.1, I.2, I.3 Combinatorial
Symbolic
methods
2 14 I.4, I.5, n
I.6
Structures
n 1Unlabelled structures n −1 −1
FS: Part A.1, A.2
Comtet74
[x ]A(x) = [x ] + [x ] +
3 21 II.1, II.2, II.3
Handout #1
(x −Labelled
3) structures I (x − 2) (x − 2)2
We process the three coefficientLabelled structures II
extractions independently.
FS A.III
6 12 IV.1, IV.2 (self-study) −1GFs
Multivariable −1
[x n] = [x nComplex [x n]
1 1
7 19 IV.3, IV.4
] Analysis =
(x −Methods
Analytic 3)
3(1 − x/3) 3 1 − x/3
IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11 −1
20 IX.2
[x nRandom Structures n
Discrete Limit Laws Sophie n
1 1 1
and Limit Laws
] = [x ] = [x ]
Part−
FS:(x C 2) 2(1 − x/2) Mariolys 2
Combinatorial 1 − x/2
23 IX.3
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws

−1 −1 −1 −1
[x n] n n
[x n]
1
= [x ] = [x ] =
(x − 2)2 ((−2)(1 − x/2))2 4(1 − x/2)2 4 (1 − x/2)2

Example.
Week Date Sections
from FS2009

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws


from FS2009

Structures
FS: Part A.1, A.2
Comtet74
Handout #1
FS A.III

IV.5 V.1
Stanley 99: Ch. 6
Handout #1
(self-study)
9 VI.1 Sophie
10

11
and Limit Laws
23 IX.3 Mariolys
12
presentations)
Quasi-Powers and
13 30 IX.5 Sophie
Gaussian limit laws


201 GF

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

201 GF

Загружено:

Авторское право:

Доступные форматы

f ac u lty of sci ence MATH 895-4 Fall 2010

d ep ar tment of m athemat ics Course Schedule

Week Date Sections Part/ References Topic/Sections Notes/Speaker

1 Sept 7 I.1, I.2, I.3

7 19 IV.3, IV.4 Complex Analysis

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods

“A2 generating Structures

18 IX.1 Limit Laws and Comb Marni

We could also define bn through a first-order linear recurrence relation: b0 =

Week Date Sections

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

14 Dec 10 Presentations Asst #3 Due

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

14 Dec 10 Presentations Asst #3 Due

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

Week Date Sections Part/ References

18 IX.1 Limit Laws and Comb

Definition: substituting variables in a GF. Let k, ` be two integers. Then

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

14 Dec 10 Presentations Asst #3 Due

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

14 Dec 10 Presentations Asst #3 Due

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

14 Dec 10 Presentations Asst #3 Due

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

18 IX.1 Limit Laws and Comb Marni

Substitution: C (x) = A(kx ` )

We will be able to design more complex GF from this.

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods

So now we have a formula for A(x), which is considered as a solution to the

1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods

14 Dec 10 Presentations Asst #3 Due

G(x) + C0a0 + (C0a1 + C1a0)x

Week Date Sections

2 14 I.4, I.5, I.6

5 Oct 5 III.1, III.2

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

1 Sept 7 I.1, I.2, I.3

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

18 IX.1 Limit Laws and Comb Marni

14 Dec 10 Presentations Asst #3 Due

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

5 Oct 5 III.1, III.2

7 19 IV.3, IV.4 Analytic Methods Complex Analysis

14 Dec 10 Presentations Asst #3 Due

1 Sept 7 I.1, I.2, I.3 Combinatorial Symbolic methods

Dr. Marni MISHNA, Department of Mathematics, SIMON FRASER UNIVERSITY

18 IX.1 Limit Laws and Comb Marni

18 IX.1 Limit Laws and Comb Marni