Enumerative Combinatorics - Couverture rigide

Stanley, Richard P.

Couverture rigide

ISBN 10 : 0534065465 ISBN 13 : 9780534065461

Editeur : Kluwer Academic Publishers, 1986

Synopsis

Written for students with a basic knowledge of linear algebra and abstract algebra, this text contains a large number of exercises graded in difficulty, with solutions or references for almost all exercises. This book should be of interest to degree and diploma students taking courses in combinatorics in departments of mathematics and statistics.

A propos du livre

Présentation de l'éditeur

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.

Présentation de l'éditeur

This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. The book covers those parts of enumerative combinatorics of greatest applicability to other areas of mathematics. The four chapters are devoted to an introduction to enumeration (suitable for advanced undergraduates), sieve methods (including the Principle of Inclusion-Exclusion), partially ordered sets, and rational generating functions. There are a large number of exercises, almost all with solutions, which greatly augment the text and provide entry into many areas not covered directly. Graduate students and research mathematicians who wish to apply combinatorics to their work will find this an authoritative reference.

Détails de l'édition

• Éditeur: Kluwer Academic Publishers
• Date d'édition: 1986
• Langue: anglais
• ISBN 10: 0534065465
• ISBN 13: 9780534065461
• Reliure: Relié
• Nombre de pages: 306
• Coordonnées du fabricant: non disponible
• Personne responsable: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Allemagne