Enumerative Combinatorics

Enumerative Combinatorics

Vol. 2

eBook - 1999
Rate this:
Cambridge Univ Pr
An introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.
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.

Publisher: Cambridge : Cambridge University Press, 1999
ISBN: 9781139811729
113981172X
9780521560696
0521560691
Characteristics: 1 online resource (xii, 581 pages)

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Recommendations

Subject Headings

  Loading...

Find it at WPL

  Loading...
[]
[]
To Top