Enumerative Combinatorics: Volume 1

Front Cover
Cambridge University Press, 1997 - Mathematics - 340 pages
Publisher 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

XI
64
XIV
67
XV
71
XVI
74
XVII
76
XVIII
79
XIX
82
XX
85
XXII
86
XXIII
90
XXIV
96
XXV
100
XXVI
102
XXVII
105
XXVIII
110
XXIX
113
XXX
116
XXXI
117
XXXII
124
XLI
152
XLII
153
XLIII
174
XLIV
202
XLV
204
XLVI
208
XLVII
210
XLVIII
211
XLIX
221
L
241
LI
260
LII
263
LIII
264
LIV
275
LV
293
LVI
296
LVII
307
LVIII
319
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information