Áù¾ÅÉ«ÌÃ

Discrete Geometry: Euclidean, spherical and hyperbolic n-spaces, trigonometry, isometries, convex sets, convex polytopes, (mixed) volume(s), classical discrete groups, tilings, isoperimetric inequalities, packings, coverings. Graph Theory: connectivity; trees; Euler trails and tours; Hamilton cycles and paths; matchings; edge colourings; vertex colourings; homomorphisms; plane and planar graphs; extremal graph theory and Ramsey theory.

631.01. Discrete Geometry

631.03. Graph Theory

Algebraic Number Theory: an introduction to number fields, rings of integers, ideals, unique factorization, the different and the discriminant. The main objective to the course will be to prove the finiteness of the class number and Dirichlet's Unit Theorem.
Analytic Number Theory: students will learn tools to aid in the study of the average behaviour of arithmetic functions, including the use of zeta functions, to prove results about the distribution of prime numbers.

641.01. Algebraic Number Theory

641.03. Analytic Number Theory

Modular forms and automorphic representations and their L-functions. Modularity Theorem from two perspectives.

Classical Perspective on Modular Forms: introduction to modular curves as moduli spaces for elliptic curves and as differential forms on modular curves. A study of L-functions attached to modular forms and the modularity theorem.

An Introduction to Automorphic Representations: introduction to the Langlands Programme. A study of partial L-functions attached to automorphic representations and known instances of the Langlands Correspondence.

647.01. Classical Perspective on Modular Forms

647.03. An Introduction to Automorphic Representations

Convex Optimization: an introduction to modern convex optimization, including basics of convex analysis and duality, linear conic programming, robust optimization, and applications.

Scientific Computation: an introduction to both the methodological and the implementation components underlying modern scientific computations, with a natural emphasis on numerical linear algebra, and including modern computing architectures and their implications for numerical algorithms.

Numerical Differential Equations: fundamentals of solving DEs numerically, addressing the existence, stability and efficiency of such methods.

661.01. Convex Optimization

661.03. Scientific Computation

661.05. Numerical Differential Equations

Interior Point Methods: exposes students to the modern IPM theory with some applications, to the extent that at the end of the course a student should be able to implement a basic IPM algorithm.

Theoretical Numerical Analysis: provides the theoretical underpinnings for the analysis of modern numerical methods, covering topics such as linear operators on normed spaces, approximation theory, nonlinear equations in Banach spaces, Fourier analysis, Sobolev spaces and weak formulations of elliptic boundary value problems, with applications to finite difference, finite element and wavelet methods.

Differential Equations: essential ideas relating to the analysis of differential equations from a functional analysis point of view. General topics include Hilbert spaces and the Lax-Milgram’s theorem, variational formulation of boundary value problems, finite element methods, Sobolev spaces, distributions, and pseudo-differential operators.

663.01. Interior Point Methods

663.03. Theoretical Numerical Analysis

663.05. Differential Equations

Wavelet Analysis: covers the design and implementation of wavelet methods for modern signal processing, particularly for one- and two-dimensional signals (audio and images).

Mathematical Biology: introduction to discrete models of mathematical biology, including difference equations, models of population dynamics and the like. Topics include stability of models describe by difference equations, continuous spatially homogeneous processes and spatially distributed models.

669.01. Wavelet Analysis

669.03. Mathematical Biology

Topics include specific areas of mathematical finance and build on Mathematics 681.

Lévy Processes (LP): fundamental concepts associated with LP such as infinite divisibility, the Lévy-Khintchine formula, the Lévy-Itô decomposition, subordinators, LP as time-changed Brownian motions, and also dealing with semi-groups and generators of LP, the Itô formula for LP, the Girsanov theorem, stochastic differential equations driven by LP, the Feynman-Kac formula, applications of LP and numerical simulation of LP.

Credit Risk: corporate bond markets, modelling the bankruptcy risk of a firm, and understanding how corporate bonds are priced.

691.01. Lévy Processes

691.03. Credit Risk

Topics include specific areas of mathematical finance and build on Mathematics 681 and 683.

Monte Carlo Methods for Quantitative Finance: random number generation, simulation of stochastic differential equations, option valuation, variance reduction techniques, quasi-Monte Carlo methods, computing ‘greeks', valuation of path-dependent and early-exercise options; applications to risk management; Markov Chain Monte Carlo methods.

Energy, Commodity and Environmental Finance: energy and commodity markets; spot, futures, forwards and swap contracts; the theory of storage; stochastic models for energy prices; model calibration; emissions market modelling; weather derivatives; energy risk management; energy option valuation.

693.01 Monte Carlo Methods for Quantitative Finance

693.03 Energy, Commodity and Environmental Finance