This preview shows page 1. Sign up to view the full content.
Unformatted text preview: of [ n ] with precisely k inversions. Prove that ( n 2 ) s k =0 I ( n, k ) x k = (1 + x )(1 + x + x 2 )(1 + x + x 2 + x 3 ) ยทยทยท (1 + x + ยทยทยท + x n-1 ) . 4 Let G be a simple graph on the vertices [ n ] in which each vertex has degree 2. Prove that G is a union of disjoint cycles. 5 Let g ( n ) denote the number of graphs on the vertices [ n ] which are unions of disjoint cycles. a. Prove that the exponential generating function for g ( n ) is e-x/ 2-x 2 / 4 โ 1-x . b. Explain why the generating function in part (a) is diFerent from the exponential generating function for n !, even though permutations are also unions of disjoint cycles on the set [ n ]....
View Full Document
This note was uploaded on 12/10/2011 for the course MAD 4203 taught by Professor Vetter during the Fall '10 term at University of Florida.
- Fall '10