Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
1 views

enumcomp2020-final

The document outlines a comprehensive examination for Enumeration, scheduled for June 18, 2020, with a total of 5 questions worth 100 points. Each question requires detailed proofs and derivations related to combinatorial identities, generating functions, endofunctions, cycles in graphs, and perfect matchings. Solutions will be evaluated on correctness, completeness, and quality of explanation, with an emphasis on describing any gaps in incomplete answers.

Uploaded by

Rogério
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

enumcomp2020-final

The document outlines a comprehensive examination for Enumeration, scheduled for June 18, 2020, with a total of 5 questions worth 100 points. Each question requires detailed proofs and derivations related to combinatorial identities, generating functions, endofunctions, cycles in graphs, and perfect matchings. Solutions will be evaluated on correctness, completeness, and quality of explanation, with an emphasis on describing any gaps in incomplete answers.

Uploaded by

Rogério
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Enumeration Comprehensive Examination

13:00 – 16:00, Thursday June 18, 2020


Kevin Purbhoo and David Wagner, examiners

There are 5 questions, worth a total of 100 points. Answer as many questions as
possible. Solutions will be evaluated based on correctness, completeness, and quality
of explanation. In case of an incomplete answer, a precise description of any gaps is
preferred.

1. Prove the following identities.


∞ ∞ 2
Y
j −1
X xk y k
(a) (1 − x y) = 1 + Qk . [8]
j=1 k=1 i=1 (1 − xi )(1 − xi y)
∞ ∞ 2
Y
2j−1
X xk y k
(b) (1 + x y) = 1 + Qk . [8]
j=1 k=1 i=1 (1 − x2i )

2. (a) Let α and x be indeterminates. Find a formal power series f (y) such that [8]
f (xe−x ) = eαx .
(Hint: y = xe−x implicitly determines x as a power series in y.)
(b) Let β be another indeterminate. From part (a) or otherwise, prove that [9]
n  
n−1
X n
(α + β)(n + α + β) = αβ (k + α)k−1 (n − k + β)n−k−1 .
k=0
k

3. Let Fn denote the set of all endofunctions φ : [n] → [n] of the set [n] = {1, 2, ..., n}.

(a) For φ ∈ Fn , let B(φ) = {1, φ(1), φ(φ(1)), ...} ⊆ [n], and let b(φ) = |B(φ)|. [7]
Prove that for integers 1 ≤ j ≤ n, the number of endofunctions φ ∈ Fn with
b(φ) = j is  
n−1
· j! · nn−j .
j−1
(b) For φ ∈ Fn , let fix(φ) = {v ∈ [n] : φ(v) = v} and p(φ) = |fix(φ)|. Consider [8]
the bivariate generating series
∞
X xn X p(φ)
F (x, y) = y .
n=0
n! φ∈F
n

xn
nn−1 n! . Find an expression for F (x, y) in terms f (x).
P
Let f (x) = n≥1
(c) For n ≥ 1, the average value of p(φ) among all endofunctions φ ∈ Fn is 1. [10]
(To see this, each endofunction φ is defined on n points, each of which is in
fix(φ) with probability 1/n.) Compute the average value of p(φ)2 among all
endofunctions φ ∈ Fn .

4. (a) Let cn,k denote the number of cycles of length k in the complete graph Kn . [8]
(Note that we have cn,k = 0 if k ≤ 2.) Obtain a closed formula for the
generating series
X xn y k
C(x, y) = cn,k .
n,k≥0
n!

(b) Let Gn be the set of all graphs with vertex set [n]. Suppose a graph G is [8]
chosen uniformly at random from Gn . Prove that the expected number of
 n
cycles in G is xn! C(x, 12 ).

5. As usual, for n ≥ N, let (2n − 1)!! = ni=1 (2i − 1). For a series of the form
Q

A(x) = n≥0 an xn , we let δx A(x) = a0 + n≥1 a2n (2n − 1)!! , whenever this latter
P P

sum is formally defined.


Note that the coefficients an above may be either constants or power series in
variables other than x. For example, δx (1 + xy + x2 y 2 ) = 1 + 3y 2 .

(a) Let M2n be the set of all perfect matchings in the complete graph K2n . Prove [4]
that |M2n | = δx (x2n ).
(b) Fix a matching M0 ∈ M2n . Using the Principle of Inclusion-Exclusion, or [10]
otherwise, prove that the number of matchings M ∈ M2n such that M ∩M0 =

∅ is δx (x2 − 1)n .
(c) Prove that the number of ordered triples (M1 , M2 , M3 ) ∈ M32n such that [12]
M1 ∩ M2 = M1 ∩ M3 = M2 ∩ M3 = ∅ is
 2n 
t
δx δy δz exp txyz + 12 t2 (2 − x2 − y 2 − z 2 ) .

2n!

You might also like