# 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. |

- Page 1 of 3 All