Francis Bischoff (University of Toronto)
Morita equivalence and the generalized Kahler potential abstract
Abstract:
I will present a new approach to Generalized Kahler geometry in which a GK structure of symplectic type can be described in terms of a holomorphic symplectic Morita equivalence along with a brane bisection. This solves the problem of identifying the underlying holomorphic degrees of freedom in GK geometry. I will then explain how this new approach can be applied to the problem of describing a GK structure in terms of holomorphic data and a single real-valued function (the generalized Kahler potential) and show how this can be used to explicitly produce new examples of GK metrics. If time permits I will also discuss applications to the deformation of GK metrics. This is based on the paper arXiv:1804.05412 [math.DG], joint with Marco Gualtieri and Maxim Zabzine.
10:00 • Université de Genève, Villa Battelle, 7 route de Drize, 1227 Carouge
Prof. Dr. Sebastian Baader (Universität Bern)
Geometry of Surfaces abstract
Abstract:
The goal of these lectures is to become acquainted with geometric structures on surfaces and the classification of mapping classes. We will put special emphasis on open problems and recent results about pseudo-Anosov diffeomorphisms, in particular the ones with small dilatation. The problem of determining the lowest possible dilatation among all diffeomorphisms of a given surface is closely related to finding the lowest possible spectral radius >1 of an integer matrix of a given size, which in turn is an instance of the famous Lehmer problem. One highlight will be the following result by Lanier and Margalit from this summer: non-trivial representations of the mapping class groups map all low-dilatation diffeomorphisms to non-trivial elements. Moreover, we will present Liechti\'s minor theoretic solution of the dilatation problem for Penner diffeomorphisms. The two primary literature sources will be:
- Travaux de Thurston sur les difféomorphismes des surfaces by Fathi et al.
- A Primer on mapping class groups by Farb and Margalit.
However, we will not refrain from discussing original proofs every now and then, going back as far as 1857 with Kronecker. If you like pictorial proofs, this is the right lecture for you!
10:00 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Ana Peón-Nierto (Université de Genève)
A characterisation of very stability of bundles via the Hitchin map abstract
Abstract:
Let us call two ideal polygons in the hyperbolic plane or the hyperbolic space orthogonal if their respective sides are perpendicular. A generic polygon is perpendicular to two others. This produces a sequence in which consecutive polygons are orthogonal. In this talk I will show that the corresponding dynamics on the spaceof polygons is well-behaved: there is a Poisson bracket preserved by the orthogonality relation, and (almost) n/2 commuting integrals. I will explain relations to Coxeter\'s frieze patterns and discrete holomorphic maps. This is a joint work with Maxim Arnold, Dmitry Fuchs, and Sergei Tabachnikov.
10:20 • Université de Fribourg, Chemin du Musée 23, Lonza (Math II) seminar room
Ioan Manulesco (Université de Fribourg)
Uniform Lipschitz functions on the triangular lattice have logarithmic variations abstract
Abstract:
Uniform integer-valued Lipschitz functions on a finite domain of the triangular lattice are shown to have variations of logarithmic order in the radius of the domain. The level lines of such functions form a loop O(2) model on the edges of the hexagonal lattice with edge-weight one. An infinite-volume Gibbs measure for the loop O(2) model is constructed as a thermodynamic limit and is shown to be unique. It contains only finite loops and has properties indicative of scale-invariance: macroscopic loops appearing at every scale. The existence of the infinite-volume measure carries over to height functions pinned at 0; the uniqueness of the Gibbs measure does not. The proof is based on a representation of the loop O(2) model via a pair of spin configurations that are shown to satisfy the FKG inequality. We prove RSW-type estimates for a certain connectivity notion in the aforementioned spin model. Based on joint work with Alexander Glazman.
11:00 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 1, Room 00.003
Ioan Manolescu (Fribourg)
11:00 • Universität Basel, SR 000.03
Arne Smeets (University of Nijmegen, The Netherlands)
Diophantine problems for Campana\'s orbifold pairs abstract
Abstract:
I will discuss some Diophantine problems involving Campana\'s \'orbifold pairs\', a notion which appeared originally in his approach to classification theory of varieties over the complex numbers.
It turns out that many interesting arithmetic questions can be asked about such pairs as well; I will explain what the natural analogue of Mordell\'s conjecture for such pairs is, both over number fields and function fields, and I will sketch a proof of orbifold Mordell over function fields in positive characteristic. This is joint work with Stefan Kebekus and Jorge Vitorio Pereira.
14:00 • EPF Lausanne, Salle MA A1 12
Joseph Najnudel (University of Bristol)
On the maximum of two log-correlated fields: the logarithms of the characteristic polynomial of the Circular Beta Ensemble and the Riemann zeta function abstract
Abstract:
For different random fields whose correlation is logarithmic with respect to the distance between the points, we observe similar behavior for their extreme values, either proven or conjectured, depending on the model. In this talk, we present two different examples of such fields: the logarithm of the characteristic polynomial of the Circular Beta Ensemble (an ensemble of random unitary matrices generalizing the Circular Unitary Ensemble), and the logarithm of the Riemann zeta function, on a random interval of the critical line.
15:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.1
Stefan Wenger (Université de Fribourg)
Constructing Hölder maps to Carnot groups abstract
Abstract:
Carnot groups equipped with a Carnot metric are subriemannian manifolds. These exhibit interesting (local) geometry that is far from Euclidean. In this talk we mainly focus on the special case of the first Heisenberg group $H$ and study its geometry through Hölder mappings. By a theorem of Züst, which strengthens a result of Gromov and Pansu, every $\\alpha$-Hölder map with $\\alpha>2/3$ from a Euclidean ball to $H$ factors through some tree. We show that Züst\'s result is sharp by constructing topologically non-trivial $\\alpha$-Hölder maps from the Euclidean $2$-ball and $3$-ball to $H$ for every $\\alpha<2/3$. Some of our results generalize to general Carnot groups. Joint work with Robert Young.
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 43
Andreas Bolfing (University of Zurich)
The impact of quantum computers to blockchain based systems and possible countermeasures abstract
Abstract:
Many online applications, especially in the financial industries, are running on blockchain technologies in a decentralized manner, without the use of an authoritative entity or a trusted third party. Such systems run in a permissionless environment, using a decentralized consensus mechanism in order to achieve integrity in purely distributed peer-to-peer systems. The blockchain is a public append-only ledger that forms an eventual consistent system, which relies on cryptographic primitives, such as hash functions and digital signatures. However, these cryptographic primitives are vulnerable in the presence of quantum computers, which makes the whole system potentially unsafe. We give a detailed introduction to decentralized technologies which rely on blockchain based systems, based on the example of Bitcoin, and to its cryptographic parts. We analyze the possible impact if any cryptographic primitive in the protocol is broken. Finally, we give an outline of post-quantum cryptography approaches which should assure the security of the blockchain in the era of quantum computers.
16:00 • UZH Irchel, Winterthurerstrasse 190, Zürich, Building Y27, Room H 12
Prof. Dr. Nilima Nigam (Simon Fraser University )
A modification of Schiffer\'s Conjecture, and a proof via Finite Elements abstract
Abstract:
Approximations via conforming and non-conforming finite elements can be used to construct validated and computable bounds on eigenvalues for the Dirichlet Laplacian in certain domains. If these are to be used as part of a proof, care must be taken to ensure each step of the computation is validated and verifiable. In this talk we present a long-standing conjecture in spectral geometry, and its resolution using validated finite element computations. Schiffer\'s conjecture states that if a bounded domain omega in Rn has any nontrivial Neumann eigenfunction which is a constant on the boundary, then omega must be a ball. This conjecture is open. A modification of Schiffer\'s conjecture is: for regular polygons of at least 5 sides, we can demonstrate the existence of a Neumann eigenfunction which is does not change sign on the boundary. In this talk, we provide a recent proof using finite element calculations forthe regular pentagon. The strategy involves iteratively bounding eigenvalues for a sequence of polygonal subdomains of the triangle with mixed Dirichlet and Neumann boundary conditions. We use a learning algorithm to find and optimize this sequence of subdomains, and use non-conforming linear FEM to compute validated lower bounds for the lowest eigenvalue in each of these domains. The linear algebra is performed within interval arithmetic. This is joint work with Bartlomiej Siudeja and Ben Green, at U. Oregon.
16:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room E 1.2
Timothy Gowers (University of Cambridge)
Why isn’t mathematical research impossible? abstract
Abstract:
It is known that the problem of determining whether a given mathematical statement has a proof is computationally hard, in the sense that there is no algorithm that can do it in general. Even if one restricts attention to proofs of at most a given length, it is widely believed that there is no algorithm that can do it in a reasonable time. And yet human beings somehow manage to find proofs that can be long and complex. I shall argue that this seeming paradox can be resolved without appealing to some mysterious property of human brains that computers could never hope to emulate.
17:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room F 30