
Math 191.Prerequisites: Ability to write proofs and willingness to work on openended problems a must. Math 55, 110 and or 113 strongly preferred. Syllabus: In class we will develop some of the classical and modern methods in combinatorial topology. Possible topics covered in this class include planar graphs, colorability, Kuratowski's theorem, simplicial complexes, combinatorial fixed point theorems, homology, knot theory, braid groups, knot polynomials, fundamental groups, and additional topics based on student's input. Projects include applications in algebraic combinatorics, algebraic topology, computational topology, differential geometry, and knot theory. Students will apply their knowledge from class to learn advanced methods independently in the form of open ended projects. Each student will have considerable latitude in finding problems that fit his or her interest. Students will work in small groups on these projects, with the majority of this work completed outside of class. Grading: One short and one long project. Weekly progress reports, an inclass presentation, and a final writeup using LaTeX will be required for each project. Exercises will occasionally be assigned. Course Materials: A link to presentations given in this class, as well as Sample LaTeX Documents, can be found here. Class Notes: Are slowly being reformatted into a bookprintable format. As a result, some sections may not include figures and may not render well on your computer screen. The latest version is here. 