CS-450: Algorithms IIA first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
MATH-260(a): Discrete mathematicsStudy of structures and concepts that do not require the notion of continuity. Graph theory, or study of general countable sets are some of the areas that are covered by discrete mathematics. Emphasis
MATH-101(g): Analysis IÉtudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.
MATH-506: Topology IV.b - cohomology ringsSingular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
MATH-410: Riemann surfacesThis course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
MATH-436: Homotopical algebraThis course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous
MATH-225: Topology II - fundamental groupsOn étudie des notions de topologie générale: unions et quotients d'espaces topologiques; on approfondit les notions de revêtements et de groupe fondamental,et d'attachements de cellules et on démontre