logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Enumerative Combinatorics: Volume 2 by Richard P. Stanley; Sergey Fomin (Contributor & Appendix) ISBN 9780521560696, 9780521789875, 9780511609589, 0521560691, 0521789877, 0511609582

  • SKU: EBN-7112652
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

0.0

0 reviews
Instant download (eBook) Enumerative Combinatorics: Volume 2 after payment.
Authors:Richard P. Stanley; Sergey Fomin (Contributor & Appendix)
Pages:597 pages.
Year:2001
Editon:1, Digital Printing 2004
Publisher:Cambridge University Press [CUP]
Language:english
File Size:25.99 MB
Format:pdf
ISBNS:9780521560696, 9780521789875, 9780511609589, 0521560691, 0521789877, 0511609582
Categories: Ebooks

Product desciption

(Ebook) Enumerative Combinatorics: Volume 2 by Richard P. Stanley; Sergey Fomin (Contributor & Appendix) ISBN 9780521560696, 9780521789875, 9780511609589, 0521560691, 0521789877, 0511609582

Main subject category: • Enumerative Combinatorics

Contents: • Trees and the Composition of Generating Functions • Algebraic, D-Finite, and Noncommutative Generating Functions • Symmetric Functions • Knuth Equivalence, Jeu de Taquin, and the Littlewood-Richardson Rule • The Characters of GL(n, ℂ) • Index • Additional Errata and Addenda

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.

• Coverage of many topics not available in textbook form, plus the most accessible and thorough introduction available to the theory of symmetric functions

• Over 250 exercises with solutions or references to solutions, many of which cover previously unpublished material

• Section on Catalan numbers will appeal to amateur as well as professional mathematicians

*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products