Enumerative Combinatorics, Volume 2
New Ed edition
Our rough guess is there are 149,500 words in this book.
At a pace averaging 250 words per minute, this book will take 9 hours and 58 minutes to read. With a half hour per day, this will take 20 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Publication
2001-02-15 - Cambridge University Press
Language
English
Word Count
149,500 words, Guess
Page Count
598 pages
Physical Format
Paperback
Identifiers
- ISBN-100521789877
- ISBN-139780521789875
- Goodreads593616
- Better World Books9780521789875
- Open LibraryOL7754023M
Classifications
- LCCQA164.8 .S73 1997
First Sentence
If F(x) and G(x) are formal power series with G(0) = 0, then we have seen (after Proposition 1.1.9) that the composition F(G(x) is a well-defined formal power series.
Subjects
Other Editions
- Enumerative Combinatorics, Volume 2
Similar Books
Combinatorics: topics, techniques, algorithms
Peter J. Cameron.
Combinatorial dynamics and entropy in dimension one
Lluís Alsedà & Jaume Llibre, Michał Misiurewicz.
Lessons in Play: An Introduction to Combinatorial Game Theory
Michael H. Albert, David Wolfe, Richard J. Nowakowski, Wolfe, David, Michael Albert, Richard Nowakowski
A Beginner's Guide to Graph Theory
W.D. Wallis
Physical combinatorics
Masaki Kashiwara, Tetsuji Miwa, editors
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!