Items related to Enumerative Combinatorics, Volume 2
Synopsis
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.
"synopsis" may belong to another edition of this title.
Book Description
This is the second volume of a two-volume work on the subject of enumerative combinatorics, an area of mathematics with connections to many other topics within and outside of mathematics, such as computer science, spectroscopy, algebraic geometry, algebraic topology, and representation theory. Many topics covered (in particular, the theory of symmetric functions) are not available in any other textbook at this level, and the usefulness of the book is enhanced by over 250 exercises with solutions.Although primarily intended as a textbook for graduate students and a resource for professional mathematicians, some parts of the book will be accessible to mathematics undergraduates and even interested amateurs.
About the Author
Richard P. Stanley is a Professor of Applied Mathematics at the Massachusetts Institute of Technology. He is universally recognized as a leading expert in the field of combinatorics and its applications to a variety of other mathematical disciplines. In addition to the seminal two-volume book Enumerative Combinatorics, he is the author of Combinatorics and Commutative Algebra (1983) as well as more than 100 research articles in mathematics. Among Stanley's many distinctions are membership in the National Academy of Sciences (elected in 1995), the 2001 Leroy P. Steele Prize for mathematical exposition and the 2003 Schock Prize.
"About this title" may belong to another edition of this title.
Search results for Enumerative Combinatorics, Volume 2
Stock Image
Enumerative Combinatorics: Volume 2
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Paperback
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # 00106113637
Stock Image
Enumerative Combinatorics: Volume 2
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Paperback
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # 00106301749
Stock Image
Enumerative Combinatorics: Volume 2
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Paperback
Seller: World of Books Inc, Montgomery, IL, U.S.A.
Seller rating 4 out of 5 stars
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. Seller Inventory # CIN0521789877VG
Stock Image
Enumerative Combinatorics: Volume 2
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Paperback
Seller: World of Books Inc, Montgomery, IL, U.S.A.
Seller rating 4 out of 5 stars
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. Seller Inventory # CIN0521789877G
Stock Image
Enumerative Combinatorics, Volume 2
Published by
Cambridge University Press June 2001, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Trade Paperback
Seller: Magus Books Seattle, Seattle, WA, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # 1529873
Stock Image
Enumerative Combinatorics, Volume 2 (Cambridge Studies in Advanced Mathematics, 62)
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Softcover
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: Fine. 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. Seller Inventory # ZB1356101
Stock Image
Enumerative Combinatorics
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Softcover
Seller: Better World Books, Mishawaka, IN, U.S.A.
Seller rating 5 out of 5 stars
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. Seller Inventory # 17643303-6
Stock Image
Enumerative Combinatorics (Volume 2) (Cambridge Studies in Advanced Mathematics, No 62)
Published by
Cambridge University Press, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Softcover
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
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. Seller Inventory # 9780035
Buy Used
US$ 40.82
US$ 17.23 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Enumerative Combinatorics - Volume 2 - Cambridge Studies in Advanced Mathematics, Series Number 62
Published by
Cambridge University Press, U. S. A, 2001
ISBN 10: 0521789877
ISBN 13: 9780521789875
Used
Softcover
Seller: Literary Cat Books, Machynlleth, Powys, WALES, United Kingdom
Seller rating 3 out of 5 stars
Softcover. Condition: Very Good+. Dust Jacket Condition: 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. Seller Inventory # 64127
Buy Used
US$ 57.15
US$ 19.81 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
ENUMERATIVE COMBINATORICS VOL.2 (USED COPY)
Seller: LIBRERIA LEA+, Santiago, RM, Chile
Seller rating 5 out of 5 stars
Blanda. Condition: New. Dust Jacket Condition: Nuevo. No Aplica (illustrator). 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. Seller Inventory # 9780521789875LEA43153