Enumerative Combinatorics: Volume 1 / Edition 1

Enumerative Combinatorics: Volume 1 / Edition 1

by Richard P. Stanley
     
 

ISBN-10: 0521553091

ISBN-13: 9780521553094

Pub. Date: 04/28/1997

Publisher: Cambridge University Press

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

Overview

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. An appendix by Sergey Fomin covers some deeper aspects of symmetric function theory including jeu de taquin and the Littlewood-Richardson rule. 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.

Product Details

ISBN-13:
9780521553094
Publisher:
Cambridge University Press
Publication date:
04/28/1997
Series:
Cambridge Studies in Advanced Mathematics Series, #49
Pages:
337
Product dimensions:
5.98(w) x 8.98(h) x 0.87(d)

Table of Contents

What is enumerative combinatorics?

Sieve methods

Partially ordered sets

Rational generating functions

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >