Help | |
Home - Pure And Applied Math - Combinatorics (Books) |
1-20 of 100 | Next 20 |
click price to see details click image to enlarge click link to go to the store
1. Enumerative Combinatorics, Volume 2 by Richard P. Stanley | |
Paperback: 594
Pages
(2001-02-15)
list price: US$56.00 -- used & new: US$50.00 (price subject to change: see help) Asin: 0521789877 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (6)
Excellent!
Very challenging, very deep
A Masterpiece on Enumerative Combinatorics
This is for people who likes to COUNT
People who like to COUNT?!? People who like hard-core math. 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. ... Read more |
2. A Course in Combinatorics by J. H. van Lint, R. M. Wilson | |
Paperback: 620
Pages
(2001-12-03)
list price: US$70.00 -- used & new: US$49.00 (price subject to change: see help) Asin: 0521006015 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (5)
A real math book
Excellent book, but organized in a unorthodox and inconvenient manner
A nice tour of combinatorics
A gentle introduction to combinatorics Combinatorics is a relatively recent development inmathematics, one which is generally easy to explain, but with manydifficult open questions.Van Lint and Wilson do an excellent jobexplaining, but there are a few places where the reader needs to know somebackground to place the particular problem in the appropriate mathematicalcontext.Understandably, if the authors were to include all themathematical machinery needed, the book would be huge!Instead, they havechosen to describe as many facets of the field as possible, and thereforehave written a broad, well-balanced book which approaches the topic in anon-threatening way. My one criticism, then, is that there is a lack ofdepth in several areas of the book, with further discussion of advancedtopics or open problems.But even so, I can appreciate the omission forthe sake of accessibility. To fully appreciate the subject, the authorsare correct in mentioning that the book is written with the graduatestudent in mind.But by no means does the reader require such a backgroundto appreciate the remarkable concepts and the exciting questions revealedin this book.
Proof that you can't judge a book by its cover |
3. Applied Combinatorics by Alan Tucker | |
Hardcover: 496
Pages
(2006-11-29)
-- used & new: US$43.53 (price subject to change: see help) Asin: 0471735078 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (11)
Neat problems
Jaime's review
Positives and Negatives
Meandering Approach Leaves Me Frustrated
not impressed |
4. Combinatorics: Topics, Techniques, Algorithms by Peter J. Cameron | |
Paperback: 368
Pages
(1995-01-27)
list price: US$70.00 -- used & new: US$61.57 (price subject to change: see help) Asin: 0521457610 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (7)
Excellent textbook for researchers
Sigmas all over the place
Excellent book...very clear, well-organized
Greatbook for Computer Scientist
Very helpful This book gives a number brief case studies. Its 18 chapters (not counting intro and closing) span a variety of interesting topics. Cameron doesn't write down to the reader - it takes serious thought and some mathematical background to get full value from the reading. The examples are nowhere near as concrete as you'd expect in a popularized version. Still, the author avoids opaque references to specialist terms, and keeps the text approachable. I have personal reason to like this book more than it's high quality warrants. I was thumbing through it in a store, and skimmed a page that described Kirkman's schoolgirls (a two-level problem in selecting subsets). Quite abruptly, I realized that those charming young ladies exactly represented a problem I had in connecting the parts of a multiprocessor. One or two references later, I had a practical way out of a potentially ugly quandry. This material is not just fun for its own intellectual challenge, it has application to real engineering, too. ... Read more |
5. Combinatorics and Graph Theory (Undergraduate Texts in Mathematics) by John Harris, Jeffry L. Hirst, Michael Mossinghoff | |
Paperback: 382
Pages
(2010-11-02)
list price: US$54.95 -- used & new: US$44.37 (price subject to change: see help) Asin: 1441927239 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (10)
Look it over carefully
succinct and eloquent
A highlight of my undergraduate math education
Not bad, but not the best
Doesn't Give Away the Store... |
6. Schaum's Outline of Theory and Problems of Combinatorics including concepts of Graph Theory by V. K. Balakrishnan | |
Paperback: 200
Pages
(1994-11-01)
list price: US$18.95 -- used & new: US$9.96 (price subject to change: see help) Asin: 007003575X Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (5)
Excellent Text Book
Not ideal "self-study" book for undergrads
kind of good
Nice job This book is an introduction to combinatorics for the undergraduate mathematics student and for those working in applications of combinatorics. As with all the other guides in the Schaums series on mathematics, this one has a plethora of many interesting examples and serves its purpose well. Readers who need a more in-depth view can move on to more advanced works after reading this one. The author dedicates this book to the famous mathematician Paul Erdos, who is considered the father of modern combinatorics, and is considered one of most prolific of modern mathematicians, with over 1500 papers to his credit. The author defines combinatorics as the branch of mathematics that attempts to answer enumeration questions without considering all possible cases. The latter is possible by the use of two fundamental rules, namely the sum rule and the product rule. The practical implementation of these rules involves the determination of permutations and combinations, which are discussed in the first chapter, along with the famous pigeonhole principle. Most of this chapter can be read by someone with a background in a typical college algebra course. The author considers some interesting problems in the "Solved Problems" section, for example one- and two-dimensional binomial random walks, and problems dealing with Ramsey, Catalan, and Stirling numbers. The consideration of Ramsey numbers will lead the reader to several very difficult open problems in combinatorics involving their explicit values. Generalized permutations and combinations are considered in chapter two, along with selections and the inclusion-exclusion principle. The author proves the Sieve formula and the Phillip Hall Marriage Theorem. In the "Solved Problems" section, the duality principle of distribution, familiar from integer programming is proved, and the author works several problems in combinatorial number theory. A reader working in the field of dynamical systems will appreciate the discussion of the Moebius function in this section. Particularly interesting in this section is the discussion on rook and hit polynomials. The consideration of generating functions and recurrence relations dominates chapter 3, wherein the author considers the partition problem for positive integers. The first and second identities of Euler are proved in the "Solved Problems" section, and Bernoulli numbers, so important in physics, are discussed in terms of their exponential generating functions. The physicist reader working in statistical physics will appreciate the discussion on Vandermonde determinants. Applications to group theory appear in the discussion on the Young tableaux, preparing the reader for the next chapter. A more detailed discussion of group theory in combinatorics is given in chapter 4, the last chapter of the book. The author proves the Burnside-Frobenius, the Polya enumeration theorems, and Cayley's theorem in the "Solved Problems" section. Readers without a background in group theory can still read this chapter since the author reviews in detail the basic constructions in group theory, both in the main text and in the "Solved Problems" section. Combinatorial techniques had a large role to play in the problem of the classification of finite simple groups, the eventual classification proof taking over 15,000 journal pages and involving a large collaboration of mathematicians. Combinatorics also made its presence known in the work of Richard Borchers on the "monstrous moonshine" that brought together ideas from mathematical physics and the largest simple group, called the monster simple group. The author devotes an appendix to graph theory, which is good considering the enormous power of combinatorics to problems in graph theory and computational geometry. Even though the discussion is brief, he does a good job of summarizing the main results, including a graph-theoretic version of Dilworth's theorem. Combinatorial/graph-theoretic considerations are extremely important in network routing design and many of the techniques discussed in this appendix find their way into these kinds of applications. The author asks the reader to prove that Dilworths' theorem, the Ford-Fulkerson theorem, Hall's marriage theorem, Konig's theorem, and Menger's theorem are equivalent. A very useful glossary of the important definitions and concepts used in the book is inserted at the end of the book.
excellent book ! |
7. Applied Combinatorics by Fred Roberts, Barry Tesman | |
Hardcover: 704
Pages
(2003-04)
list price: US$125.00 -- used & new: US$70.90 (price subject to change: see help) Asin: 0130796034 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (11)
Combinatorics
A very good text on graphs
Great Combi book.
Good Text
Hope this is a 1st edition error... |
8. Algebraic Combinatorics and Coinvariant Spaces (Cms Treatises in Mathematics/ Traites De Mathematiques De La Smc) by Francois Bergeron | |
Hardcover: 230
Pages
(2009-07-31)
list price: US$59.00 -- used & new: US$46.99 (price subject to change: see help) Asin: 1568813244 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
9. A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory by Miklos Bona | |
Paperback: 469
Pages
(2006-10-10)
list price: US$67.00 -- used & new: US$66.33 (price subject to change: see help) Asin: 9812568867 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (7)
Great book for undergrad level of combinatoric
Can't say it enough - I wish I had this book when I was beginning to learn combinatorics
A good book on combinatorics
A Walk Through Combinatorics
Encompassing and Very Clear |
10. Additive Combinatorics (Cambridge Studies in Advanced Mathematics) by Terence Tao, Van H. Vu | |
Paperback: 536
Pages
(2009-12-21)
list price: US$48.00 -- used & new: US$43.41 (price subject to change: see help) Asin: 0521136563 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
11. Principles and Techniques in Combinatorics by Chen Chuan-Chong, Koh Khee-Meng | |
Paperback: 312
Pages
(1992-09)
list price: US$33.00 -- used & new: US$20.00 (price subject to change: see help) Asin: 9810211392 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (4)
DO NOT let the price nor the names of the authors deter you...
A useful book on combinatorics
excellent for competition training
Rigorous and Lucid |
12. Counting and Configurations: Problems in Combinatorics, Arithmetic, and Geometry (CMS Books in Mathematics) by Jiri Herman, Radan Kucera, Jaromir Simsa | |
Paperback: 408
Pages
(2010-11-02)
list price: US$74.95 -- used & new: US$60.14 (price subject to change: see help) Asin: 1441930531 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This book presents methods of solving problems in three areas of elementary combinatorial mathematics: classical combinatorics, combinatorial arithmetic, and combinatorial geometry. Brief theoretical discussions are immediately followed by carefully worked-out examples of increasing degrees of difficulty and by exercises that range from routine to rather challenging. The book features approximately 310 examples and 650 exercises. Customer Reviews (1)
A good book on combinatorics-lots of interesting examples and solved exercises |
13. Combinatorics for Computer Science (Dover Books on Mathematics) by S. Gill Williamson | |
Paperback: 523
Pages
(2002-05-08)
list price: US$22.95 -- used & new: US$4.99 (price subject to change: see help) Asin: 0486420760 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (2)
Suitable for a graduate level course
Excellent reference for data structure algorithm complexity. |
14. Random Trees: An Interplay between Combinatorics and Probability by Michael Drmota | |
Paperback: 476
Pages
(2010-08-03)
list price: US$189.00 -- used & new: US$189.00 (price subject to change: see help) Asin: 3211999140 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During the last years research related to (random) trees has been constantly increasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in different settings. The aim of this book is to provide a thorough introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. It should serve as a reference book as well as a basis for future research. One major conceptual aspect is to bridge combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (saddle point techniques, singularity analysis) to various sophisticated techniques in asymptotic probability (martingales, convergence of stochastic processes, concentration inequalities). |
15. Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry (Universitext) | |
Paperback: 214
Pages
(2003-04-17)
list price: US$69.95 -- used & new: US$49.90 (price subject to change: see help) Asin: 3540003622 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This bookis the first textbook treatment of a significant part of such results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level (for example, homology theory and homotopy groups are completely avoided). No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained. At the same time, many substantial combinatorial results are covered, sometimes with some of the most important results, such as Kneser's conjecture, showing them from various points of view. The history of the presented material, references, related results, and more advanced methods are surveyed in separate subsections. The text is accompanied by numerous exercises, of varying difficulty. Many of the exercises actually outline additional results that did not fit in the main text. The book is richly illustrated, and it has a detailed index and an extensive bibliography. This text started with a one-semester graduate course the author taught in fall 1993 in Prague. The transcripts of the lectures by the participants served as a basis of the first version. Some years later, a course partially based on that text was taught by G\"unter M. Ziegler in Berlin, who made book is based on a thoroughly rewritten version prepared during a pre-doctoral course I taught at the ETH Zurich in fall 2001. Most of the material was covered in the course: Chapter 1 was assigned as an introductory reading text, and the other chapters were presented in approximately 30 hours of teaching (by 45 minutes), with some omissions throughout and with only a sketchy presentation of the last chapter. Customer Reviews (1)
Insight Pedagogy and Honesty |
16. Counting: The Art of Enumerative Combinatorics (Undergraduate Texts in Mathematics) by George E. Martin | |
Paperback: 250
Pages
(2010-11-02)
list price: US$74.95 -- used & new: US$56.39 (price subject to change: see help) Asin: 1441929150 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (2)
Interesting book on combinatorics
Great Introduction on Counting It covers simple counting, groups, generating functions, recurrence relations and mathematical induction. The book concludes with graph theory. Some chapter sections get a little hard to understand, hence the 4 star and not 5 star rating (2 stars is what I'd give a decent book, so this one is a shining star). Most of the book is clear cut. ... Read more |
17. A Path to Combinatorics for Undergraduates: Counting Strategies by Titu Andreescu, Zuming Feng | |
Paperback: 228
Pages
(2003-11-11)
list price: US$54.95 -- used & new: US$33.99 (price subject to change: see help) Asin: 0817642889 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Topics encompass permutations and combinations, binomial coefficients and their applications, recursion, bijections, inclusions and exclusions, and generating functions. The work is replete with a broad range of useful methods and results, such as Sperner's Theorem, Catalan paths, integer partitions and Young's diagrams, and Lucas' and Kummer's Theorems on divisibility. Strong emphasis is placed on connections between combinatorial and graph-theoretic reasoning and on links between algebra and geometry. The authors' previous text, 102 Combinatorial Problems, makes a fine companion volume to the present work, which is ideal for Olympiad participants and coaches, advanced high school students, undergraduates, and college instructors. The book's unusual problems and examples will stimulate seasoned mathematicians as well. A Path to Combinatorics for Undergraduates is a lively introduction not only to combinatorics, but to mathematical ingenuity, rigor, and the joy of solving puzzles. Customer Reviews (1)
Interesting and Clear |
18. The Strange Logic of Random Graphs (Algorithms and Combinatorics) by Joel Spencer | |
Paperback: 168
Pages
(2010-11-02)
list price: US$139.00 -- used & new: US$139.00 (price subject to change: see help) Asin: 3642074995 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description The study of random graphs was begun in the 1960s and now has a comprehensive literature. This excellent book by one of the top researchers in the field now joins the study of random graphs (and other random discrete objects) with mathematical logic. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures. |
19. Advanced Combinatorics: The Art of Finite and Infinite Expansions by L. Comtet | |
Paperback: 360
Pages
(2010-11-02)
list price: US$149.00 -- used & new: US$149.00 (price subject to change: see help) Asin: 9048183413 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Customer Reviews (1)
stuff not in some of the other books |
20. Constructive Combinatorics (Undergraduate Texts in Mathematics) by Dennis Stanton, Dennis White | |
Paperback: 204
Pages
(1986-05-15)
list price: US$79.95 -- used & new: US$58.95 (price subject to change: see help) Asin: 0387963472 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Customer Reviews (1)
Excellent approachment |
1-20 of 100 | Next 20 |