1. CSM Week 1: Introductory Cross-Disciplinary Seminar Combinatorial Enumeration Dave Wagner University of Waterloo

2. CSM Week 1: Introductory Cross-Disciplinary Seminar Combinatorial Enumeration Dave Wagner University of Waterloo I. The Lagrange Implicit Function Theorem and Exponential Generating Functions

3. CSM Week 1: Introductory Cross-Disciplinary Seminar Combinatorial Enumeration Dave Wagner University of Waterloo I. The Lagrange Implicit Function Theorem and Exponential Generating Functions II. A Smorgasbord of Combinatorial Identities

4. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem

5. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem 2. Exponential Generating Functions

6. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem 2. Exponential Generating Functions 3. There are rooted trees (two ways)

7. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem 2. Exponential Generating Functions 3. There are rooted trees (two ways) 4. Combinatorial proof (sketch) of LIFT

8. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem 2. Exponential Generating Functions 3. There are rooted trees (two ways) 4. Combinatorial proof (sketch) of LIFT 5. Nested set systems

9. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem 2. Exponential Generating Functions 3. There are rooted trees (two ways) 4. Combinatorial proof (sketch) of LIFT 5. Nested set systems 6. Multivariate Lagrange

10. I. LIFT and Exponential Generating Functions 1. The Lagrange Implicit Function Theorem 2. Exponential Generating Functions 3. There are rooted trees (two ways) 4. Combinatorial proof (sketch) of LIFT 5. Nested set systems 6. Multivariate Lagrange

12. The human mind has never invented a labor-saving device equal to algebra. -- J. Willard Gibbs

14. 1. The Lagrange Implicit Function Theorem K: a commutative ring that contains the rational numbers. F(u) and G(u): formal power series in K[[u]]: Assume that

15. 1. The Lagrange Implicit Function Theorem K: a commutative ring that contains the rational numbers. F(u) and G(u): formal power series in K[[u]]: Assume that (a) There is a unique formal power series R(x) in K[[x]] such that

16. 1. The Lagrange Implicit Function Theorem (b) For this formal power series with the constant term is zero:

17. 1. The Lagrange Implicit Function Theorem (b) For this formal power series with the constant term is zero: For all n>=1 the coefficient of x^n in F(R(x)) is

18. 1. The Lagrange Implicit Function Theorem Proofs: (i) Complex analysis (Cauchy residue formula) [requires K=C and nonzero radii of convergence]

19. 1. The Lagrange Implicit Function Theorem Proofs: (i) Complex analysis (Cauchy residue formula) [requires K=C and nonzero radii of convergence] (ii) Algebraic (formal calculus, formal residue operator) [requires g_0 to be invertible in K]

20. 1. The Lagrange Implicit Function Theorem Proofs: (i) Complex analysis (Cauchy residue formula) [requires K=C and nonzero radii of convergence] (ii) Algebraic (formal calculus, formal residue operator) [requires g_0 to be invertible in K] (iii) Combinatorial (bijective correspondence)

21. 1. The Lagrange Implicit Function Theorem Proofs: (i) Complex analysis (Cauchy residue formula) [requires K=C and nonzero radii of convergence] (ii) Algebraic (formal calculus, formal residue operator) [requires g_0 to be invertible in K] (iii) Combinatorial (bijective correspondence)

22. 1. The Lagrange Implicit Function Theorem Proofs: (i) Complex analysis (Cauchy residue formula) [requires K=C and nonzero radii of convergence] (ii) Algebraic (formal calculus, formal residue operator) [requires g_0 to be invertible in K] (iii) Combinatorial (bijective correspondence)

24. 2. Exponential Generating Functions A class of structures associates to each finite set another finite set -- this is the set of A -type structures supported on the set X.

25. 2. Exponential Generating Functions A class of structures associates to each finite set another finite set -- this is the set of A -type structures supported on the set X. Simplified notation:

26. 2. Exponential Generating Functions A class of structures associates to each finite set another finite set -- this is the set of A -type structures supported on the set X. Simplified notation: Exponential generating function:

27. 2. Exponential Generating Functions Minimal requirements on a class of structures: * depends only on * If then

28. 2. Exponential Generating Functions Example: the class of (simple) graphs is the set of graphs with vertex-set Exponential generating function (no particularly useful formula)

29. 2. Exponential Generating Functions Example: the class of endofunctions is the set of all functions Exponential generating function (no particularly useful formula)

30. 2. Exponential Generating Functions Example: the class of permutations is the set of permutations on the set Exponential generating function

31. 2. Exponential Generating Functions Example: the class of cyclic permutations is the set of cyclic perm.s on the set Exponential generating function

32. 2. Exponential Generating Functions Example: the class of (finite) sets (“ensembles”) is the set of ways in which is a set. Exponential generating function

33. 2. Exponential Generating Functions Example: the class of sets of size k is the set of ways in which is a k-element set. Exponential generating function Especially important: the case k=1 of singletons…. has exp.gen.fn x.

34. 2. Exponential Generating Functions Notice that

35. 2. Exponential Generating Functions Notice that That is…

36. 2. Exponential Generating Functions Notice that That is… This suggests a relation among classes:

37. 2. Exponential Generating Functions Notice that That is… This suggests a relation among classes: A permutation is equivalent to a (finite unordered) set of (pairwise disjoint) cyclic permutations.

38. 2. Exponential Generating Functions

39. A permutation is equivalent to a (finite unordered) set of (pairwise disjoint) cyclic permutations.

40. 2. Exponential Generating Functions

41. An endofunction is equivalent to a set of disjoint connected endofunctions.

42. 2. Exponential Generating Functions A connected endofunction is equivalent to a cyclic permutation of rooted trees.

43. 2. Exponential Generating Functions A connected endofunction is equivalent to a cyclic permutation of rooted trees.

44. 2. Exponential Generating Functions A rooted tree is equivalent to a root vertex and a set of disjoint rooted (sub-)trees.

45. 2. Exponential Generating Functions A rooted tree is equivalent to a root vertex and a set of disjoint rooted (sub-)trees.

46. 2. Exponential Generating Functions The Exponential/Logarithmic Formula For classes A and B, If every B -structure can be decomposed uniquely as a finite set of pairwise disjoint A -structures, then

47. 2. Exponential Generating Functions The Exponential/Logarithmic Formula For classes A and B, If every B -structure can be decomposed uniquely as a finite set of pairwise disjoint A -structures, then and hence

48. 2. Exponential Generating Functions Example: Let Q be the class of connected graphs.

49. 2. Exponential Generating Functions Example: Let Q be the class of connected graphs. Since it follows that

50. 2. Exponential Generating Functions Example: Let Q be the class of connected graphs. Since it follows that More informatively, records the number of edges in the exponent of y.

51. 2. Exponential Generating Functions The Compositional Formula For classes A, B, and J: If every B -structure can be decomposed uniquely as a finite set Y of pairwise disjoint A -structures, together with a J -structure on Y, then

52. 2. Exponential Generating Functions Example: Let K be the class of connected endofunctions. Let R be the class of rooted trees.

53. 2. Exponential Generating Functions Example: Let K be the class of connected endofunctions. Let R be the class of rooted trees. Since it follows that

54. 2. Exponential Generating Functions Example: Let K be the class of connected endofunctions. Let R be the class of rooted trees. Since it follows that

55. 2. Exponential Generating Functions Sum of classes A and B An structure on X is either a red A -structure or a green B -structure on X.

56. 2. Exponential Generating Functions An structure on X

57. 2. Exponential Generating Functions An structure on X

58. 2. Exponential Generating Functions Sum of classes A and B The exp.gen.fn of is

59. 2. Exponential Generating Functions Product of classes A and B An structure on X is an A -structure on S and a B -structure on X\S (for some subset S of X).

60. 2. Exponential Generating Functions An structure on X

61. 2. Exponential Generating Functions Product of classes A and B The exp.gen.fn of is

63. 3. Counting Rooted Trees A rooted tree is equivalent to a root vertex and a set of disjoint rooted (sub-)trees.

64. 3. Counting Rooted Trees

65. From we deduce that

66. 3. Counting Rooted Trees From we deduce that LIFT applies with F(u)=u and G(u)=exp(u):

67. 3. Counting Rooted Trees From we deduce that LIFT applies with F(u)=u and G(u)=exp(u):

68. 3. Counting Rooted Trees From we deduce that LIFT applies with F(u)=u and G(u)=exp(u): Therefore

70. 5. Nested Set Systems A nested set system is a pair in which X is a finite set and is a set of subsets of X such that if and then either or or. Let N be the class of nested set systems. What is # N _n?

71. 5. Nested Set Systems A nested set system with vertex-set X.

72. 5. Nested Set Systems Let N be the class of nested set systems. What is # N _n?

73. 5. Nested Set Systems Let N be the class of nested set systems. What is # N _n? We’ll use the bivariate generating function

74. 5. Nested Set Systems Let N be the class of nested set systems. What is # N _n? We’ll use the bivariate generating function This is an exp.gen.fn in the indeterminate x and records in the exponent of y.

75. 5. Nested Set Systems A nested set system is proper if it does not contain any sets of size zero or one. Let M be the class of proper nested set systems

76. 5. Nested Set Systems A proper nested set system

77. 5. Nested Set Systems

79. A proper nested set system is equivalent to a set of disjoint blobs – each blob is a singleton or a “cell”.

80. 5. Nested Set Systems A cell is a proper nested set system for which -- Let Q be the class of cells.

81. 5. Nested Set Systems A proper nested set system is equivalent to a set of disjoint blobs – each blob is a singleton or a “cell”.

82. 5. Nested Set Systems

84. The “protoplasm” of a cell is a proper nested set system that is not empty, not a singleton, and not a cell. 5. Nested Set Systems

85. The “protoplasm” of a cell is a proper nested set system that is not empty, not a singleton, and not a cell. 5. Nested Set Systems

94. Let and

95. 5. Nested Set Systems

100. Therefore, the number of nested set systems on the vertex-set {1,2,…,n} is

101. n, ~ #N_n (up to k = 500) (k = 500 term of the series) 0, 2.000000000000000000000000000000000000000,.4083243888661365954428680604080286918931e-46 1, 3.999999999999999999999999999999999999997,.2041621944330682977214340302040143459465e-43 2, 16.00000000000000000000000000000000000000,.1020810972165341488607170151020071729732e-40 3, 127.9999999999999999999999999999999999998,.5104054860826707443035850755100358648663e-38 4, 1663.999999999999999999999999999999999951,.2552027430413353721517925377550179324331e-35 5, 30207.99999999999999999999999999999997499,.1276013715206676860758962688775089662165e-32 6, 704511.9999999999999999999999999999873828,.6380068576033384303794813443875448310827e-30 7, 20074495.99999999999999999999999999361776,.3190034288016692151897406721937724155414e-27 8, 675872767.9999999999999999999999967706124,.1595017144008346075948703360968862077707e-24 9, 26253131775.99999999999999999999836574318,.7975085720041730379743516804844310388536e-22 10, 1155636527103.999999999999999999172874000,.3987542860020865189871758402422155194268e-19 11, 56851643236351.99999999999999958132597320,.1993771430010432594935879201211077597134e-16 12, 3091106738733055.999999999999788049473799,.9968857150052162974679396006055387985669e-14 13, 184069292705185791.9999999998926879966856,.4984428575026081487339698003027693992835e-11 14, 11913835525552734207.99999994566012222874,.2492214287513040743669849001513846996417e-8 15, 832795579840760643583.9999724801012619416,.1246107143756520371834924500756923498209e-5 16, 62525006404716521848831.98606091920623040,.6230535718782601859174622503784617491043e-3 17, 5017971241212451282223096.938744559857556,.3115267859391300929587311251892308745523 18, 428697615765805738749850118.4015658433400, 155.7633929695650464793655625946154372761 19, 38844089835957753021198521986.64691355734, 77881.69648478252323968278129730771863803 5. Nested Set Systems

103. References A. Joyal Une theorie combinatoire des series formelles Adv. in Math. 42 (1981), 1-82. I.P. Goulden, D.M. Jackson “Combinatorial Enumeration” John Wiley & Sons, New York, 1983. F. Bergeron, G. Labelle, P. Leroux “Combinatorial Species and Tree-like Structures” Cambridge U.P., Cambridge, 1998. R.P. Stanley “Enumerative Combinatorics, volume II” Cambridge U.P., Cambridge, 1999.