e99 Online Shopping Mall
Help | |
Home - Pure And Applied Math - Combinatorics (Books) |
  | Back | 21-40 of 100 | Next 20 |
click price to see details click image to enlarge click link to go to the store
21. Introduction to Combinatorics (Discrete Mathematics and Its Applications) by W.D. Wallis, J.C. George | |
Hardcover: 397
Pages
(2010-09-07)
list price: US$79.95 -- used & new: US$54.00 (price subject to change: see help) Asin: 1439806225 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Accessible to undergraduate students, Introduction to Combinatorics presents approaches for solving counting and structural questions. It looks at how many ways a selection or arrangement can be chosen with a specific set of properties and determines if a selection or arrangement of objects exists that has a particular set of properties. To give students a better idea of what the subject covers, the authors first discuss several examples of typical combinatorial problems. They also provide basic information on sets, proof techniques, enumeration, and graph theory—topics that appear frequently throughout the book. The next few chapters explore enumerative ideas, including the pigeonhole principle and inclusion/exclusion. The text then covers enumerative functions and the relations between them. It describes generating functions and recurrences, important families of functions, and the theorems of Pólya and Redfield. The authors also present introductions to computer algebra and group theory, before considering structures of particular interest in combinatorics: graphs, codes, Latin squares, and experimental designs. The last chapter further illustrates the interaction between linear algebra and combinatorics. Exercises and problems of varying levels of difficulty are included at the end of each chapter. Ideal for undergraduate students in mathematics taking an introductory course in combinatorics, this text explores the different ways of arranging objects and selecting objects from a set. It clearly explains how to solve the various problems that arise in this branch of mathematics. |
22. Introductory Combinatorics (5th Edition) by Richard A. Brualdi | |
Hardcover: 648
Pages
(2009-01-07)
list price: US$132.00 -- used & new: US$79.78 (price subject to change: see help) Asin: 0136020402 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This trusted best-seller emphasizes combinatorial ideas–including the pigeon-hole principle, counting techniques, permutations and combinations, Pólya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, combinatortial structures (matchings, designs, graphs), and flows in networks. The Fifth Edition clarifies the exposition throughout and adds a wealth of new exercises. Appropriate for one- or two-semester, junior- to senior-level combinatorics courses. Customer Reviews (4)
Terrific!
Unusable
nice accessable text
Interesting Problems, Too Many Mistakes |
23. Discrete Mathematics: An Introduction to Proofs and Combinatorics by Kevin Ferland | |
Hardcover: 720
Pages
(2008-02-05)
list price: US$168.95 -- used & new: US$61.00 (price subject to change: see help) Asin: 0618415386 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (1)
Good Math Book |
24. How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics and Its Applications) by R.B.J.T. Allenby, Alan Slomson | |
Hardcover: 444
Pages
(2010-08-12)
list price: US$79.95 -- used & new: US$56.99 (price subject to change: see help) Asin: 1420082604 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Emphasizes a Problem Solving Approach Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. New to the Second Edition Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya’s counting theorem. |
25. Applied Combinatorics, Second Edition by Fred Roberts, Barry Tesman | |
Hardcover: 848
Pages
(2009-06-03)
list price: US$99.95 -- used & new: US$87.00 (price subject to change: see help) Asin: 1420099825 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Now with solutions to selected problems, Applied Combinatorics, Second Edition presents the tools of combinatorics from an applied point of view. This bestselling textbook offers numerous references to the literature of combinatorics and its applications that enable readers to delve more deeply into the topics. After introducing fundamental counting rules and the tools of graph theory and relations, the authors focus on three basic problems of combinatorics: counting, existence, and optimization problems. They discuss advanced tools for dealing with the counting problem, including generating functions, recurrences, inclusion/exclusion, and Pólya theory. The text then covers combinatorial design, coding theory, and special problems in graph theory. It also illustrates the basic ideas of combinatorial optimization through a study of graphs and networks. Customer Reviews (1)
comprehensive and lucid coverage of many algorithms |
26. Classic Papers in Combinatorics (Modern Birkhäuser Classics) | |
Paperback: 489
Pages
(2008-11-26)
list price: US$49.95 -- used & new: US$29.50 (price subject to change: see help) Asin: 0817648410 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description This volume surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject proved in over five decades of original papers by: T. van Aardenne-Ehrenfest.- R.L. Brooks.- N.G. de Bruijn.- G.F. Clements.- H.H. Crapo.- R.P. Dilworth.- J. Edmonds.- P. Erdös.- L.R. Ford, Jr.- D.R. Fulkerson.- D. Gale.- L. Geissinger.- I.J. Good.- R.L. Graham.- A.W. Hales.- P. Hall.- P.R. Halmos.- R.I. Jewett.- I. Kaplansky.- P.W. Kasteleyn.- G. Katona.- D.J. Kleitman.- K. Leeb.- B. Lindström.- L. Lovász.- D. Lubell.- C. St. J.A. Nash-Williams.- G. Pólya.-R. Rado.- F.P. Ramsey.- G.-C. Rota.- B.L. Rothschild.- H.J. Ryser.- C. Schensted.- M.P. Schützenberger.- R.P. Stanley.- G. Szekeres.- W.T. Tutte.- H.E. Vaughan.- H. Whitney. |
27. Introductory Combinatorics by Kenneth P. Bogart | |
Hardcover: 654
Pages
(2000-01-10)
list price: US$231.95 -- used & new: US$60.00 (price subject to change: see help) Asin: 0121108309 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (2)
Reasonable, but not exceptional text
One of the most complete combinatorics books around... |
28. Notes on Introductory Combinatorics (Modern Birkhäuser Classics) by George Pólya, Robert E. Tarjan, Donald R. Woods | |
Paperback: 192
Pages
(2009-11-17)
list price: US$59.95 -- used & new: US$42.02 (price subject to change: see help) Asin: 0817649522 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Developed from the authors’ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths. This introduction will provide students with a solid foundation in the subject. ---- "This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text. One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory…[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." —Mathematical Reviews (Review of the original hardcover edition) "The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya." —Zentralblatt MATH (Review of the original hardcover edition) |
29. Combinatorics: A Problem Oriented Approach (Mathematical Association of America Textbooks) by Daniel A. Marcus | |
Paperback: 152
Pages
(1999-01-14)
list price: US$42.50 -- used & new: US$34.99 (price subject to change: see help) Asin: 0883857103 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (4)
quite good
problem -oriented with no solutions!
problem -oriented with no solutions!
A collection of excellent, yet routine problems |
30. Combinatorics: The Rota Way (Cambridge Mathematical Library) by Joseph P. S. Kung, Gian-Carlo Rota, Catherine H. Yan | |
Paperback: 408
Pages
(2009-02-09)
list price: US$39.99 -- used & new: US$31.99 (price subject to change: see help) Asin: 052173794X Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
31. Combinatorics of Train Tracks. (AM-125) by R. C. Penner, John L. Harer | |
Paperback: 232
Pages
(1991-12-03)
list price: US$67.50 -- used & new: US$14.55 (price subject to change: see help) Asin: 0691025312 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
32. Analytic Combinatorics by Philippe Flajolet, Robert Sedgewick | |
Hardcover: 824
Pages
(2009-01-19)
list price: US$82.00 -- used & new: US$61.98 (price subject to change: see help) Asin: 0521898064 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (1)
maybe a little long and hard to read but excellent! |
33. Geometric Discrepancy: An Illustrated Guide (Algorithms and Combinatorics) by Jiri Matousek | |
Paperback: 296
Pages
(2009-12-16)
list price: US$99.00 -- used & new: US$78.63 (price subject to change: see help) Asin: 3642039413 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description What is the "most uniform" way of distributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? Such questions are treated in geometric discrepancy theory. The book is an accessible and lively introduction to this area, with numerous exercises and illustrations. In separate, more specialized parts, it also provides a comprehensive guide to recent research. Including a wide variety of mathematical techniques (from harmonic analysis, combinatorics, algebra etc.) in action on non-trivial examples, the book is suitable for a "special topic" course for early graduates in mathematics and computer science. Besides professional mathematicians, it will be of interest to specialists in fields where a large collection of objects should be "uniformly" represented by a smaller sample (such as high-dimensional numerical integration in computational physics or financial mathematics, efficient divide-and-conquer algorithms in computer science, etc.). From the reviews: "...The numerous illustrations are well placed and instructive. The clear and elegant exposition conveys a wealth of intuitive insights into the techniques utilized. Each section usually consists of text, historical remarks and references for the specialist, and exercises. Hints are provided for the more difficult exercises, with the exercise-hint format permitting inclusion of more results than otherwise would be possible in a book of this size..." Allen D. Rogers, Mathematical Reviews Clippings (2001) |
34. Combinatorics and Commutative Algebra (Progress in Mathematics) by Richard P. Stanley | |
Paperback: 168
Pages
(2004-10-15)
list price: US$89.95 -- used & new: US$49.98 (price subject to change: see help) Asin: 0817643699 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Some remarkable connections between commutative algebra and combinatorics have been discovered in recent years. This book provides an overview of two of the main topics in this area. The first concerns the solutions of linear equations in nonnegative integers. Applications are given to the enumeration of integer stochastic matrices (or magic squares), the volume of polytopes, combinatorial reciprocity theorems, and related results. The second topic deals with the face ring of a simplicial complex, and includes a proof of the Upper Bound Conjecture for Spheres. An introductory chapter giving background information in algebra, combinatorics and topology broadens access to this material for non-specialists. New to this edition is a chapter surveying more recent work related to face rings, focusing on applications to f-vectors. Included in this chapter is an outline of the proof of McMullen's g-conjecture for simplicial polytopes based on toric varieties, as well as a discussion of the face rings of such special classes of simplicial complexes as shellable complexes, matroid complexes, level complexes, doubly Cohen-Macaulay complexes, balanced complexes, order complexes, flag complexes, relative complexes, and complexes with group actions. Also included is information on subcomplexes and subdivisions of simplicial complexes, and an application to spline theory. Customer Reviews (2)
great book
This is a research monograph! |
35. Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series) by Stasys Jukna | |
Paperback: 375
Pages
(2010-11-02)
list price: US$89.95 -- used & new: US$89.95 (price subject to change: see help) Asin: 3642085598 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
36. Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) by Bernhard Korte, Jens Vygen | |
Paperback: 627
Pages
(2010-11-02)
list price: US$89.95 -- used & new: US$71.97 (price subject to change: see help) Asin: 3642090923 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. Customer Reviews (2)
Kindle Version, Hard to read
Useful yet dense! This book, on the other hand, contains so much information and so many proved theorems - it's the richest resuorce in this topic, in my humble opinion. Using it as a graduate level textbook for an *introduction* to combinatorial optimization is kind of hard - as although it's richness, some topics are described without enough detail or examples (like the topics on network flow and bipartite graphs) - yet the authors probably assumed some previous knowledge in those topics. I prefer using this book as a reference rather than and intoduction. The heavy mathematical notations in this book might scare some readers, but no-fear! You quickly get used to it, and appreciate the greatness in the notations, as they make the theorems more short and to the point. On the other hand - getting back to this book for a quick review on some subject might forceyou to flip pages for a fwe minutes, just to remember the notation again. The authors intended this book to be a graduaet level textbook or an up-to-date referencework for current research. I believe they accomplished both targets! ... Read more |
37. Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) by M. Lothaire | |
Hardcover: 628
Pages
(2005-07-25)
list price: US$160.00 -- used & new: US$106.23 (price subject to change: see help) Asin: 0521848024 Average Customer Review: Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description Customer Reviews (1)
Lays a Strong Mathematical Foundation for work in Text Processing |
38. Lectures in Geometric Combinatorics (Student Mathematical Library, V. 33.) by Rekha R. Thomas | |
Paperback: 143
Pages
(2006-07-31)
list price: US$29.00 -- used & new: US$25.74 (price subject to change: see help) Asin: 0821841408 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
39. Surveys in Combinatorics, 1993 (London Mathematical Society Lecture Note Series) | |
Paperback: 296
Pages
(1993-07-30)
list price: US$60.00 -- used & new: US$42.00 (price subject to change: see help) Asin: 0521448573 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
40. Algebraic Combinatorics on Words (Encyclopedia of Mathematics and its Applications) by M. Lothaire | |
Paperback: 520
Pages
(2010-11-11)
list price: US$60.00 -- used & new: US$60.00 (price subject to change: see help) Asin: 0521180716 Canada | United Kingdom | Germany | France | Japan | |
Editorial Review Product Description |
  | Back | 21-40 of 100 | Next 20 |