ISBN: 9780521789875 - Enumerative Combinatorics: Volume 2 (cambridge Studies in Advanced Mathematics, Series Number 62) (13 results)

Paperback. Condition: Very Good. 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.…

Paperback. Condition: Good. 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.…

Paperback. Condition: Very Good. 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.…

Paperback. Condition: Good. 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.…

Trade Paperback. Condition: VG. used trade paperback edition. lightly shelfworn, corners perhaps slightly bumped. pages and binding are clean, straight and tight. there are no marks to the text or other serious flaws.

Condition: Fine. *Price HAS BEEN REDUCED by 10% until Monday, Oct. 26 (weekend SALE item) 600 pp., Paperback, edges very lightly rubbed, else fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: 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. …

Softcover. Condition: Very Good+. 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.…

Blanda. Condition: New. Dust Jacket Condition: Nuevo. 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. No Aplica (illustrator). Libro.…

Paperback. Condition: Very good. Paperback Octavo. wraps, 585 pp.

Condition: Very Good.

paperback. Condition: New. In shrink wrap. Looks like an interesting title.