Applied Combinatorics
- ISBN-10
- 047143809X
- ISBN-13
- 9780471438090
- Series
- Applied Combinatorics
- Category
- Mathematics / General
- Pages
- 446
- Language
- English
- Published
- 2002
- Publisher
- Wiley
- Author
- Alan Tucker
Description
This book is designed for use by students with a wide range of ability and maturity. The stronger the students, the harder the exercises that can be assigned. The book can be used for one-quarter, two-quarter, or one-semester course depending on how much material is used.
Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This book teaches students in the mathematical sciences how to reason and model combinatorically. It seeks to develop proficiency in basic discrete math problem solving in the way that a calculus textbook develops proficiency in basic analysis problem solving.
The three principle aspects of combinatorical reasoning emphasized in this book are: the systematic analysis of different possibilities, the exploration of the logical structure of a problem (e.g. finding manageable subpieces or first solving the problem with three objects instead of n), and ingenuity. Although important uses of combinatorics in computer science, operations research, and finite probability are mentioned, these applications are often used solely for motivation. Numerical examples involving the same concepts use more interesting settings such as poker probabilities or logical games.
Get the book
Other editions
Similar books
-
Applied combinatorics
By Alan TuckerApplied combinatorics
-
Applied Combinatorics, 6th Edition
By Alan TuckerThe new 6th edition of Applied Combinatorics builds on the previous editions with more in depth analysis of computer systems in order to help develop proficiency in basic discrete math problem solving.
-
Applied Combinatorics
By Fred S. RobertsThis text presents techniques and applications of combinatorics.
-
Applied Combinatorics
By Barry Tesman, Fred RobertsChain and Closed chain: u i distinct Chain and ui distinct Closed path: Path and u t+1 = u1 u t+1 = u1 Cycle (simple closed path): Circuit (simple closed chain): Path and a Chain and u t+1 = u1 and u i distinct i< t and u t+1 = u1 and ...
-
Foundations of Applied Combinatorics
By Stanley Gill Williamson, Edward A. BenderThis introduction to combinatorics is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. The four-part treatment begins with a section on counting and listing that covers...
-
Applied Combinatorics on Words
By M. LothairePublisher Description
-
Applied Combinatorics with Problem Solving
By Bradley W. Jackson, Dmitri ThoroApplied Combinatorics with Problem Solving
-
Analytic Combinatorics
By Philippe Flajolet, Robert SedgewickSee the study by Biane, Pitman, and Yor [64] for fascinating connections with Brownian motion and the functional ... V.21. Motzkin paths. The OGF of Motzkin paths of height < his j^^H^ (j^) , where Hq"}, refers to Dyck paths.
-
Combinatorics: A Guided Tour
By David R. MazurThis text focuses on the first three types of questions and covers basic counting and existence principles, distributions, generating functions, recurrence relations, Pólya theory, combinatorial designs, error correcting codes, partially ...
-
Foundations of Combinatorics with Applications
By Edward A. Bender, S. Gill WilliamsonSuitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions.