ENGLISH

Enumerative combinatorics

By Richard P. Stanley , Sergey Fomin

Book information

Publisher
Cambridge University Press
Year
2001
ISBN
9780521789875, 0521789877
Open Library ID
OL7754023M
Language
english
Format
DJVU
Filesize
4 MB (3932492 bytes)
Edition
1
Pages
138\138
Library
Kolxo3
DPI
300
Time added
2009-07-20 03:45:11

Description

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.

Similar books