Suchergebnis: Katalogdaten im Herbstsemester 2015
|Seminare und Semesterarbeiten|
Bitte Seminare frühzeitig im myStudies belegen, damit wir einen allfälligen Bedarf an weiteren Seminaren rechtzeitig erkennen. Bei einigen Seminaren werden Wartelisten geführt. Belegen Sie trotzdem höchstens zwei Mathematik-Seminare. In diesem Fall bekunden Sie für das Seminar, das Sie zuerst belegen, eine höhere Präferenz.
|401-3050-65L||Student Seminar in Combinatorics: Linear Complementarity |
Maximale Teilnehmerzahl: 18
|W||4 KP||2S||K. Fukuda|
|Kurzbeschreibung||We study the combinatorics and the complexity of various subclasses of the linear complementarity problem.|
|Lernziel||To understand the importance of linear complementarity as a common generalization of linear programming, bimatrix games and|
convex quadratic programming.
|Inhalt||The Linear Complementarity Problem (LCP) was introduced in mid 1960's (1965-67) by Lemke and Cottle-Dantzig|
as a common generalization of linear programming, bimatrix game and convex quadratic programming.
The problem is NP-hard in general, but there are many subclasses of LCP that are in P (polynomially solvable)
or suspected to be in P. The reason for the possible polynomially solvability is that these studied
subclasses (e.g. P-matrix LCPs and positive-definite LCPs) can be formulated as a problem which
admits a solution that has a succinct certificate for its correctness. Moreover, there are elegant
combinatorial abstractions of these subclasses.
In this seminar, we study the most important papers/books, both old and new, in the theory of LCP, and
aim at understanding what is crucial lack of knowledge in proving or disproving existing conjectures.
|Literatur||To be posted here before the first class on September 15.|
The seminar schedule and a list of articles:
(Version October 7, 2015). Please check the version date, as it gets updated frequently.
The slides of the overview (Revised on September 22, 2015):
|Voraussetzungen / Besonderes||Basic knowlege of linear programming.|
|401-3110-65L||Monstrous Moonshine |
Maximale Teilnehmerzahl: 16
|W||4 KP||2S||C. A. Keller|
|Kurzbeschreibung||We study Monstrous Moonshine, the surprising connection between modular forms and the Monster group.|
|Lernziel||To understand the equation 196884 = 196883 + 1.|
|Voraussetzungen / Besonderes||Algebra I and II. Some familiarity with modular forms and Lie algebras is helpful, but not crucial: all necessary concepts will be introduced in the early talks.|
|401-3320-65L||Algebraic Groups and Actions |
The seminar is for more advanced students. Registration is officially closed, but if Prof. Doran agrees, further registrations (via the Study Administration) might be possible.
|W||4 KP||2S||B. R. Doran|
|401-4460-62L||Functional Analysis III |
Maximale Teilnehmerzahl: 12
|W||4 KP||2S||M. Einsiedler|
|Kurzbeschreibung||We will discuss various additional topics in Functional Analysis: unitary representations of abelian and non-abelian groups, Choquet's theorem on extremal points, distributions, amenability and property (T).|
|Voraussetzungen / Besonderes||Prerequisites: Functional Analysis I and II|
|401-4600-65L||Student Seminar in Probability: Gaussian Processes on Trees |
Limited number of participants.
Registration to the seminar will only be effective once confirmed by email from the organizers.
|W||4 KP||2S||A.‑S. Sznitman, J. Bertoin, A. Knowles, P. Nolin, W. Werner|
|Kurzbeschreibung||The seminar will discuss results concerning branching Brownian motion.|
|Inhalt||The seminar is centered around a topic in probability theory which changes each semester.|
|Voraussetzungen / Besonderes||The student seminar in probability is held at times at the undergraduate level (typically during the spring term) and at times at the graduate level (typically during the autumn term). The themes vary each semester.|
The number of participants to the seminar is limited. Registration to the seminar will only be effective once confirmed by email from the organizers.
|401-3600-65L||Regularity Structures |
Teilnehmerzahl: 15 bis maximal 20
|W||4 KP||2S||J. Teichmann|
|Kurzbeschreibung||The seminar introduces and discusses main theorems around Martin Hairer's regularity structures following the article "Introduction to regularity structures" (Braz Jour Prob Stat 29).|
|Voraussetzungen / Besonderes||The seminar is suited for Bachelor and Master students. Some knowledge in linear functional analysis and algebra is required.|
|401-3650-65L||Numerical Analysis Seminar: Mathematics for Nanophotonics|
Limited number of participants.
|W||4 KP||2S||H. Ammari|
|Kurzbeschreibung||The aim of this seminar is to review new and fundamental mathematical|
tools, computational approaches, and inversion and optimal design methods
to address challenging problems in nanophotonics. An emphasis will be put
on analyzing plasmon resonant nanoparticles.
|401-4660-65L||Mathematics of Computerized Tomography |
Maximale Teilnehmerzahl: 10
|W||4 KP||2S||R. Alaifari|
|Kurzbeschreibung||This seminar should provide an overview of the mathematical principles and fundamental concepts behind computerized tomography. The main topics are the Radon transform and its properties, inversion formulas, ill-posedness and reconstruction techniques.|
|263-4200-00L||Seminar SAT||W||2 KP||2S||E. Welzl|
|Kurzbeschreibung||Study and presentation of research papers from the literature on "Boolean Satisfiability-Combinatorics and Algorithms".|
|Lernziel||Goal of this seminar is to study and present, in continuation of the course "Boolean Satisfiability-Combinatorics and Algorithms", research papers from the literature.|
|Literatur||A list of papers for presentations will be distributed at the beginning of the seminar.|
|Voraussetzungen / Besonderes||The seminar builds heavily on the material covered in the course "Boolean Satisfiability-Combinatorics and Algorithms." Successful completion of that course is a prerequisite for participation in the seminar.|
|263-4203-00L||Geometry: Combinatorics and Algorithms |
Findet dieses Semester nicht statt.
|W||2 KP||2S||B. Gärtner, E. Welzl|
|Kurzbeschreibung||This seminar is held once a year and complements the courses Computational Geometry and Geometric Graphs: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent. The seminar is a good preparation for a master, diploma, or semester thesis in the area.|
|Lernziel||Each student is expected to read, understand, and elaborate on a selected research paper. To this end, (s)he should give a 45-min. presentation about the paper. The process includes|
* getting an overview of the related literature;
* understanding and working out the background/motivation:
why and where are the questions addressed relevant?
* understanding the contents of the paper in all details;
* selecting parts suitable for the presentation;
* presenting the selected parts in such a way that an audience
with some basic background in geometry and graph theory can easily understand and appreciate it.
|Voraussetzungen / Besonderes||To attend the seminar, some basic knowledge in (discrete and computational) geometry and graphs and algorithms is required. Thus, previous participation in some of the courses "Graphs and Algorithms", "Computational Geometry", "Geometric Graphs: Combinatorics & Algorithms", or similar courses is strongly encouraged. It is also possible to take this seminar in parallel to the lecture "Computational Geometry".|
- Seite 1 von 1