Search Constraints
Number of results to display per page
Results for:
Tags sim
discrete mathematics
Remove constraint Tags sim: discrete mathematics
Year
2017
Remove constraint Year: 2017
1 - 2 of 2
Search Results
-
e-book
Applied Combinatorics is an open-source textbook for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (graphs, digraphs, posets, interval orders), and discrete optimization (minimum weight spanning trees, shortest paths, network flows). There are also chapters introducing discrete probability, Ramsey theory, combinatorial applications of network flows, and a few other nuggets of discrete mathematics. Applied Combinatorics began its life as a set of course notes we developed when Mitch was a TA for a larger than usual section of Tom's MATH 3012: Applied Combinatorics course at Georgia Tech in Spring Semester 2006. Since then, the material has been greatly expanded and exercises have been added. The text has been in use for most MATH 3012 sections at Georgia Tech for several years now. Since the text has been available online for free, it has also been adopted at a number of other institutions for a wide variety of courses. In August 2016, we made the first release of Applied Combinatorics in HTML format, thanks to a conversion of the book's source from LaTeX to MathBook XML. An inexpensive print-on-demand version is also available for purchase. Find out all about ways to get the book. Since Fall 2016, Applied Combinatorics has been on the list of approved open textbooks from the American Institute of Mathematics. Applied Combinatorics is open source and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC-BY-SA).
- Subjects:
- Mathematics and Statistics
- Keywords:
- Combinatorial analysis Graph theory Textbooks
- Resource Type:
- e-book
-
e-book
In writing this book, care was taken to use language and examples that gradually wean students from a simpleminded mechanical approach andmove them toward mathematical maturity. We also recognize that many students who hesitate to ask for help from an instructor need a readable text, and we have tried to anticipate the questions that go unasked. The wide range of examples in the text are meant to augment the "favorite examples" that most instructors have for teaching the topcs in discrete mathematics. To provide diagnostic help and encouragement, we have included solutions and/or hints to the odd-numbered exercises. These solutions include detailed answers whenever warranted and complete proofs, not just terse outlines of proofs. Our use of standard terminology and notation makes Applied Discrete Structures a valuable reference book for future courses. Although many advanced books have a short review of elementary topics, they cannot be complete. The text is divided into lecture-length sections, facilitating the organization of an instructor's presentation.Topics are presented in such a way that students' understanding can be monitored through thought-provoking exercises. The exercises require an understanding of the topics and how they are interrelated, not just a familiarity with the key words. An Instructor's Guide is available to any instructor who uses the text. It includes: Chapter-by-chapter comments on subtopics that emphasize the pitfalls to avoid; Suggested coverage times; Detailed solutions to most even-numbered exercises; Sample quizzes, exams, and final exams. This textbook has been used in classes atCasper College (WY), Grinnell College (IA), Luzurne Community College (PA), University of the Puget Sound (WA).
- Subjects:
- Mathematics and Statistics
- Keywords:
- Mathematics Textbooks Computer science -- Mathematics
- Resource Type:
- e-book