Enumerative combinatorics volume (90 résultats)

Etat : Very Good. 340 pp., Paperback, previous owner's name to the front free endpaper, edges rubbed, else very good. - 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.…

Softcover. Etat : Very Good. Very good softcover with minor wear. Pages are clean and unmarked. book.

Etat : Fine. First edition, first printing, 306 pp., Hardcover, fine in an chipped and lightly worn dust jacket. - 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. …

Paperback. Etat : 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. Etat : 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. Etat : 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. Etat : 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. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Etat : Acceptable. Readable, but has significant damage / tears. Has a remainder mark. paperback Used - Acceptable 2011.

Etat : acceptable. The item is very worn but is perfectly usable. Signs of wear can include aesthetic issues such as scratches, dents, worn and creased covers, folded page corners and minor liquid stains. All pages and the cover are intact, but the dust cover may be missing. Pages may include moderate to heavy amount of notes and highlighting, but the text is not obscured or unreadable. Page edges may have foxing age related spots and browning . May NOT include discs, access code or other supplemental materials.…

Softcover. Etat : Very Good. Very good softcover with minor wear. Pages are clean and unmarked. book.

Soft cover. Etat : New. ISBN:9780521169875,Territorial restriction maybe printed on the book. This is an Int'l edition, ISBN and cover may differ from US edition, Contents same as US edition.

Hardcover. Etat : Fine. Etat de la jaquette : Very Good. 1st Edition. 306 pages. Fine.

Etat : New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide.…

Trade Paperback. Etat : 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.

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

Soft cover. Etat : New. ISBN:9780521173094,Territorial restriction maybe printed on the book. This is an Int'l edition, ISBN and cover may differ from US edition, Contents same as US edition.

Etat : Good. : Este libro es la primera parte de una introducción básica en dos volúmenes a la combinatoria enumerativa, adecuada para estudiantes de posgrado e investigadores en matemáticas. Se centra en la teoría y aplicación de funciones generadoras, una herramienta fundamental en la combinatoria enumerativa. Cubre las partes de la combinatoria enumerativa de mayor aplicabilidad a otras áreas de las matemáticas. Los cuatro capítulos están dedicados a una introducción accesible a la enumeración, métodos de cribado (incluido el Principio de Inclusión-Exclusión), conjuntos parcialmente ordenados y funciones generadoras racionales. Incluye una gran cantidad de ejercicios, casi todos con soluciones, que amplían enormemente el texto y proporcionan una entrada a muchas áreas no cubiertas directamente. EAN: 9780521663519 Tipo: Libros Categoría: Ciencias Título: Enumerative Combinatorics, Volume 1 Autor: Richard P. Stanley Editorial: Cambridge University Press Idioma: en Páginas: 340 Formato: tapa blanda.…

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

Etat : New.

Etat : New.

Softcover. Etat : 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.…

Etat : As New. Unread book in perfect condition.

Paperback. Etat : Very good. Paperback Octavo. wraps, 325 pp.

Paperback. Etat : New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Paperback. Etat : new. Paperback. Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and 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 RobinsonSchenstedKnuth algorithm. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the LittlewoodRichardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions. Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This updated edition provides the only comprehensive high-level treatment of enumerative combinatorics, including the theory of symmetric functions, with over 150 new exercises and solutions. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Paperback. Etat : New. Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of volume two covers the composition of generating functions, in particular the exponential formula and the Lagrange inversion formula, labelled and unlabelled trees, algebraic, D-finite, and 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. An appendix by Sergey Fomin covers some deeper aspects of symmetric functions, including jeu de taquin and the Littlewood-Richardson rule. The exercises in the book play a vital role in developing the material, and this second edition features over 400 exercises, including 159 new exercises on symmetric functions, all with solutions or references to solutions.…

Etat : New.

Etat : New.

Paperback. Etat : New. 2nd. Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes ten new sections and more than 300 new exercises, most with solutions, reflecting numerous new developments since the publication of the first edition in 1986. The author brings the coverage up to date and includes a wide variety of additional applications and examples, as well as updated and expanded chapter bibliographies. Many of the less difficult new exercises have no solutions so that they can more easily be assigned to students. The material on P-partitions has been rearranged and generalized; the treatment of permutation statistics has been greatly enlarged; and there are also new sections on q-analogues of permutations, hyperplane arrangements, the cd-index, promotion and evacuation and differential posets.…