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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
'This magnificent two-volume work is best described by a quote from Gian-Carlo Rota's Forward to Volume 2: I find it impossible to predict when Richard Stanley's two-volume exposition of combinatorics may be superseded. No one will dare try, let alone be able, to match the thoroughness of coverage, the care for detail, the definitiveness of proof, the elegance of presentation.' J. E. Graver
'As a researcher, Stanley has few peers in combinatorics; as at once, to pack every page with information, connect with the reader's intuition, and communicate the underlying, unifying philosophy of the subject.' D. V. Feldman, University of New Hampshire
'What else is to be added to our comments on this excellent book? Perhaps a quotation from G.-C. Rota's foreword: 'Every once in a long while, a textbook worthy of the name comes along ... Weber, Bertini, van der Waerden, Feller, Dunford and Schwartz, Ahlfors, Stanley.' European Mathematical Society
'... an authoritative account of enumerative combinatorics.' George E. Andrews, Bulletin of the London Mathematical Society
'What else can be added to the comments upon this excellent book?' EMS Newsletter
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Fair. Volume 2. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,850grams, ISBN:9780521789875. N° de réf. du vendeur 9780035
Quantité disponible : 1 disponible(s)
Vendeur : Greener Books, London, Royaume-Uni
Paperback. Etat : Used; Very Good. **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books. N° de réf. du vendeur 5021836
Quantité disponible : 1 disponible(s)
Vendeur : Zoom Books Company, Lynden, WA, Etats-Unis
Etat : very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. N° de réf. du vendeur ZBV.0521789877.VG
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Used book that is in clean, average condition without any missing pages. N° de réf. du vendeur 53424970-6
Quantité disponible : 1 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 600. N° de réf. du vendeur 26525800
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 600 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. N° de réf. du vendeur 8370743
Quantité disponible : 1 disponible(s)
Vendeur : Literary Cat Books, Machynlleth, Powys, WALES, Royaume-Uni
Softcover. Etat : Very Good+. Etat de la jaquette : No Dust Jacket. Paperback Edition; (?). A comprehensive and authoritative graduate-level text on enumerative combinatorics, covering advanced topics such as composition of generating functions, trees, algebraic and D-finite generating functions, noncommutative generating functions, and symmetric functions including an in-depth treatment of the Robinson-Schensted-Knuth algorithm. The volume concludes with an appendix by Sergey Fomin that explores deeper aspects of symmetric function theory, such as jeu de taquin and the Littlewood Richardson rule. ; 15.8x23x3.8cm; XII,585 pages. N° de réf. du vendeur 64127
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 600. N° de réf. du vendeur 18525794
Quantité disponible : 1 disponible(s)
Vendeur : LIBRERIA LEA+, Santiago, RM, Chili
Blanda. Etat : New. Etat de la jaquette : Nuevo. No Aplica (illustrateur). 0. This is the second of a two - volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians . This volume 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 and focusing on combinatorics , especially the Robinson - Schensted - Knuth algorithm . Also covered are connections between symmetric functions and representation theory . An appendix ( written 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 . From a review of Volume 1 : " . sure to become a standard as an introductory graduate text in combinatorics . " George E. Andrews , Bulletin of the American Mathematical Society. 780 gr. Libro. N° de réf. du vendeur 9780521789875LEA43153
Quantité disponible : 1 disponible(s)
Vendeur : San Francisco Book Company, Paris, France
Paperback. Etat : Very good. Paperback Octavo. wraps, 585 pp. N° de réf. du vendeur 108650
Quantité disponible : 1 disponible(s)