| |
| | Kenyon College - Courses in Mathematics 2007-2008 |
 | | A great many mathematical topics are included in this description, including graph theory, combinatorial designs, partially ordered sets, networks, lattices and Boolean algebra, and combinatorial methods of counting, including combinations and permutations, partitions, generating functions, the principle of inclusion and exclusion, and the Stirling and Catalan numbers. |
 | | Combinatorics mathematics has applications in a wide variety of non-mathematical areas, including computer science (both in algorithms and hardware design), chemistry, sociology, government, and urban planning, and this course may be especially appropriate for students interested in the mathematics related to one of these fields. |
 | | For example, the fact that a closed interval (or square, or cube, or n-dimensional ball) is compact is required for basic theorems of calculus. |
| www.kenyon.edu /x10605.xml (4057 words) |
|