Enumerative combinatorics
Richard P. Stanley
Reading Time
at 250 WPM9h 54m
The average reader, reading at a speed of 250 WPM, would take 9h 54m to read Enumerative combinatorics.
Personalise your estimate by entering your reading speed below
Test my reading speedEnter speed in words per minute
20
days at 30 min/day
594
total minutes
Enumerative combinatorics
Published
January 13, 1999
Publisher
Cambridge University Press
Pages
594
ISBN-13
9780521560696
ISBN-10
0521560691
Description
Publisher Description (unedited publisher data) 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. Library of Congress subject headings for this publication: Combinatorial enumeration problems.
Subjects
Proofs that really count
Introduction to Enumerative and Analytic Combinatorics
Combinatorial enumeration of groups, graphs, and chemical compounds
Enumerative Combinatorics
Combinatorial enumeration
Enumerative Combinatorics, Volume 1
Frequently Asked Questions
How many pages are in Enumerative combinatorics?
This edition of Enumerative combinatorics has approximately 594 pages. Please note, this is an estimate and the exact page count can vary between hardcover, paperback, and e-book versions.
How long does it take to read Enumerative combinatorics?
For most readers, Enumerative combinatorics typically takes between 12h 23m and 8h 15m to complete. This is based on the book's length of approximately 148,500 words and common reading speeds.
Here's a detailed breakdown: • Continuous reading at 250 WPM: approximately 9h 54m of focused reading • Casual reading (30 minutes/day): you could finish in roughly 20 days • Estimated word count: 148,500 words
Your individual reading time will vary based on your personal reading pace, the amount of daily reading time, and your familiarity with the subject matter.
What is the word count of Enumerative combinatorics?
The estimated word count for Enumerative combinatorics is approximately 148,500 words. This figure is calculated using industry-standard methods that consider genre-specific word density patterns, typical formatting and layout characteristics, and standard words-per-page ratios for published books.
This is an approximation — actual word count may vary based on font size, formatting, edition, and the presence of illustrations or charts.
Who is the author of Enumerative combinatorics?
Enumerative combinatorics was written by Richard P. Stanley.
When was Enumerative combinatorics published?
The publication date for this specific edition is January 13, 1999. The original work may have been published on a different date.