Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: Enumerative Combinatorics: Volume 1 by Richard P. Stanley ISBN: 0-521-66351-2 Publisher: Cambridge University Press Pub. Date: May, 2000 Format: Paperback Volumes: 1 List Price(USD): $33.00 |
Average Customer Rating: 5 (3 reviews)
Rating: 5
Summary: This is for people who likes to COUNT
Comment: Gosh! This is for people who count, what else does combinatorist do? Before people dismiss me as somebody who dont know hoot about math: I actually took a class with R. Stanley (the author) in college, and had actually used this book (vol 1 though) as a text. The material is highbrow (I agree on the 'hardcore' math part, as some people say) but the main theme of the book is on how to 'count' -- needless to say not in the sense of everyday counting, but in the sense that 'topology' is 'coffee-donut transformation' and 'analysis' is 'honors calculus'. You have to be able to count combinatorially, and comfortable with combinatorial proof to actually learn from this. I like the fact that Stanley asks for combinatorial proof to a some given problems, marking them as unsolved -- he really elevates the status of combinatorial proof, a proof method other mathematicians might dismiss as 'handwaving'. Of course, there are the numbered exercises, according to the level of difficulty: [1] for trivial, [5] unsolved. I saw a professor working in differential topology for 40 years referring to this book -- and first year undergrads thumbing through for exercises marked [1] to solve in spare time. This is a book for all levels of mathematicians: I am sure even the armchair amateur mathematicians can grasp the material after a hard day's thought. I dont see this book as any less than a definitive text on enumerative combinatiorics.
Rating: 5
Summary: People who like to COUNT?!? People who like hard-core math.
Comment: There was an earier review that claimed this book is for "people who like to count." That's a little silly. This book is a rigorous math text. And it's glorious. It's probably my favorite text. But it's not light reading at all.
I spent a semester actively reading and working on this book with my advisor. I read this book and worked on research, 50/50 split on my time. I got through 2.5 of the 4 chapters, and I'm damn proud of myself. It's a great book, but if you didn't know that 'enumerative' was for "people who like to count", you probably want a different text.
Rating: 5
Summary: A Classic!
Comment: This book is a must for anyone who likes how to count. In addition to the superb exposition of deep and important mathematics, it contains so many intriguing problems, some of them even puzzle-like. Read this book cover-to-cover or open it at a random page. Either way you would love it!
 |
Title: A Course in Combinatorics by Jacobus Hendricus Van Lint, R. M. Wilson ISBN: 0521006015 Publisher: Cambridge University Press Pub. Date: 15 December, 2001 List Price(USD): $50.00 |
 |
Title: Young Tableaux: With Applications to Representation Theory and Geometry (London Mathematical Society Student Texts, 35) by William Fulton ISBN: 0521567246 Publisher: Cambridge University Press Pub. Date: 01 March, 1997 List Price(USD): $32.00 |
 |
Title: Counterexamples in Analysis (Dover Books on Mathematics) by Bernard R. Gelbaum, John M. H. Olmsted ISBN: 0486428753 Publisher: Dover Publications Pub. Date: 01 June, 2003 List Price(USD): $14.95 |
 |
Title: Schaum's Outline of Combinatorics (Schaum's) by V. K. Balakrishnan, V. Balakrishnan ISBN: 007003575X Publisher: McGraw-Hill Trade Pub. Date: 01 November, 1994 List Price(USD): $16.95 |
 |
Title: The Symmetric Group by Bruce Eli Sagan, Bruce E. Sagan ISBN: 0387950672 Publisher: Springer-Verlag Pub. Date: 20 April, 2001 List Price(USD): $54.95 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
