Applied Combinatorics, Third Edition
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.
Preț: 894.96 lei
Preț vechi: 1091.41 lei
-18% Nou
Puncte Express: 1342
Preț estimativ în valută:
158.34€ • 184.75$ • 138.44£
158.34€ • 184.75$ • 138.44£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781032816524
ISBN-10: 103281652X
Pagini: 758
Ilustrații: 1050
Dimensiuni: 183 x 260 x 45 mm
Greutate: 1.6 kg
Ediția:3. Auflage
Editura: Chapman and Hall/CRC
Locul publicării:Boca Raton, United States
ISBN-10: 103281652X
Pagini: 758
Ilustrații: 1050
Dimensiuni: 183 x 260 x 45 mm
Greutate: 1.6 kg
Ediția:3. Auflage
Editura: Chapman and Hall/CRC
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.