Applied Combinatorics: Discrete Mathematics and Its Applications
Autor Fred S. Roberts, Barry Tesmanen Limba Engleză Hardback – 4 sep 2024
The emphasis on applications from computer science, genetics, experimental design, chemistry, scheduling, voting, and other topics remains a central feature of the book. Unique to the literature is that entire sections focus on applications such as switching functions, the use of enzymes to uncover unknown RNA chains, searching and sorting problems of information retrieval, construction of error-correcting codes, counting of chemical compounds, calculation of power in voting situations, and uses of Fibonacci numbers. There are entire sections on applications of recurrences involving convolutions, applications of eulerian chains, and applications of generating functions.
The book continues to be based on the authors’ philosophy that the best way to learn mathematics is through problem solving. Combinatorics can be a wonderful mechanism for introducing students to proofs. However, the book is not designed for an introduction to proofs course. The authors treat proofs as rather informal, and many of the harder proofs in the book are optional.
Applied Combinatorics, Third Edition is divided into four parts. The first part introduces the basic tools of combinatorics and their applications. The remaining three parts are organized around the three basic problems of combinatorics: the counting problem, the existence problem, and the optimization problem.
Most of the book is written for a first course on the topic at the undergraduate level. On the other hand, at a fast pace, there is more than enough material for a challenging graduate course. This book first appeared when courses on combinatorics were rare. We are pleased to think that, through its use, the book has helped to establish a key course in many colleges and universities throughout the world. We hope that this new edition will remain a valuable tool for instructors and students alike.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Hardback (2) | 804.34 lei 6-8 săpt. | |
CRC Press – 4 sep 2024 | 804.34 lei 6-8 săpt. | |
CRC Press – 3 iun 2009 | 1092.37 lei 6-8 săpt. |
Din seria Discrete Mathematics and Its Applications
- 8% Preț: 404.91 lei
- 8% Preț: 550.28 lei
- 20% Preț: 571.04 lei
- 8% Preț: 409.44 lei
- 9% Preț: 1497.66 lei
- 18% Preț: 784.12 lei
- 18% Preț: 1092.37 lei
- 15% Preț: 556.82 lei
- 20% Preț: 799.88 lei
- 18% Preț: 1126.20 lei
- 18% Preț: 718.18 lei
- 25% Preț: 1305.48 lei
- 26% Preț: 880.31 lei
- 18% Preț: 774.35 lei
- 15% Preț: 493.80 lei
- 15% Preț: 673.22 lei
- 20% Preț: 466.57 lei
- 26% Preț: 681.14 lei
- 15% Preț: 475.40 lei
- 26% Preț: 1181.53 lei
- 25% Preț: 1245.88 lei
- 22% Preț: 352.41 lei
- 15% Preț: 674.31 lei
- 25% Preț: 557.05 lei
- 20% Preț: 1624.73 lei
- 15% Preț: 672.13 lei
- 18% Preț: 1316.30 lei
- 31% Preț: 435.18 lei
- 15% Preț: 485.82 lei
- Preț: 459.90 lei
- 20% Preț: 1030.56 lei
- 31% Preț: 407.72 lei
- 8% Preț: 439.83 lei
- 20% Preț: 1374.85 lei
- 18% Preț: 1306.71 lei
- 25% Preț: 486.68 lei
- 25% Preț: 1232.12 lei
- 15% Preț: 657.86 lei
- 18% Preț: 771.24 lei
- 20% Preț: 816.24 lei
- 25% Preț: 601.99 lei
- 18% Preț: 831.09 lei
- 31% Preț: 1038.64 lei
- 31% Preț: 1175.56 lei
Preț: 804.34 lei
Preț vechi: 980.90 lei
-18% Nou
Puncte Express: 1207
Preț estimativ în valută:
153.93€ • 159.90$ • 127.86£
153.93€ • 159.90$ • 127.86£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781032816524
ISBN-10: 103281652X
Pagini: 756
Ilustrații: 1050
Dimensiuni: 178 x 254 x 49 mm
Greutate: 1.56 kg
Ediția:3
Editura: CRC Press
Colecția CRC Press
Seria Discrete Mathematics and Its Applications
Locul publicării:Boca Raton, United States
ISBN-10: 103281652X
Pagini: 756
Ilustrații: 1050
Dimensiuni: 178 x 254 x 49 mm
Greutate: 1.56 kg
Ediția:3
Editura: CRC Press
Colecția CRC Press
Seria Discrete Mathematics and Its Applications
Locul publicării:Boca Raton, United States
Public țintă
Undergraduate Advanced and Undergraduate CoreCuprins
Chapter 1: What Is Combinatorics? THE BASIC TOOLS OF COMBINATORICS Chapter 2: Basic Counting Rules; Chapter 3: Introduction to Graph Theory; Chapter 4 Relations; THE COUNTING PROBLEM Chapter 5: Generating Functions and Their Applications; Chapter 6: Recurrence Relations; Chapter 7: The Principle of Inclusion and Exclusion; Chapter 8: The Pólya Theory of Counting; THE EXISTENCE PROBLEM Chapter 9: Combinatorial Designs; Chapter 10: Coding Theory; Chapter 11: Existence Problems in Graph Theory; COMBINATORIAL OPTIMIZATION Chapter 12: Matching and Covering; Chapter 13: Optimization Problems for Graphs and Networks; Appendix: Answers to Selected Exercises; Author Index; Subject Index; References appear at the end of each chapter.
Notă biografică
Fred S. Roberts is professor of mathematics and director of DIMACS at Rutgers University.
Barry Tesman is a professor of mathematics at Dickinson College.
Barry Tesman is a professor of mathematics at Dickinson College.
Descriere
The third edition of this popular text presents the tools of combinatorics for a first undergraduate course.
Recenzii
The book has been substantially rewritten with more than 200 pages of new materials and many changes in the exercises. There are also many new examples to reflect the new developments in computer science and biology since 1990. … Many important topics are covered and they are done in detail. This book is one of the rare ones that does the job really well. … I strongly endorse this book. It is suitable for motivated math, computer science or engineering sophomores and even beginning graduate students. In fact bright high school students would love this book and if they are exposed early (through reading this book and being guided by their teachers), many of them might end up doing combinatorics for their careers! I really love this book. It is a gem.
—IACR Book Reviews, 2011
… the overall organization is excellent. … Many inviting exercises are included. They cover both theoretical aspects and practical problems from state-of-the-art scientific research in various areas, such as biology and telecommunications. … I can heartily recommend expanding your library with a copy of this work. It is so much fun to just open the book at random and explore the material that jumps out of the pages.
—Computing Reviews, March 2010
This is an overwhelmingly complete introductory textbook in combinatorics. It not only covers nearly every topic in the subject, but gives several realistic applications for each topic. … much more breadth than its competitors. …valuable as a source of applications and for enrichment reading.
—MAA Reviews, December 2009
The writing style is excellent. … The explanations are detailed enough that the students can follow the arguments readily. The motivating examples are a truly strong point for the text. No other text with which I am familiar comes even close to the number of applications presented here.
—John Elwin, San Diego State University, California, USA
This book is a required textbook for my graduate course in discrete mathematics. Both my students and I have found it to be an excellent resource with interesting application examples from a variety of fields interspersed throughout the text. The book is very well organized and clearly reinforces both the practical and theoretical understanding in a way students are able to correlate. Because the level of difficulty for selected problems range from simple to challenging, it makes an appropriate text for junior, senior, and graduate students alike. I am particularly pleased with the relevancy and inclusion of computer science applications … .
—Dawit Haile, Virginia State University, Petersburg, USA
Roberts and Tesman’s book covers all the major areas of combinatorics in a clear, insightful fashion. But what really sets it apart is its impressive use of applications. I know of no other text which comes close. There are entire sections devoted to subjects like computing voting power, counting organic compounds built up from benzene rings, and the use of orthogonal arrays in cryptography. And in exercises and examples, students test psychic powers, consider the UNIX time problem, plan mail carriers’ routes, and assign state legislators to committees. This really helps them to understand the mathematics and also to see how this field is useful in the real world.
—Thomas Quint, University of Nevada, Reno, USA
—IACR Book Reviews, 2011
… the overall organization is excellent. … Many inviting exercises are included. They cover both theoretical aspects and practical problems from state-of-the-art scientific research in various areas, such as biology and telecommunications. … I can heartily recommend expanding your library with a copy of this work. It is so much fun to just open the book at random and explore the material that jumps out of the pages.
—Computing Reviews, March 2010
This is an overwhelmingly complete introductory textbook in combinatorics. It not only covers nearly every topic in the subject, but gives several realistic applications for each topic. … much more breadth than its competitors. …valuable as a source of applications and for enrichment reading.
—MAA Reviews, December 2009
The writing style is excellent. … The explanations are detailed enough that the students can follow the arguments readily. The motivating examples are a truly strong point for the text. No other text with which I am familiar comes even close to the number of applications presented here.
—John Elwin, San Diego State University, California, USA
This book is a required textbook for my graduate course in discrete mathematics. Both my students and I have found it to be an excellent resource with interesting application examples from a variety of fields interspersed throughout the text. The book is very well organized and clearly reinforces both the practical and theoretical understanding in a way students are able to correlate. Because the level of difficulty for selected problems range from simple to challenging, it makes an appropriate text for junior, senior, and graduate students alike. I am particularly pleased with the relevancy and inclusion of computer science applications … .
—Dawit Haile, Virginia State University, Petersburg, USA
Roberts and Tesman’s book covers all the major areas of combinatorics in a clear, insightful fashion. But what really sets it apart is its impressive use of applications. I know of no other text which comes close. There are entire sections devoted to subjects like computing voting power, counting organic compounds built up from benzene rings, and the use of orthogonal arrays in cryptography. And in exercises and examples, students test psychic powers, consider the UNIX time problem, plan mail carriers’ routes, and assign state legislators to committees. This really helps them to understand the mathematics and also to see how this field is useful in the real world.
—Thomas Quint, University of Nevada, Reno, USA