Search result: Catalogue data in Autumn Semester 2020

Mathematics Master Information
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
NumberTitleTypeECTSHoursLecturers
401-3119-70Lp-Adic NumbersW4 credits2VP. Bengoechea Duro
AbstractThis course is an introduction to the p-adic numbers. We will see how the field of p-adic numbers Q_p is build. We will explore the (strange) topology and the arithmetic of Q_p, as well as some elementary analytic concepts such as functions, continuity, integrals, etc. We will explain an algebraic and an analytic reasons of interest for the existence of p-adic numbers.
Objective
Content- Absolute values on Q and Completions
- Topology and Arithmetic of Q_p, p-adic Integers
- Equations over p-adic numbers and Hensel's Lemma
- Local-global principle
- Hasse-Minkowski's Theorem on binary quadratic forms
- Elementary Analysis in Q_p
- the p-adic Riemann zeta function
Literature"p-adic Numbers. An Introduction", Fernando Q. Gouvea (Springer)
"p-adic Numbers, p-adic Analysis, and Zeta-Functions", Neal Koblitz (Springer)
"p-adic numbers and Diophantine equations", Yuri Bilu (online notes 2013)
Prerequisites / NoticeThe courses Topology, Measure and Integration, Algebra I/II are required prerequisites.
401-3059-00LCombinatorics II
Does not take place this semester.
W4 credits2GN. Hungerbühler
AbstractThe course Combinatorics I and II is an introduction into the field of enumerative combinatorics.
ObjectiveUpon completion of the course, students are able to classify combinatorial problems and to apply adequate techniques to solve them.
ContentContents 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
NumberTitleTypeECTSHoursLecturers
401-3533-70LDifferential Geometry IIIW4 credits2VU. Lang
AbstractTopics in Riemannian geometry in the large: the structure of complete, non-compact Riemannian manifolds of non-negative sectional curvature, including Perelman's (1994) proof of the Cheeger-Gromoll soul conjecture; the Besson-Courtois-Gallot barycenter method (1996) and the proofs of the minimal entropy theorem and the Mostow rigidity theorem for rank one locally symmetric spaces.
Objective
401-4531-66LTopics in Rigidity Theory Information W6 credits3VM. Burger
AbstractThe aim of this course is to give detailed proofs of Margulis' normal subgroup theorem and his superrigidity theorem for lattices in higher rank Lie groups.
ObjectiveUnderstand the basic techniques of rigidity theory.
ContentThis course gives an introduction to rigidity theory, which is a set of techniques initially invented to understand the structure of a certain class of discrete subgroups of Lie groups, called lattices, and currently used in more general contexts of groups arising as isometries of non-positively curved geometries. A prominent example of a lattice in the Lie group SL(n, R) is the group SL(n, Z) of integer n x n matrices with determinant 1. Prominent questions concerning this group are:
- Describe all its proper quotients.
- Classify all its finite dimensional linear representations.
- More generally, can this group act by diffeomorphisms on "small" manifolds like the circle?
- Does its Cayley graph considered as a metric space at large scale contain enough information to recover the group structure?
In this course we will give detailed treatment for the answers to the first two questions; they are respectively Margulis' normal subgroup theorem and Margulis' superrigidity theorem. These results, valid for all lattices in simple Lie groups of rank at least 2 --like SL(n, R), with n at least 3-- lead to the arithmeticity theorem, which says that all lattices are obtained by an arithmetic construction.
Literature- R. Zimmer: "Ergodic Theory and Semisimple groups", Birkhauser 1984.
- D. Witte-Morris: "Introduction to Arithmetic groups", available on Arxiv
- Y. Benoist: "Five lectures on lattices in semisimple Lie groups", available on his homepage.
- M.Burger: "Rigidity and Arithmeticity", European School of Group Theory, 1996, handwritten notes, will be put online.
Prerequisites / NoticeFor this course some knowledge of elementary Lie theory would be good. We will however treat Lie groups by examples and avoid structure theory since this is not the point of the course nor of the techniques.
401-4141-70LCurves, Jacobians, and Modern Abel-Jacobi Theory Information W6 credits3VR. Pandharipande
Abstract
Objective
401-3057-00LFinite Geometries IIW4 credits2GN. Hungerbühler
AbstractFinite 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.
ObjectiveFinite 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.
ContentFinite 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
NumberTitleTypeECTSHoursLecturers
401-4355-70LElliptic Regularity TheoryW8 credits4VM. Struwe
AbstractWe extend the theory developed in Functional Analysis II in various directions, including variants of the maximum principle, Harnack's inequality, L^p-theory, and systems. Certain limit cases will be discussed. Examples, including the harmonic map system, will illustrate the use of these methods.
Objective
LiteratureGiaquinta, Mariano: Introduction to regularity theory for nonlinear elliptic systems. Lectures in Mathematics ETH Zürich. Birkhäuser Verlag, Basel, 1993.

Gilbarg, David; Trudinger, Neil S.: Elliptic partial differential equations of second order. Springer-Verlag, Berlin, 2001.

Further references will be given in the lectures.
Selection: Further Realms
NumberTitleTypeECTSHoursLecturers
401-3502-70LReading Course Restricted registration - show details
To start an individual reading course, contact an authorised supervisor
Link
and register your reading course in myStudies.
W2 credits4ASupervisors
AbstractFor this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study.
Objective
401-3503-70LReading Course Restricted registration - show details
To start an individual reading course, contact an authorised supervisor
Link
and register your reading course in myStudies.
W3 credits6ASupervisors
AbstractFor this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study.
Objective
401-3504-70LReading Course Restricted registration - show details
To start an individual reading course, contact an authorised supervisor
Link
and register your reading course in myStudies.
W4 credits9ASupervisors
AbstractFor this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study.
Objective
401-0000-00LCommunication in MathematicsW2 credits1VW. Merry
AbstractDon'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.
ObjectiveKnowing how to present written mathematics in a structured and clear manner.
ContentTopics 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 notesFull lecture notes will be made available on my website:

Link
Prerequisites / NoticeThere are no formal mathematical prerequisites.
Electives: Applied Mathematics and Further Application-Oriented Fields
¬
Selection: Numerical Analysis
NumberTitleTypeECTSHoursLecturers
401-4657-00LNumerical Analysis of Stochastic Ordinary Differential Equations Information Restricted registration - show details
Alternative course title: "Computational Methods for Quantitative Finance: Monte Carlo and Sampling Methods"
W6 credits3V + 1UD. Salimova
AbstractCourse 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.
ObjectiveThe 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.
ContentGeneration 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 notesThere will be English, typed lecture notes for registered participants in the course.
LiteratureP. 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 / NoticePrerequisites:

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 16, 2020.
401-4785-00LMathematical and Computational Methods in PhotonicsW8 credits4GH. Ammari
AbstractThe 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
ObjectiveThe 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.
401-4427-70LRepresentation Theory in Signal AnalysisW4 credits2VF. Bartolucci
AbstractThe scope of the course is to give an introduction to the theory of unitary representations of locally compact groups with a particular regard to the applications of this theory in signal analysis.
Objective
ContentThe scope of the course is to give an introduction to the theory of
unitary representations of locally compact groups with a particular regard to
the applications of this theory in signal analysis. The course starts with an
overview of the measure theory on locally compact groups. Then, the fundamental
definitions and results in representation theory are presented (irreducible
unitary representations, Schur’s lemma, voice transforms, square-integrable
representations, reproducing formulae). We conclude the course showing that
some of the most important transforms in applied harmonic analysis such as the
Gabor transform, the wavelet transform and the shearlet transform are related
to square-integrable unitary representations.
Prerequisites / NoticePrerequisites: measure theory, topology, functional analysis, operator
theory, Fourier analysis
Selection: Probability Theory, Statistics
NumberTitleTypeECTSHoursLecturers
401-4607-70LA Medley of Advanced ProbabilityW4 credits2VW. Werner
AbstractWe will review various topics of probability theory, with the goal to provide a short self-contained introduction to each of them, and try to describe the type of ideas and techniques that are used.
Exact topics will include (small bits of) Lévy processes, continuous-state branching processes, large deviation theory, large random matrices.
ObjectiveThe goal is for each of the topics that will be covered to provide:
- A general introduction to the subject
- An example of one of the main statements, and some of the ideas that go into the proof
- A detailed proof of one statement
Prerequisites / NoticePrerequisites: Martingales, Markov chains, Brownian motion, stochastic calculus.
401-3628-14LBayesian Statistics
Does not take place this semester.
W4 credits2V
AbstractIntroduction 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.
ObjectiveStudents understand the conceptual ideas behind Bayesian statistics and are familiar with common techniques used in Bayesian data analysis.
ContentTopics 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 notesA script will be available in English.
LiteratureChristian 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 / NoticeFamiliarity 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-0625-01LApplied Analysis of Variance and Experimental DesignW5 credits2V + 1UL. Meier
AbstractPrinciples 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.
ObjectiveParticipants 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.
ContentPrinciples 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.
LiteratureG. Oehlert: A First Course in Design and Analysis of Experiments, W.H. Freeman and Company, New York, 2000.
Prerequisites / NoticeThe 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-00LApplied Statistical RegressionW5 credits2V + 1UM. Dettling
AbstractThis 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.
ObjectiveThe students acquire advanced practical skills in linear regression analysis and are also familiar with its extensions to generalized linear modeling.
ContentThe 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 notesA script will be available.
LiteratureFaraway (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 / NoticeThe 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-4521-70LGeometric Tomography - Uniqueness, Statistical Reconstruction and Algorithms Information Restricted registration - show details W4 credits2VJ. Hörrmann
AbstractSelf-contained course on the theoretical aspects of the reconstruction of geometric objects from tomographic projection and section data.
ObjectiveIntroduction to geometric tomography and understanding of various theoretical aspects of reconstruction problems.
ContentThe problem of reconstruction of an object from geometric information like X-ray data is a classical inverse problem on the overlap between applied mathematics, statistics, computer science and electrical engineering. We focus on various aspects of the problem in the case of prior shape information on the reconstruction object. We will answer questions on uniqueness of the reconstruction and also cover statistical and algorithmic aspects.
LiteratureR. Gardner: Geometric Tomography
F. Natterer: The Mathematics of Computerized Tomography
A. Rieder: Keine Probleme mit inversen Problemen
Prerequisites / NoticeA sound mathematical background in geometry, analysis and probability is required though a repetition of relevant material will be included. The ability to understand and write mathematical proofs is mandatory.
401-4607-59LPercolation Theory Information W4 credits2VV. Tassion
AbstractAn introduction to the percolation theory.
ObjectivePercolation theory has many applications and is one of the most famous model to
describe phase transition phenomena in physics. One reason for this success is
the variety of mathematical tools, which allows for a precise and rigorous
description of the models. The objective of this course is to gain familiarity
with the methods of the percolation theory and to learn some of its important
results. The students will develop their background and intuition in
probability, and the course is particularly recommended to students with
additional interests in physics or graph theory.
ContentDefinition of percolation. Standard tools: FKG, BK inequalities, Mixing
property, Russo's formula. Sharpness of the phase transition. Correlation
length and interpretations. Uniqueness of the infinite cluster. Critical
percolation in dimension 2. Supercritical percolation in dimension d>2,
Grimmett-Marstrand Theorem and consequences.
LiteratureB. Bollobas, O. Riordan: Percolation, CUP 2006
G. Grimmett: Percolation 2ed, Springer 1999
Prerequisites / NoticePreliminaries:
401-2604-00L Probability and Statistics (mandatory)
401-3601-00L Probability Theory (recommended)
  •  Page  1  of  3 Next page Last page     All