Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Enumerative Combinatorics: Volume 2

Name: Enumerative Combinatorics: Volume 2
Brand: Cambridge University Press
SKU: 04399181
Price: 25758 HUF
Availability: PreOrder
Author: Richard P Stanley
ISBN: 9780521789875

Richard P Stanley

Language

English

Book Paperback

Libristo code: 04399181

Publishers Cambridge University Press, June 2001

This second volume of a two-volume basic introduction to enumerative combinatorics covers the compos... Full description

Libristo code: 04399181

178 b

Coming soon

25 758 Ft

Reprint

Date unknown

Up to 30 days for returns

Customers also purchased

Dictionnaire Universel Des Connaissances Humaines. Tome 2 (Ed.1857-1859) Sans Auteur

Paperback

11 357 Ft

Simson Schwalbe & Co Frank Rönicke

Hardback

5 905 Ft

Flixbus. SWOT-Analyse und Projektmanagement-Tools zum Markteintritt in den USA

Paperback

6 192 Ft

Motive A1-B1. Arbeitsbuch, Lektion 1-30 mit Audios online Herbert Puchta

Paperback

9 190 Ft

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.