## Enumerative Combinatorics: Volume 1Publisher Description (unedited publisher data) This second volume of a two-volume basic introduction to enumerative combinatorics covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the only available treatment of this subject suitable for an introductory graduate course on combinatorics, and includes the important Robinson-Schensted-Knuth algorithm. Also covered are connections between symmetric functions and representation theory. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory, including jeu de taquin and the Littlewood-Richardson rule. As in Volume 1, the exercises play a vital role in developing the material. There are over 250 exercises, all with solutions or references to solutions, many of which concern previously unpublished results. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference. Library of Congress subject headings for this publication: Combinatorial enumeration problems. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

II | 1 |

III | 13 |

IV | 17 |

V | 31 |

VI | 40 |

VII | 42 |

IX | 43 |

X | 51 |

XXXIII | 126 |

XXXIV | 129 |

XXXV | 131 |

XXXVI | 133 |

XXXVII | 135 |

XXXVIII | 140 |

XXXIX | 147 |

XL | 149 |

### Other editions - View all

### Common terms and phrases

algebra appears Applied assume bijection blocks called Chapter choose Clearly coefficients combinatorial combinatorial proof complex compute condition consider contains convex Corollary corresponding covers cycles define definition denote denote the number determine diagram easily edge elements Enzo equal equation equivalent Eulerian Eulerian posets exactly Example Exercise exists fact factor Figure Find finite finite poset fixed follows formal formula function give given Hence identity inclusion instance integer interval inversion isomorphic lattice least Lemma length linear Math matrix maximal method Möbius function multiset Note obtain order ideal particular partitions permutations points polynomial positive power series problem proof properties Proposition proved rank rational references result satisfying sequence Show shown side simple solution space subsets Suppose Theorem theory tree unique values vector vertices write yields