Catholic University of Zimbabwe Library
Online Public Access Catalogue
(OPAC)

Applied Combinatorics Mitchel Keller

By: Keller, Mitchel T [author]Contributor(s): Trotter, William T [author] | Open Textbook Library [distributor]Material type: TextTextSeries: Open textbook libraryDistributor: Open Textbook Library Publisher: Mitchel T. Keller, William T. Trotter Description: 1 online resourceISBN: Subject(s): Mathematics -- Textbooks | Applied mathematics -- TextbooksLOC classification: QA1QA37.3Online resources: Access online version
Contents:
1. An Introduction to Combinatorics -- 2. Strings, Sets and Binomial Coefficients -- 3. Induction -- 4. Combinatorial Basics -- 5. Graph Theory -- 6. Partially Ordered Sets -- 7. Inclusion-Exclusion -- 8. Generating Functions -- 9. Recurrence Equations -- 10. Probability -- 11. Applying Probability to Combinatorics -- 12. Graph Algorithms -- 13. Network Flows -- 14. Combinatorial Applications of Network Flows -- 15. Polya's Enumeration Theorem -- 16. The Many Faces of Combinatorics -- A. Epilogue -- B. Background Material for Combinatorics -- C. List of Notation
Subject: 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).
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number URL Status Date due Barcode Item holds
eBook eBook
Online Access
QA1 (Browse shelf(Opens below)) Link to resource Available
Total holds: 0

1. An Introduction to Combinatorics -- 2. Strings, Sets and Binomial Coefficients -- 3. Induction -- 4. Combinatorial Basics -- 5. Graph Theory -- 6. Partially Ordered Sets -- 7. Inclusion-Exclusion -- 8. Generating Functions -- 9. Recurrence Equations -- 10. Probability -- 11. Applying Probability to Combinatorics -- 12. Graph Algorithms -- 13. Network Flows -- 14. Combinatorial Applications of Network Flows -- 15. Polya's Enumeration Theorem -- 16. The Many Faces of Combinatorics -- A. Epilogue -- B. Background Material for Combinatorics -- C. List of Notation

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).

Attribution-ShareAlike

In English.

Description based on print resource

There are no comments on this title.

to post a comment.

OPENING HOURS

Weekdays: 0815hrs - 1800hrs
Weekends:0900hrs - 1200hrs

Closed for Mass:

Mon, Thur: 1200hrs - 1300hrs
Sunday & Public Holiday’s

CALL SUPPORT

0242-570570, 0242-570169
09200664, +263 8644140602

LOCATION

18443, Cranborne Avenue, Hatfield, Harare

Other Links


©2021 | CUZ Library