Course | MATH-596 |
Course Title | DISCRETE GEOMETRY |
Section | 01 |
Schedule # | 22385 |
Units | 3.0 |
Session | FALL CAMPUS |
Seats | 25/40 |
Meetings | |
Full Title | Discrete Geometry |
Description | Applications to discrete optimization and enumerative combinatorics. Convex polyhedra and polytopes, Ehrhart¿s theorem, generating functions, lattice point enumeration methods. |
Prerequisite | Mathematics 320 or 330 with a grade of C (2.0) or better. |
General Text | NOTE: Proof of completion of prerequisites required for all upper division courses: Copy of transcript. |
Footnotes |