Vendeur
ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Vendeur AbeBooks depuis 2 juillet 2009
Missing dust jacket; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0534065465I4N01
Written for students with a basic knowledge of linear algebra and abstract algebra, this text contains a large number of exercises graded in difficulty, with solutions or references for almost all exercises. This book should be of interest to degree and diploma students taking courses in combinatorics in departments of mathematics and statistics.
Présentation de l'éditeur: 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.
Titre : Enumerative Combinatorics (The Wadsworth & ...
Éditeur : Springer
Date d'édition : 1986
Reliure : Hardcover
Etat : Very Good
Etat de la jaquette : No Jacket