๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Enumerative combinatorics

โœ Scribed by Richard P. Stanley, Sergey Fomin

Book ID
127421280
Publisher
Cambridge University Press
Year
2001
Tongue
English
Weight
4 MB
Edition
1
Category
Library
ISBN
0521789877

No coin nor oath required. For personal study only.

โœฆ 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.

๐Ÿ“œ SIMILAR VOLUMES

Enumerative combinatorics
Enumerative combinatorics
โœ Charalambos A. Charalambides ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Chapman & Hall/CRC ๐ŸŒ English โš– 4 MB

Enumerative Combinatorics presents elaborate and systematic coverage of the theory of enumeration. The first seven chapters provide the necessary background, including basic counting principles and techniques, elementary enumerative topics, and an extended presentation of generating functions and re

Enumerative Combinatorics
Enumerative Combinatorics
โœ Stanley R.P. ๐Ÿ“‚ Library ๐Ÿ“… 1986 ๐ŸŒ English โš– 3 MB

This book, the first of a two-volume basic introduction to enumerative combinatorics, concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. Richard Stanley covers those parts of enumerative combinatorics with the greatest applications to

Enumerative combinatorics Volume 2
Enumerative combinatorics Volume 2
โœ Richard P. Stanley, Sergey Fomin ๐Ÿ“‚ Library ๐Ÿ“… 2001 ๐Ÿ› Cambridge University Press ๐ŸŒ English โš– 5 MB

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 p

Enumerative combinatorics Volume 1
Enumerative combinatorics Volume 1
โœ Richard P. Stanley ๐Ÿ“‚ Library ๐Ÿ“… 2000 ๐Ÿ› Wadsworth and Brooks / Cole, Chapman and Hall ๐ŸŒ English โš– 3 MB

This book, the first of a two-volume basic introduction to enumerative combinatorics, concentrates on the theory and application of generating functions, a fundamental tool in enumerative combinatorics. Richard Stanley covers those parts of enumerative combinatorics with the greatest applications to