Archiv des Frankfurter Seminars

Veranstaltungen im WiSe 2018/ 2019








24. Oktober 2018

Valentin Blomer (Universität Göttingen)

Eigenfunctions on arithmetic manifolds

It is a classical problem in analysis to study Laplace eigenfunctions on Riemannian manifolds. Number theory enters the scene if the manifold has additional arithmetic structure, such as a family of Hecke operators. In this talk, I will present methods from number theory, Lie groups and automorphic forms to obtain information on the mass distribution of joint eigenfunctions on various arithmetic spaces, and discuss some applications.








12. Dezember 2018

Sandra Di Rocco (KTH Stockholm)

Discriminants: an interplay between algebra, combinatorics and geometry

The term “discriminant” is well known in relation with low degree univariate equations or ordinary differential equations and it has a well defined geometrical meaning naturally connected to the way our vision grasps geometrical shapes. The discriminant of polynomials with specified shape (when it exists) is an (irreducible) polynomial, whose variables are in coefficients of the assigned shape, vanishing when the corresponding polynomial has multiple roots. Finding the discriminant or at least estimating its degree is a classical, well explored problem in mathematics which still faces many challenges.

Besides its importance in computational mathematics, the discriminant locus carries deep and interesting geometrical and combinatorial insights and is one example of fruitful interplay between classical projective algebraic geometry and convex real geometry.

This interplay will be the main theme of the talk. Besides the classical theory of discriminants, natural generalisations associated to systems of polynomial equations will be presented.








19. Dezember 2018

Jon Keating (Universität Bristol)

Characteristic Polynomials of Random Unitary Matrices, Partition Sums, and Painlevé V

The moments of characteristic polynomials play a central role in Random Matrix Theory. They appear in many applications, ranging from quantum mechanics to number theory. The mixed moments of the characteristic polynomials of random unitary matrices, i.e. the joint moments of the polynomials and their derivatives, can be expressed recursively in terms of combinatorial sums involving partitions. However, these combinatorial sums are not easy to compute, and so this does not give an effective method for calculating the mixed moments in general. I shall describe an alternative evaluation of the mixed moments, in terms of solutions of the Painlevé V differential equation, that facilitates their computation and asymptotic analysis.









30. Januar 2019

Silvia Sabatini (Universität Köln)

12, 24 and beyond: a bridge from reflexive polytopes to symplectic geometry

Mathematics finds itself divided and subdivided into hyper-specialized areas of study, each of them with its own internal beauty.  However, what I find most fascinating is when one can build a bridge between two of these seemingly isolated theories. For instance, (symplectic) geometry and combinatorics have a very strong connection, due to the existence of some special manifolds admitting a torus symmetry. The latter is encoded in a map, called moment map, which "transforms" the manifold into a convex polytope. Hence many combinatorial properties of (some special types of) polytopes can be studied using symplectic techniques.
In this talk I will focus on the class of reflexive polytopes, which was introduced by Batyrev in the context of mirror symmetry, and explain how the "12" and "24" phenomenon for reflexive polytopes of dimensions 2 and 3 can be generalized to higher dimensions using symplectic geometry.


Veranstaltungen im SoSe 2018








11. April 2018

Bernd Sturmfels (MPI-MIS Leipzig)

Learning Algebraic Varieties from Samples

This lecture discusses the role of algebraic geometry in data science. We report on recent work with Paul Breiding, Sara Kalisnik and Madeline Weinstein. We seek to determine a real algebraic variety from a fixed finite subset of points. Existing methods arestudied and new methods are developed. Our focus lies on topological and algebraic features, such as dimension and defining polynomials. All algorithms are tested on a range of datasets and made available in a Julia package.









02. Mai 2018

Frank den Hollander (Universität Leiden)

Exploration on dynamic networks

Search algorithms on networks are important tools for the organisation of large data sets. A key example is Google PageRank. Real-world networks are modelled as random graphs and search algorithms as random walks. The mixing time of the algorithm is the time it takes the random walk to approach its equilibrium distribution.

Many real-world networks are dynamic in nature. In this talk we focus on a random graph with prescribed degrees and investigate what happens to the mixing time of the random walk when at each unit of time a certain fraction of the edges is randomly rewired. We identify three regimes in the limit as the graph becomes large, and show that these exhibit surprising behaviour.









09. Mai 2018

Pierre-Emmanuel Caprace (UC Louvrain)

A taste of simple groups

The goal of this talk is to have a tour in the fascinating and eclectic universe of simple groups. A special emphasis will be put on simple locally compact groups, and their use in the study of discrete groups.









04. Juli 2018

Nigel Hitchin (University of Oxford)

The geometry of surfaces — a new look

The talk will discuss compact surfaces of negative curvature from the point of view of the space of geodesics on the universal covering. The motivation comes from an attempt to describe an infinite dimensional version of Teichmüller space.


Veranstaltungen WiSe 2017/ 2018








15. November 2017

Hendrik Lenstra (Universität Leiden)

Solving equations in orders

An order is a commutative ring of which the additive group is, for some non-negative integer n, the group of vectors with n integral coordinates. The lecture is devoted to the algorithmic problem of solving polynomial equations in one variable in orders.









13. Dezember 2017

Camillo de Lellis (Universität Zürich)

The Onsager's Theorem and beyond

In 1949 the famous physicist Lars Onsager made the striking statement that there are continuous solutions of the incompressible Euler equations that do not preserve the kinetic energy. Such statement has been rigorously proved only very recently and in this lecture we will explore some of the related ideas.








24. Januar 2018

Barbara Wohlmuth (Technische Universität München)

A priori and a posteriori modifications in finite element flow simulations

We discuss two types of local and computationally inexpensive modifications resulting in finite element approximations of higher accuracy. In case one, a local recovery of the discrete flux is performed such that mass conservation on a dual mesh can be guaranteed. The corrected flux enters then into the advective part of the energy equation. In case two, the flowability in the discrete scheme is locally enhanced such that energy can be preserved. A variational crime analysis then guarantees improved convergence rates.All theoretical results are illustrated by a series of simulations including large scale runs where a all-in-once multigrid solver is used for the flow part.









31. Januar 2018

Günter Ziegler (Freie Universität Berlin)

Semi-algebraic sets of integer points

We look at sets of integer points in the plane, and discuss possible definitions of when such a set is “complicated” — this might be the case if it is not the set of integer solutions to some system of polynomial equations and inequalities. Let ’s together work out lots of examples, and on the way let’s try to develop criteria and proof techniques …
The examples that motivated our study come from polytope theory: Many question of the type “What is the possible pairs of (number of vertices, number of facets) for 4-dimensional polytopes? ” have been asked, many of them with simple and complete answers, but in other cases the answer looks complicated. Our main result says: In some cases it IS complicated! (Joint work with Hannah Sjöberg.)