# Search result: Catalogue data in Autumn Semester 2019

Mathematics Master | ||||||

Electives For the Master's degree in Applied Mathematics the following additional condition (not manifest in myStudies) must be obeyed: At least 15 of the required 28 credits from core courses and electives must be acquired in areas of applied mathematics and further application-oriented fields. | ||||||

Electives: Pure Mathematics | ||||||

Selection: Algebra, Number Thy, Topology, Discrete Mathematics, Logic | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|---|

401-3033-00L | Gödel's Theorems | W | 8 credits | 3V + 1U | L. Halbeisen | |

Abstract | Die Vorlesung besteht aus drei Teilen: Teil I gibt eine Einführung in die Syntax und Semantik der Prädikatenlogik erster Stufe. Teil II behandelt den Gödel'schen Vollständigkeitssatz Teil III behandelt die Gödel'schen Unvollständigkeitssätze | |||||

Objective | Das Ziel dieser Vorlesung ist ein fundiertes Verständnis der Grundlagen der Mathematik zu vermitteln. | |||||

Content | Syntax und Semantik der Prädikatenlogik Gödel'scher Vollständigkeitssatz Gödel'sche Unvollständigkeitssätze | |||||

Literature | Ergänzende Literatur wird in der Vorlesung angegeben. | |||||

401-4037-69L | O-Minimality and Diophantine Applications | W | 4 credits | 2V | A. Forey | |

Abstract | O-minimal structures provide a framework for tame topology as envisioned by Grothendieck. Originally it was mainly a topic of interest for real algebraic geometers. However, since Pila and Wilkie proved their counting theorem for rational points of bounded height, many applications to diophantine and algebraic geometry have been found. | |||||

Objective | The overall goal of this course is to provide an introduction to o-minimality and to prove results needed for diophantine applications. | |||||

Content | The first part of the course will be devoted to the definition of o-minimal structures and to prove the cell decomposition theorem, which is crucial for describing the shape of subsets of an o-minimal structure. In the second part of the course, we will prove the Pila-Wilkie counting theorem. The last part will be devoted to diophantine applications, with the proof by Pila and Zanier of the Manin-Mumford conjecture and, if time permit, a sketch of the proof by Pila of the André-Oort conjecture for product of modular curves. | |||||

Literature | G. Jones and A. Wilkie: O-minimality and diophantine geometry, Cambridge University Press L. van den Dries: Tame topology and o-minimal structures, Cambridge University Press | |||||

Prerequisites / Notice | This course is appropriate for people with basic knowledge of commutative algebra and algebraic geometry. Knowledge of mathematical logic is welcomed but not required. | |||||

401-4117-69L | p-Adic Galois Representations | W | 4 credits | 2V | M. Mornev | |

Abstract | This course covers the structure theory of Galois groups of local fields, the rings of Witt vectors, the classification of p-adic representations via phi-modules, the tilting construction from the theory of perfectoid spaces, the ring of de Rham periods and the notion of a de Rham representation. | |||||

Objective | Understanding the construction of the ring of de Rham periods. | |||||

Content | In addition to the subjects mentioned in the abstract the course included the basic theory of local fields, l-adic local Galois representations, an oveview of perfectoid fields, the statements of the theorems of Fontaine-Winterberger and Faltings-Tsuji. | |||||

Literature | J.-M. Fontaine, Y. Ouyang. Theory of p-adic Galois representations. O. Brinon, B. Conrad. CMI summer school notes on p-adic Hodge theory. | |||||

Prerequisites / Notice | General topology, linear algebra, Galois theory. | |||||

401-3059-00L | Combinatorics II | W | 4 credits | 2G | N. Hungerbühler | |

Abstract | The course Combinatorics I and II is an introduction into the field of enumerative combinatorics. | |||||

Objective | Upon completion of the course, students are able to classify combinatorial problems and to apply adequate techniques to solve them. | |||||

Content | Contents of the lectures Combinatorics I and II: congruence transformation of the plane, symmetry groups of geometric figures, Euler's function, Cayley graphs, formal power series, permutation groups, cycles, Bunside's lemma, cycle index, Polya's theorems, applications to graph theory and isomers. | |||||

Selection: Geometry | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-4531-69L | Four-Manifolds | W | 4 credits | 2V | G. Smirnov | |

Abstract | Making use of theoretical physics methods, Witten came up with a novel approach to four-dimensional smooth structures, which made the constructing of exotic 4-manifolds somewhat routine. Today, Seiberg-Witten theory has become a classical topic in mathematics, which has a variety of applications to complex and symplectic geometry. We will go through some of these applications. | |||||

Objective | This introductory course has but one goal, namely to familiarize the students with the basics in the Seiberg-Witten theory. | |||||

Content | The course will begin with an introduction to Freedman’s classification theorem for simply-connected topological 4-manifolds. We then will move to the Seiberg-Witten equations and prove the Donaldson theorem of positive-definite intersection forms. Time permitting we may discuss some applications of SW-theory to real symplectic 4-manifolds. | |||||

Prerequisites / Notice | Some knowledge of homology, homotopy, vector bundles, moduli spaces of something, elliptic operators would be an advantage. | |||||

401-3057-00L | Finite Geometries IIDoes not take place this semester. | W | 4 credits | 2G | N. Hungerbühler | |

Abstract | Finite geometries I, II: Finite geometries combine aspects of geometry, discrete mathematics and the algebra of finite fields. In particular, we will construct models of axioms of incidence and investigate closing theorems. Applications include test design in statistics, block design, and the construction of orthogonal Latin squares. | |||||

Objective | Finite geometries I, II: Students will be able to construct and analyse models of finite geometries. They are familiar with closing theorems of the axioms of incidence and are able to design statistical tests by using the theory of finite geometries. They are able to construct orthogonal Latin squares and know the basic elements of the theory of block design. | |||||

Content | Finite geometries I, II: finite fields, rings of polynomials, finite affine planes, axioms of incidence, Euler's thirty-six officers problem, design of statistical tests, orthogonal Latin squares, transformation of finite planes, closing theorems of Desargues and Pappus-Pascal, hierarchy of closing theorems, finite coordinate planes, division rings, finite projective planes, duality principle, finite Moebius planes, error correcting codes, block design | |||||

Literature | - Max Jeger, Endliche Geometrien, ETH Skript 1988 - Albrecht Beutelspacher: Einführung in die endliche Geometrie I,II. Bibliographisches Institut 1983 - Margaret Lynn Batten: Combinatorics of Finite Geometries. Cambridge University Press - Dembowski: Finite Geometries. | |||||

Selection: Analysis | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-4351-69L | Optimal Transport | W | 4 credits | 2V | A. Figalli | |

Abstract | In this course I plan to give an introduction to optimal transport: I'll first introduce the optimal transport problem and explain how to solve it in some important cases of interest. Then I'll show a series of applications to geometry and to gradient flows. | |||||

Objective | The aim of the course is to provide a self contained introduction to optimal transport. The students are expected to know the basic concepts of measure theory. Although not strictly required, some basic knowledge of Riemannian geometry may be useful. | |||||

Literature | Topics in Optimal Transportation (Graduate Studies in Mathematics, Vol. 58), by Cédric Villani Optimal Transport for Applied Mathematicians (Calculus of Variations, PDEs, and Modeling), by Filippo Santambrogio Optimal transport and curvature, available at Link | |||||

401-4461-69L | Reading Course: Functional Analysis III, Unitary RepresentationsLimited number of participants. Please contact andreas.wieser@math.ethz.ch | W | 3 credits | 6A | M. Einsiedler, further speakers | |

Abstract | ||||||

Objective | ||||||

Selection: Further Realms | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-3502-69L | Reading Course To start an individual reading course, contact an authorised supervisor Link and register your reading course in myStudies. | W | 2 credits | 4A | Supervisors | |

Abstract | For this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study. | |||||

Objective | ||||||

401-3503-69L | Reading Course To start an individual reading course, contact an authorised supervisor Link and register your reading course in myStudies. | W | 3 credits | 6A | Supervisors | |

Abstract | For this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study. | |||||

Objective | ||||||

401-3504-69L | Reading Course To start an individual reading course, contact an authorised supervisor Link and register your reading course in myStudies. | W | 4 credits | 9A | Supervisors | |

Abstract | For this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study. | |||||

Objective | ||||||

401-0000-00L | Communication in Mathematics | W | 2 credits | 1V | W. Merry | |

Abstract | Don't hide your Next Great Theorem behind bad writing. This course teaches fundamental communication skills in mathematics: how to write clearly and how to structure mathematical content for different audiences, from theses, to preprints, to personal statements in applications. In addition, the course will help you establish a working knowledge of LaTeX. | |||||

Objective | Knowing how to present written mathematics in a structured and clear manner. | |||||

Content | Topics covered include: - Language conventions and common errors. - How to write a thesis (more generally, a mathematics paper). - How to use LaTeX. - How to write a personal statement for Masters and PhD applications. | |||||

Lecture notes | Full lecture notes will be made available on my website: https://www.merry.io/teaching/ | |||||

Prerequisites / Notice | There are no formal mathematical prerequisites. | |||||

401-0000-99L | Communication in Mathematics (Upgrade 2018 → 2019)This course unit is only for students who got 1 ECTS credit from last year's course unit 401-0000-00L CiM. (Registration now closed.) | W | 1 credit | 1V | W. Merry | |

Abstract | Don't hide your Next Great Theorem behind bad writing. This course teaches fundamental communication skills in mathematics: how to write clearly and how to structure mathematical content for different audiences, from theses, to preprints, to personal statements in applications. In addition, the course will help you establish a working knowledge of LaTeX. | |||||

Objective | Knowing how to present written mathematics in a structured and clear manner. | |||||

Content | Topics covered include: - Language conventions and common errors. - How to write a thesis (more generally, a mathematics paper). - How to use LaTeX. - How to write a personal statement for Masters and PhD applications. | |||||

Lecture notes | Full lecture notes will be made available on my website: https://www.merry.io/teaching/ | |||||

Prerequisites / Notice | There are no formal mathematical prerequisites. | |||||

Electives: Applied Mathematics and Further Application-Oriented Fields ¬ | ||||||

Selection: Numerical Analysis | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-4657-00L | Numerical Analysis of Stochastic Ordinary Differential Equations Alternative course title: "Computational Methods for Quantitative Finance: Monte Carlo and Sampling Methods" | W | 6 credits | 3V + 1U | K. Kirchner | |

Abstract | Course on numerical approximations of stochastic ordinary differential equations driven by Wiener processes. These equations have several applications, for example in financial option valuation. This course also contains an introduction to random number generation and Monte Carlo methods for random variables. | |||||

Objective | The aim of this course is to enable the students to carry out simulations and their mathematical convergence analysis for stochastic models originating from applications such as mathematical finance. For this the course teaches a decent knowledge of the different numerical methods, their underlying ideas, convergence properties and implementation issues. | |||||

Content | Generation of random numbers Monte Carlo methods for the numerical integration of random variables Stochastic processes and Brownian motion Stochastic ordinary differential equations (SODEs) Numerical approximations of SODEs Applications to computational finance: Option valuation | |||||

Lecture notes | There will be English, typed lecture notes for registered participants in the course. | |||||

Literature | P. Glassermann: Monte Carlo Methods in Financial Engineering. Springer-Verlag, New York, 2004. P. E. Kloeden and E. Platen: Numerical Solution of Stochastic Differential Equations. Springer-Verlag, Berlin, 1992. | |||||

Prerequisites / Notice | Prerequisites: Mandatory: Probability and measure theory, basic numerical analysis and basics of MATLAB programming. a) mandatory courses: Elementary Probability, Probability Theory I. b) recommended courses: Stochastic Processes. Start of lectures: Wednesday, September 18, 2019. | |||||

401-4785-00L | Mathematical and Computational Methods in Photonics | W | 8 credits | 4G | H. Ammari | |

Abstract | The aim of this course is to review new and fundamental mathematical tools, computational approaches, and inversion and optimal design methods used to address challenging problems in nanophotonics. The emphasis will be on analyzing plasmon resonant nanoparticles, super-focusing & super-resolution of electromagnetic waves, photonic crystals, electromagnetic cloaking, metamaterials, and metasurfaces | |||||

Objective | The field of photonics encompasses the fundamental science of light propagation and interactions in complex structures, and its technological applications. The recent advances in nanoscience present great challenges for the applied and computational mathematics community. In nanophotonics, the aim is to control, manipulate, reshape, guide, and focus electromagnetic waves at nanometer length scales, beyond the resolution limit. In particular, one wants to break the resolution limit by reducing the focal spot and confine light to length scales that are significantly smaller than half the wavelength. Interactions between the field of photonics and mathematics has led to the emergence of a multitude of new and unique solutions in which today's conventional technologies are approaching their limits in terms of speed, capacity and accuracy. Light can be used for detection and measurement in a fast, sensitive and accurate manner, and thus photonics possesses a unique potential to revolutionize healthcare. Light-based technologies can be used effectively for the very early detection of diseases, with non-invasive imaging techniques or point-of-care applications. They are also instrumental in the analysis of processes at the molecular level, giving a greater understanding of the origin of diseases, and hence allowing prevention along with new treatments. Photonic technologies also play a major role in addressing the needs of our ageing society: from pace-makers to synthetic bones, and from endoscopes to the micro-cameras used in in-vivo processes. Furthermore, photonics are also used in advanced lighting technology, and in improving energy efficiency and quality. By using photonic media to control waves across a wide band of wavelengths, we have an unprecedented ability to fabricate new materials with specific microstructures. The main objective in this course is to report on the use of sophisticated mathematics in diffractive optics, plasmonics, super-resolution, photonic crystals, and metamaterials for electromagnetic invisibility and cloaking. The book merges highly nontrivial multi-mathematics in order to make a breakthrough in the field of mathematical modelling, imaging, and optimal design of optical nanodevices and nanostructures capable of light enhancement, and of the focusing and guiding of light at a subwavelength scale. We demonstrate the power of layer potential techniques in solving challenging problems in photonics, when they are combined with asymptotic analysis and the elegant theory of Gohberg and Sigal on meromorphic operator-valued functions. In this course we shall consider both analytical and computational matters in photonics. The issues we consider lead to the investigation of fundamental problems in various branches of mathematics. These include asymptotic analysis, spectral analysis, mathematical imaging, optimal design, stochastic modelling, and analysis of wave propagation phenomena. On the other hand, deriving mathematical foundations, and new and efficient computational frameworks and tools in photonics, requires a deep understanding of the different scales in the wave propagation problem, an accurate mathematical modelling of the nanodevices, and fine analysis of complex wave propagation phenomena. An emphasis is put on mathematically analyzing plasmon resonant nanoparticles, diffractive optics, photonic crystals, super-resolution, and metamaterials. | |||||

Selection: Probability Theory, Statistics | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-4597-67L | Random Walks on Transitive Graphs | W | 4 credits | 2V | V. Tassion | |

Abstract | In this course, we will present modern topics at the interface between probability and geometric group theory. We will be mainly focused on the random walk, and discuss its behavior depending on the geometric properties of the underlying graph. | |||||

Objective | ||||||

Prerequisites / Notice | - Probability Theory. - Basic properties of Markov Chains. - No prerequisite on group theory, all the background will be introduced in class. | |||||

401-4619-67L | Advanced Topics in Computational StatisticsDoes not take place this semester. | W | 4 credits | 2V | not available | |

Abstract | This lecture covers selected advanced topics in computational statistics. This year the focus will be on graphical modelling. | |||||

Objective | Students learn the theoretical foundations of the selected methods, as well as practical skills to apply these methods and to interpret their outcomes. | |||||

Content | The main focus will be on graphical models in various forms: Markov properties of undirected graphs; Belief propagation; Hidden Markov Models; Structure estimation and parameter estimation; inference for high-dimensional data; causal graphical models | |||||

Prerequisites / Notice | We assume a solid background in mathematics, an introductory lecture in probability and statistics, and at least one more advanced course in statistics. | |||||

401-3628-14L | Bayesian Statistics | W | 4 credits | 2V | F. Sigrist | |

Abstract | Introduction to the Bayesian approach to statistics: decision theory, prior distributions, hierarchical Bayes models, empirical Bayes, Bayesian tests and model selection, empirical Bayes, Laplace approximation, Monte Carlo and Markov chain Monte Carlo methods. | |||||

Objective | Students understand the conceptual ideas behind Bayesian statistics and are familiar with common techniques used in Bayesian data analysis. | |||||

Content | Topics that we will discuss are: Difference between the frequentist and Bayesian approach (decision theory, principles), priors (conjugate priors, noninformative priors, Jeffreys prior), tests and model selection (Bayes factors, hyper-g priors for regression),hierarchical models and empirical Bayes methods, computational methods (Laplace approximation, Monte Carlo and Markov chain Monte Carlo methods) | |||||

Lecture notes | A script will be available in English. | |||||

Literature | Christian Robert, The Bayesian Choice, 2nd edition, Springer 2007. A. Gelman et al., Bayesian Data Analysis, 3rd edition, Chapman & Hall (2013). Additional references will be given in the course. | |||||

Prerequisites / Notice | Familiarity with basic concepts of frequentist statistics and with basic concepts of probability theory (random variables, joint and conditional distributions, laws of large numbers and central limit theorem) will be assumed. | |||||

401-3619-69L | Mathematics Tools in Machine Learning | W | 4 credits | 2G | F. Balabdaoui | |

Abstract | The course reviews many essential mathematical tools used in statistical learning. The lectures will cover the notions of hypotheses classes, sample complexity, PAC learnability, model validation and selection as well as results on several well-known algorithms and their convergence. | |||||

Objective | In the exploding world of artifical intelligence and automated learning, there is an urgent need to go back to the basis of what is driving many of the well-establsihed methods in statistical learning. The students attending the lectures will get acquainted with the main theoretical results needed to establish the theory of statistical learning. We start with defining what is meant by learning a task, a training sample, the trade-off between choosing a big class of functions (hypotheses) to learn the task and the difficulty of estimating the unknown function (generating the observed sample). The course will also cover the notion of learnability and the conditions under which it is possible to learn a task. In a second part, the lectures will cover algoritmic apsects where some well-known algorithms will be described and their convergence proved. Through the exerices classes, the students will deepen their understanding using their knowledge of the learned theory on some new situations, examples or some counterexamples. | |||||

Content | The course will cover the following subjects: (*) Definition of Learning and Formal Learning Models (*) Uniform Convergence (*) Linear Predictors (*) The Bias-Complexity Trade-off (*) VC-classes and the VC dimension (*) Model Selection and Validation (*) Convex Learning Problems (*) Regularization and Stability (*) Stochastic Gradient Descent (*) Support Vector Machines (*) Kernels | |||||

Literature | The course will be based on the book "Understanding Machine Learning: From Theory to Algorithms" by S. Shalev-Shwartz and S. Ben-David, which is available online through the ETH electronic library. Other good sources can be also read. This includes (*) the book "Neural Network Learning: Theoretical Foundations" de Martin Anthony and Peter L. Bartlett. This book can be borrowed from the ETH library. (*) the lectures notes on "Mathematics of Machine Learning" taught by Philippe Rigollet available through the OpenCourseWare website of MIT | |||||

Prerequisites / Notice | Being able to follow the lectures requires a solid background in Probability Theory and Mathematical Statistical. Notions in computations, convergence of algorithms can be helpful but are not required. | |||||

401-0625-01L | Applied Analysis of Variance and Experimental Design | W | 5 credits | 2V + 1U | L. Meier | |

Abstract | Principles of experimental design, one-way analysis of variance, contrasts and multiple comparisons, multi-factor designs and analysis of variance, complete block designs, Latin square designs, random effects and mixed effects models, split-plot designs, incomplete block designs, two-series factorials and fractional designs, power. | |||||

Objective | Participants will be able to plan and analyze efficient experiments in the fields of natural sciences. They will gain practical experience by using the software R. | |||||

Content | Principles of experimental design, one-way analysis of variance, contrasts and multiple comparisons, multi-factor designs and analysis of variance, complete block designs, Latin square designs, random effects and mixed effects models, split-plot designs, incomplete block designs, two-series factorials and fractional designs, power. | |||||

Literature | G. Oehlert: A First Course in Design and Analysis of Experiments, W.H. Freeman and Company, New York, 2000. | |||||

Prerequisites / Notice | The exercises, but also the classes will be based on procedures from the freely available, open-source statistical software R, for which an introduction will be held. | |||||

401-0649-00L | Applied Statistical Regression | W | 5 credits | 2V + 1U | M. Dettling | |

Abstract | This course offers a practically oriented introduction into regression modeling methods. The basic concepts and some mathematical background are included, with the emphasis lying in learning "good practice" that can be applied in every student's own projects and daily work life. A special focus will be laid in the use of the statistical software package R for regression analysis. | |||||

Objective | The students acquire advanced practical skills in linear regression analysis and are also familiar with its extensions to generalized linear modeling. | |||||

Content | The course starts with the basics of linear modeling, and then proceeds to parameter estimation, tests, confidence intervals, residual analysis, model choice, and prediction. More rarely touched but practically relevant topics that will be covered include variable transformations, multicollinearity problems and model interpretation, as well as general modeling strategies. The last third of the course is dedicated to an introduction to generalized linear models: this includes the generalized additive model, logistic regression for binary response variables, binomial regression for grouped data and poisson regression for count data. | |||||

Lecture notes | A script will be available. | |||||

Literature | Faraway (2005): Linear Models with R Faraway (2006): Extending the Linear Model with R Draper & Smith (1998): Applied Regression Analysis Fox (2008): Applied Regression Analysis and GLMs Montgomery et al. (2006): Introduction to Linear Regression Analysis | |||||

Prerequisites / Notice | The exercises, but also the classes will be based on procedures from the freely available, open-source statistical software package R, for which an introduction will be held. In the Mathematics Bachelor and Master programmes, the two course units 401-0649-00L "Applied Statistical Regression" and 401-3622-00L "Statistical Modelling" are mutually exclusive. Registration for the examination of one of these two course units is only allowed if you have not registered for the examination of the other course unit. | |||||

401-3627-00L | High-Dimensional Statistics | W | 4 credits | 2V | P. L. Bühlmann | |

Abstract | "High-Dimensional Statistics" deals with modern methods and theory for statistical inference when the number of unknown parameters is of much larger order than sample size. Statistical estimation and algorithms for complex models and aspects of multiple testing will be discussed. | |||||

Objective | Knowledge of methods and basic theory for high-dimensional statistical inference | |||||

Content | Lasso and Group Lasso for high-dimensional linear and generalized linear models; Additive models and many smooth univariate functions; Non-convex loss functions and l1-regularization; Stability selection, multiple testing and construction of p-values; Undirected graphical modeling | |||||

Literature | Peter Bühlmann and Sara van de Geer (2011). Statistics for High-Dimensional Data: Methods, Theory and Applications. Springer Verlag. ISBN 978-3-642-20191-2. | |||||

Prerequisites / Notice | Knowledge of basic concepts in probability theory, and intermediate knowledge of statistics (e.g. a course in linear models or computational statistics). | |||||

401-4623-00L | Time Series AnalysisDoes not take place this semester. | W | 6 credits | 3G | N. Meinshausen | |

Abstract | Statistical analysis and modeling of observations in temporal order, which exhibit dependence. Stationarity, trend estimation, seasonal decomposition, autocorrelations, spectral and wavelet analysis, ARIMA-, GARCH- and state space models. Implementations in the software R. | |||||

Objective | Understanding of the basic models and techniques used in time series analysis and their implementation in the statistical software R. | |||||

Content | This course deals with modeling and analysis of variables which change randomly in time. Their essential feature is the dependence between successive observations. Applications occur in geophysics, engineering, economics and finance. Topics covered: Stationarity, trend estimation, seasonal decomposition, autocorrelations, spectral and wavelet analysis, ARIMA-, GARCH- and state space models. The models and techniques are illustrated using the statistical software R. | |||||

Lecture notes | Not available | |||||

Literature | A list of references will be distributed during the course. | |||||

Prerequisites / Notice | Basic knowledge in probability and statistics | |||||

401-3612-00L | Stochastic SimulationDoes not take place this semester. | W | 5 credits | 3G | ||

Abstract | This course provides an introduction to statistical Monte Carlo methods. This includes applications of simulations in various fields (Bayesian statistics, statistical mechanics, operations research, financial mathematics), algorithms for the generation of random variables (accept-reject, importance sampling), estimating the precision, variance reduction, introduction to Markov chain Monte Carlo. | |||||

Objective | Stochastic simulation (also called Monte Carlo method) is the experimental analysis of a stochastic model by implementing it on a computer. Probabilities and expected values can be approximated by averaging simulated values, and the central limit theorem gives an estimate of the error of this approximation. The course shows examples of the many applications of stochastic simulation and explains different algorithms used for simulation. These algorithms are illustrated with the statistical software R. | |||||

Content | Examples of simulations in different fields (computer science, statistics, statistical mechanics, operations research, financial mathematics). Generation of uniform random variables. Generation of random variables with arbitrary distributions (quantile transform, accept-reject, importance sampling), simulation of Gaussian processes and diffusions. The precision of simulations, methods for variance reduction. Introduction to Markov chains and Markov chain Monte Carlo (Metropolis-Hastings, Gibbs sampler, Hamiltonian Monte Carlo, reversible jump MCMC). | |||||

Lecture notes | A script will be available in English. | |||||

Literature | P. Glasserman, Monte Carlo Methods in Financial Engineering. Springer 2004. B. D. Ripley. Stochastic Simulation. Wiley, 1987. Ch. Robert, G. Casella. Monte Carlo Statistical Methods. Springer 2004 (2nd edition). | |||||

Prerequisites / Notice | Familiarity with basic concepts of probability theory (random variables, joint and conditional distributions, laws of large numbers and central limit theorem) will be assumed. | |||||

Selection: Financial and Insurance Mathematics In the Master's programmes in Mathematics resp. Applied Mathematics 401-3913-01L Mathematical Foundations for Finance is eligible as an elective course, but only if 401-3888-00L Introduction to Mathematical Finance isn't recognised for credits (neither in the Bachelor's nor in the Master's programme). For the category assignment take contact with the Study Administration Office (www.math.ethz.ch/studiensekretariat) after having received the credits. | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-3925-00L | Non-Life Insurance: Mathematics and Statistics | W | 8 credits | 4V + 1U | M. V. Wüthrich | |

Abstract | The lecture aims at providing a basis in non-life insurance mathematics which forms a core subject of actuarial sciences. It discusses collective risk modeling, individual claim size modeling, approximations for compound distributions, ruin theory, premium calculation principles, tariffication with generalized linear models and neural networks, credibility theory, claims reserving and solvency. | |||||

Objective | The student is familiar with the basics in non-life insurance mathematics and statistics. This includes the basic mathematical models for insurance liability modeling, pricing concepts, stochastic claims reserving models and ruin and solvency considerations. | |||||

Content | The following topics are treated: Collective Risk Modeling Individual Claim Size Modeling Approximations for Compound Distributions Ruin Theory in Discrete Time Premium Calculation Principles Tariffication Generalized Linear Models and Neural Networks Bayesian Models and Credibility Theory Claims Reserving Solvency Considerations | |||||

Lecture notes | M. V. Wüthrich, Non-Life Insurance: Mathematics & Statistics http://ssrn.com/abstract=2319328 | |||||

Prerequisites / Notice | The exams ONLY take place during the official ETH examination period. This course will be held in English and counts towards the diploma of "Aktuar SAV". For the latter, see details under www.actuaries.ch. Prerequisites: knowledge of probability theory, statistics and applied stochastic processes. | |||||

401-3922-00L | Life Insurance Mathematics | W | 4 credits | 2V | M. Koller | |

Abstract | The classical life insurance model is presented together with the important insurance types (insurance on one and two lives, term and endowment insurance and disability). Besides that the most important terms such as mathematical reserves are introduced and calculated. The profit and loss account and the balance sheet of a life insurance company is explained and illustrated. | |||||

Objective | ||||||

401-3928-00L | Reinsurance Analytics | W | 4 credits | 2V | P. Antal, P. Arbenz | |

Abstract | This course provides an introduction to reinsurance from an actuarial perspective. The objective is to understand the fundamentals of risk transfer through reinsurance and models for extreme events such as natural or man-made catastrophes. The lecture covers reinsurance contracts, Experience and Exposure pricing, natural catastrophe modelling, solvency regulation, and insurance linked securities | |||||

Objective | This course provides an introduction to reinsurance from an actuarial perspective. The objective is to understand the fundamentals of risk transfer through reinsurance and the mathematical approaches associated with low frequency high severity events such as natural or man-made catastrophes. Topics covered include: - Reinsurance Contracts and Markets: Different forms of reinsurance, their mathematical representation, history of reinsurance, and lines of business. - Experience Pricing: Modelling of low frequency high severity losses based on historical data, and analytical tools to describe and understand these models - Exposure Pricing: Loss modelling based on exposure or risk profile information, for both property and casualty risks - Natural Catastrophe Modelling: History, relevance, structure, and analytical tools used to model natural catastrophes in an insurance context - Solvency Regulation: Regulatory capital requirements in relation to risks, effects of reinsurance thereon, and differences between the Swiss Solvency Test and Solvency 2 - Insurance linked securities: Alternative risk transfer techniques such as catastrophe bonds | |||||

Content | This course provides an introduction to reinsurance from an actuarial perspective. The objective is to understand the fundamentals of risk transfer through reinsurance and the mathematical approaches associated with low frequency high severity events such as natural or man-made catastrophes. Topics covered include: - Reinsurance Contracts and Markets: Different forms of reinsurance, their mathematical representation, history of reinsurance, and lines of business. - Experience Pricing: Modelling of low frequency high severity losses based on historical data, and analytical tools to describe and understand these models - Exposure Pricing: Loss modelling based on exposure or risk profile information, for both property and casualty risks - Natural Catastrophe Modelling: History, relevance, structure, and analytical tools used to model natural catastrophes in an insurance context - Solvency Regulation: Regulatory capital requirements in relation to risks, effects of reinsurance thereon, and differences between the Swiss Solvency Test and Solvency 2 - Insurance linked securities: Alternative risk transfer techniques such as catastrophe bonds | |||||

Lecture notes | Slides and lecture notes will be made available. | |||||

Prerequisites / Notice | Basic knowledge in statistics, probability theory, and actuarial techniques | |||||

401-3927-00L | Mathematical Modelling in Life Insurance | W | 4 credits | 2V | T. J. Peter | |

Abstract | In life insurance, it is essential to have adequate mortality tables, be it for reserving or pricing purposes. The course provides the tools necessary to create mortality tables from scratch. Additionally, we study various guarantees embedded in life insurance products and learn to price them with the help of stochastic models. | |||||

Objective | The course's objective is to provide the students with the understanding and the tools to create mortality tables on their own. Additionally, students should learn to price embedded options in life insurance. Aside of the mere application of specific models, they should develop an intuition for the various drivers of the value of these options. | |||||

Content | Following main topics are covered: 1. Guarantees and options embedded in life insurance products. - Stochastic valuation of participating contracts - Stochastic valuation of Unit Linked contracts 2. Mortality Tables: - Determining raw mortality rates - Smoothing techniques: Whittaker-Henderson, smoothing splines,... - Trends in mortality rates - Stochastic mortality model due to Lee and Carter - Neural Network extension of the Lee-Carter model - Integration of safety margins | |||||

Lecture notes | Lectures notes and slides will be provided | |||||

Prerequisites / Notice | The exams ONLY take place during the official ETH examination period. The course counts towards the diploma of "Aktuar SAV". Good knowledge in probability theory and stochastic processes is assumed. Some knowledge in financial mathematics is useful. | |||||

Selection: Mathematical Physics, Theoretical Physics | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

402-0843-00L | Quantum Field Theory ISpecial Students UZH must book the module PHY551 directly at UZH. | W | 10 credits | 4V + 2U | N. Beisert | |

Abstract | This course discusses the quantisation of fields in order to introduce a coherent formalism for the combination of quantum mechanics and special relativity. Topics include: - Relativistic quantum mechanics - Quantisation of bosonic and fermionic fields - Interactions in perturbation theory - Scattering processes and decays - Elementary processes in QED - Radiative corrections | |||||

Objective | The goal of this course is to provide a solid introduction to the formalism, the techniques, and important physical applications of quantum field theory. Furthermore it prepares students for the advanced course in quantum field theory (Quantum Field Theory II), and for work on research projects in theoretical physics, particle physics, and condensed-matter physics. | |||||

402-0861-00L | Statistical Physics | W | 10 credits | 4V + 2U | G. M. Graf | |

Abstract | The lecture focuses on classical and quantum statistical physics. Various techniques, cumulant expansion, path integrals, and specific systems are discussed: Fermions, photons/phonons, Bosons, magnetism, van der Waals gas. Phase transitions are studied in mean field theory (Weiss, Landau). Including fluctuations leads to critical phenomena, scaling, and the renormalization group. | |||||

Objective | This lecture gives an introduction into the the basic concepts and applications of statistical physics for the general use in physics and, in particular, as a preparation for the theoretical solid state physics education. | |||||

Content | Thermodynamics, three laws of thermodynamics, thermodynamic potentials, phenomenology of phase transitions. Classical statistical physics: micro-canonical-, canonical-, and grandcanonical ensembles, applications to simple systems. Quantum statistical physics: single particle, ideal quantum gases, fermions and bosons, statistical interaction. Techniques: variational approach, cumulant expansion, path integral formulation. Degenerate fermions: Fermi gas, electrons in magnetic field. Bosons: photons and phonons, Bose-Einstein condensation. Magnetism: Ising-, XY-, Heisenberg models, Weiss mean-field theory. Van der Waals gas-liquid transition. Landau theory of phase transitions, first- and second order, tricritical. Fluctuations: field theory approach, Gauss theory, self-consistent field, Ginzburg criterion. Critical phenomena: scaling theory, universality. Renormalization group: general theory and applications to spin models (real space RG), phi^4 theory (k-space RG), Kosterlitz-Thouless theory. | |||||

Lecture notes | Lecture notes available in English. | |||||

Literature | No specific book is used for the course. Relevant literature will be given in the course. | |||||

402-0830-00L | General Relativity Special Students UZH must book the module PHY511 directly at UZH. | W | 10 credits | 4V + 2U | P. Jetzer | |

Abstract | Manifold, Riemannian metric, connection, curvature; Special Relativity; Lorentzian metric; Equivalence principle; Tidal force and spacetime curvature; Energy-momentum tensor, field equations, Newtonian limit; Post-Newtonian approximation; Schwarzschild solution; Mercury's perihelion precession, light deflection. | |||||

Objective | Basic understanding of general relativity, its mathematical foundations, and some of the interesting phenomena it predicts. | |||||

Literature | Suggested textbooks: C. Misner, K, Thorne and J. Wheeler: Gravitation S. Carroll - Spacetime and Geometry: An Introduction to General Relativity R. Wald - General Relativity S. Weinberg - Gravitation and Cosmology N. Straumann - General Relativity with applications to Astrophysics | |||||

402-0897-00L | Introduction to String Theory | W | 6 credits | 2V + 1U | B. Hoare | |

Abstract | This course is an introduction to string theory. The first half of the course covers the bosonic string and its quantization in flat space, concluding with the introduction of D-branes and T-duality. The second half will cover some advanced topics, which will be selected from those listed below. | |||||

Objective | The objective of this course is to motivate the subject of string theory, exploring the important role it has played in the development of modern theoretical and mathematical physics. The goal of the first half of the course is to give a pedagogical introduction to the bosonic string in flat space. Building on this foundation, an overview of various more advanced topics will form the second half of the course. | |||||

Content | I. Introduction II. The relativistic point particle III. The classical closed string IV. Quantizing the closed string V. The open string and D-branes VI. T-duality in flat space Possible advanced topics include: VII. Conformal field theory VIII. The Polyakov path integral IX. String interactions X. Low energy effective actions XI. Superstring theory | |||||

Literature | Lecture notes: String Theory - D. Tong http://www.damtp.cam.ac.uk/user/tong/string.html Lectures on String Theory - G. Arutyunov http://stringworld.ru/files/Arutyunov_G._Lectures_on_string_theory.pdf Books: Superstring Theory - M. Green, J. Schwarz and E. Witten (two volumes, CUP, 1988) Volume 1: Introduction Volume 2: Loop Amplitudes, Anomalies and Phenomenology String Theory - J. Polchinski (two volumes, CUP, 1998) Volume 1: An Introduction to the Bosonic String Volume 2: Superstring Theory and Beyond Errata: http://www.kitp.ucsb.edu/~joep/errata.html Basic Concepts of String Theory - R. Blumenhagen, D. Lüst and S. Theisen (Springer-Verlag, 2013) | |||||

402-0878-00L | Field Theory with Symmetries and the Batalin-Vilkovisky Formalism | W | 4 credits | 2G | M. Schiavina | |

Abstract | The course is an introduction to the Batalin-Vilkovisky formalism, which provides a rigorous toolkit to treat classical and quantum field theories with symmetries, generalising the BRST approach. The course will feature applications to gauge theories and general relativity, and possibly to theories with defects (boundaries and corners). | |||||

Objective | The objective of this course is to expose master and graduate physics students to modern techniques in theoretical and mathematical physics to handle gauge symmetries in classical and quantum field theory. We aim to provide a solid mathematical background for third-semester master and graduate students to adventure further in this research direction. | |||||

Content | The course will start with a review of the BRST formalism expanding on its introduction in Quantum Field Theory II. It will provide a mathematical background on (Lie algebra) cohomology and the necessary requirements to describe the BV formalism, including an introduction to symplectic geometry on graded vector spaces. Applications of the BV formalism to different examples like gauge theories, general relativity and sigma models will be presented, and a discussion on quantisation of classical field theories in this setting, together with possible inclusion of defects, will be considered as concluding topics for the course. | |||||

Selection: Mathematical Optimization, Discrete Mathematics | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-3055-64L | Algebraic Methods in Combinatorics | W | 6 credits | 2V + 1U | B. Sudakov | |

Abstract | Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. This course provides a gentle introduction to Algebraic methods, illustrated by examples and focusing on basic ideas and connections to other areas. | |||||

Objective | The students will get an overview of various algebraic methods for solving combinatorial problems. We expect them to understand the proof techniques and to use them autonomously on related problems. | |||||

Content | Combinatorics is a fundamental mathematical discipline as well as an essential component of many mathematical areas, and its study has experienced an impressive growth in recent years. While in the past many of the basic combinatorial results were obtained mainly by ingenuity and detailed reasoning, the modern theory has grown out of this early stage and often relies on deep, well-developed tools. One of the main general techniques that played a crucial role in the development of Combinatorics was the application of algebraic methods. The most fruitful such tool is the dimension argument. Roughly speaking, the method can be described as follows. In order to bound the cardinality of of a discrete structure A one maps its elements to vectors in a linear space, and shows that the set A is mapped to linearly independent vectors. It then follows that the cardinality of A is bounded by the dimension of the corresponding linear space. This simple idea is surprisingly powerful and has many famous applications. This course provides a gentle introduction to Algebraic methods, illustrated by examples and focusing on basic ideas and connections to other areas. The topics covered in the class will include (but are not limited to): Basic dimension arguments, Spaces of polynomials and tensor product methods, Eigenvalues of graphs and their application, the Combinatorial Nullstellensatz and the Chevalley-Warning theorem. Applications such as: Solution of Kakeya problem in finite fields, counterexample to Borsuk's conjecture, chromatic number of the unit distance graph of Euclidean space, explicit constructions of Ramsey graphs and many others. The course website can be found at https://moodle-app2.let.ethz.ch/course/view.php?id=11617 | |||||

Lecture notes | Lectures will be on the blackboard only, but there will be a set of typeset lecture notes which follow the class closely. | |||||

Prerequisites / Notice | Students are expected to have a mathematical background and should be able to write rigorous proofs. | |||||

Auswahl: Theoretical Computer Science, Discrete Mathematics | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

263-4500-00L | Advanced Algorithms | W | 6 credits | 2V + 2U + 1A | M. Ghaffari, A. Krause | |

Abstract | This is an advanced course on the design and analysis of algorithms, covering a range of topics and techniques not studied in typical introductory courses on algorithms. | |||||

Objective | This course is intended to familiarize students with (some of) the main tools and techniques developed over the last 15-20 years in algorithm design, which are by now among the key ingredients used in developing efficient algorithms. | |||||

Content | The lectures will cover a range of topics, including the following: graph sparsifications while preserving cuts or distances, various approximation algorithms techniques and concepts, metric embeddings and probabilistic tree embeddings, online algorithms, multiplicative weight updates, streaming algorithms, sketching algorithms. | |||||

Lecture notes | https://people.inf.ethz.ch/gmohsen/AA19/ | |||||

Prerequisites / Notice | This course is designed for masters and doctoral students and it especially targets those interested in theoretical computer science, but it should also be accessible to last-year bachelor students. Sufficient comfort with both (A) Algorithm Design & Analysis and (B) Probability & Concentrations. E.g., having passed the course Algorithms, Probability, and Computing (APC) is highly recommended, though not required formally. If you are not sure whether you're ready for this class or not, please consult the instructor. | |||||

252-1425-00L | Geometry: Combinatorics and Algorithms | W | 6 credits | 2V + 2U + 1A | B. Gärtner, M. Hoffmann, M. Wettstein | |

Abstract | Geometric structures are useful in many areas, and there is a need to understand their structural properties, and to work with them algorithmically. The lecture addresses theoretical foundations concerning geometric structures. Central objects of interest are triangulations. We study combinatorial (Does a certain object exist?) and algorithmic questions (Can we find a certain object efficiently?) | |||||

Objective | The goal is to make students familiar with fundamental concepts, techniques and results in combinatorial and computational geometry, so as to enable them to model, analyze, and solve theoretical and practical problems in the area and in various application domains. In particular, we want to prepare students for conducting independent research, for instance, within the scope of a thesis project. | |||||

Content | Planar and geometric graphs, embeddings and their representation (Whitney's Theorem, canonical orderings, DCEL), polygon triangulations and the art gallery theorem, convexity in R^d, planar convex hull algorithms (Jarvis Wrap, Graham Scan, Chan's Algorithm), point set triangulations, Delaunay triangulations (Lawson flips, lifting map, randomized incremental construction), Voronoi diagrams, the Crossing Lemma and incidence bounds, line arrangements (duality, Zone Theorem, ham-sandwich cuts), 3-SUM hardness, counting planar triangulations. | |||||

Lecture notes | yes | |||||

Literature | Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Cheong, Computational Geometry: Algorithms and Applications, Springer, 3rd ed., 2008. Satyan Devadoss, Joseph O'Rourke, Discrete and Computational Geometry, Princeton University Press, 2011. Stefan Felsner, Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, Teubner, 2004. Jiri Matousek, Lectures on Discrete Geometry, Springer, 2002. Takao Nishizeki, Md. Saidur Rahman, Planar Graph Drawing, World Scientific, 2004. | |||||

Prerequisites / Notice | Prerequisites: The course assumes basic knowledge of discrete mathematics and algorithms, as supplied in the first semesters of Bachelor Studies at ETH. Outlook: In the following spring semester there is a seminar "Geometry: Combinatorics and Algorithms" that builds on this course. There are ample possibilities for Semester-, Bachelor- and Master Thesis projects in the area. | |||||

252-0417-00L | Randomized Algorithms and Probabilistic Methods | W | 8 credits | 3V + 2U + 2A | A. Steger | |

Abstract | Las Vegas & Monte Carlo algorithms; inequalities of Markov, Chebyshev, Chernoff; negative correlation; Markov chains: convergence, rapidly mixing; generating functions; Examples include: min cut, median, balls and bins, routing in hypercubes, 3SAT, card shuffling, random walks | |||||

Objective | After this course students will know fundamental techniques from probabilistic combinatorics for designing randomized algorithms and will be able to apply them to solve typical problems in these areas. | |||||

Content | Randomized Algorithms are algorithms that "flip coins" to take certain decisions. This concept extends the classical model of deterministic algorithms and has become very popular and useful within the last twenty years. In many cases, randomized algorithms are faster, simpler or just more elegant than deterministic ones. In the course, we will discuss basic principles and techniques and derive from them a number of randomized methods for problems in different areas. | |||||

Lecture notes | Yes. | |||||

Literature | - Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan, Cambridge University Press (1995) - Probability and Computing, Michael Mitzenmacher and Eli Upfal, Cambridge University Press (2005) | |||||

Selection: Further Realms | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

227-0423-00L | Neural Network Theory | W | 4 credits | 2V + 1U | H. Bölcskei, E. Riegler | |

Abstract | The class focuses on fundamental mathematical aspects of neural networks with an emphasis on deep networks: Universal approximation theorems, capacity of separating surfaces, generalization, reproducing Kernel Hilbert spaces, support vector machines, fundamental limits of deep neural network learning, dimension measures, feature extraction with scattering networks | |||||

Objective | After attending this lecture, participating in the exercise sessions, and working on the homework problem sets, students will have acquired a working knowledge of the mathematical foundations of neural networks. | |||||

Content | 1. Universal approximation with single- and multi-layer networks 2. Geometry of decision surfaces 3. Separating capacity of nonlinear decision surfaces 4. Generalization 5. Reproducing Kernel Hilbert Spaces, support vector machines 6. Deep neural network approximation theory: Fundamental limits on compressibility of signal classes, Kolmogorov epsilon-entropy of signal classes, covering numbers, fundamental limits of deep neural network learning 7. Learning of real-valued functions: Pseudo-dimension, fat-shattering dimension, Vapnik-Chervonenkis dimension 8. Scattering networks | |||||

Lecture notes | Detailed lecture notes will be provided as we go along. | |||||

Prerequisites / Notice | This course is aimed at students with a strong mathematical background in general, and in linear algebra, analysis, and probability theory in particular. | |||||

401-3502-69L | Reading Course Link and register your reading course in myStudies. | W | 2 credits | 4A | Supervisors | |

Abstract | ||||||

Objective | ||||||

401-3503-69L | Reading Course Link and register your reading course in myStudies. | W | 3 credits | 6A | Supervisors | |

Abstract | ||||||

Objective | ||||||

401-3504-69L | Reading Course Link and register your reading course in myStudies. | W | 4 credits | 9A | Supervisors | |

Abstract | ||||||

Objective | ||||||

401-0000-00L | Communication in Mathematics | W | 2 credits | 1V | W. Merry | |

Abstract | Don't hide your Next Great Theorem behind bad writing. This course teaches fundamental communication skills in mathematics: how to write clearly and how to structure mathematical content for different audiences, from theses, to preprints, to personal statements in applications. In addition, the course will help you establish a working knowledge of LaTeX. | |||||

Objective | Knowing how to present written mathematics in a structured and clear manner. | |||||

Content | Topics covered include: - Language conventions and common errors. - How to write a thesis (more generally, a mathematics paper). - How to use LaTeX. - How to write a personal statement for Masters and PhD applications. | |||||

Lecture notes | Full lecture notes will be made available on my website: https://www.merry.io/teaching/ | |||||

Prerequisites / Notice | There are no formal mathematical prerequisites. | |||||

401-0000-99L | Communication in Mathematics (Upgrade 2018 → 2019)This course unit is only for students who got 1 ECTS credit from last year's course unit 401-0000-00L CiM. (Registration now closed.) | W | 1 credit | 1V | W. Merry | |

Abstract | Don't hide your Next Great Theorem behind bad writing. This course teaches fundamental communication skills in mathematics: how to write clearly and how to structure mathematical content for different audiences, from theses, to preprints, to personal statements in applications. In addition, the course will help you establish a working knowledge of LaTeX. | |||||

Objective | Knowing how to present written mathematics in a structured and clear manner. | |||||

Content | Topics covered include: - Language conventions and common errors. - How to write a thesis (more generally, a mathematics paper). - How to use LaTeX. - How to write a personal statement for Masters and PhD applications. | |||||

Lecture notes | Full lecture notes will be made available on my website: https://www.merry.io/teaching/ | |||||

Prerequisites / Notice | There are no formal mathematical prerequisites. |