Giuliano Basso (Université de Fribourg)
Spaces with convex bicombings abstract
Abstract:
A bicombing on a metric space distinguishes for every pair of points a geodesic connecting them. A deep result of Descombes and Lang states that every Gromov hyperbolic group acts geometrically on a proper, finite dimensional metric space with a unique bicombing satisfying a strong convexity condition. This convexity condition may be regarded as a weak global notion of non-positive curvature in metric spaces with not necessarily unique geodesics. In this talk, I will give a survey of recent results on the geometry of metric spaces with such bicombings. I will discuss existence and uniqueness results for bicombings satisfying various convexity conditions. Moreover, I will outline how classical results from the theory of CAT(0) spaces may be transferred to this broader setting of non-positive curvature.
10:20 • Université de Fribourg, Chemin du Musée 23, Lecture room 2.52 Physics
Klaus Widmayer (EPF Lausanne)
Abstract:
A point charge is a particularly basic and important equilibrium of the Vlasov-Poisson equations, and the study of its stability has inspired several major contributions. In this talk we present some recent work, which brings a fresh perspective on this problem. Our new approach combines a Lagrangian analysis of the linearized problem with an Eulerian PDE framework in the nonlinear analysis, all the while respecting the symplectic structure. As a result, for the case of radial initial data, we see that solutions are global and in fact disperse to infinity via a modified scattering along trajectories of the linearized flow. This is joint work with Benoit Pausader (Brown University).
14:15 • Universität Basel, Zoom Seminar
Tim Bülles (ETH Zürich)
Symmetries of stable pair invariants via derived equivalences - the STU model abstract
Abstract:
Curve counting on Calabi-Yau threefolds X via Pandharipande-Thomas stable pair invariants is much constrained by derived equivalences of X. These constraints are reflected by BPS counts in string theory compactified on X. An important example for physicists is the STU model, which admits remarkable BPS symmetries. I will discuss these symmetries via stable pairs and connect to derived equivalences given by Seidel-Thomas spherical twists.
15:00 • Zoom
Dimitri Wyss (EPF Lausanne)
Geometric applications of p-adic integration abstract
Abstract:
In the first part I will introduce the theory of p-adic integration and outline the proof of Batyrev\'s theorem, stating that smooth proper birational Calabi-Yau varieties have the same Betti-numbers.
In the second part I talk about my joint work with Michael Groechenig and Paul Ziegler, where we apply the theory to moduli spaces of Higgs bundles with various consequences. Finally I sketch some recent ideas on how to use p-adic (or motivic) integration in connection with compactified Jacobians, Hilbert schemes and DT-invariants.
15:15 • EPF Lausanne, MED 2 1522
Merlin Incerti-Medici (ETH Zurich, Switzerland)
Circumcenter extensions on Hadamard manifolds abstract
Abstract:
Given a geodesically complete CAT(-1) space, we can associate to it a boundary at infinity which can be equipped with a cross ratio. It is well known that the boundary, together with the cross ratio contains a lot of information about the geometry of the interior space. One way to make this relationship explicit uses a construction called the circumcenter extension. It turns out that the circumcenter extension can be defined for a large class of Hadamard manifolds that have flat regions and still provide interesting results. In this talk, we will survey known results, explain the construction of the circumcenter extension, and show that the boundary roughly determines the interior space for a large class of manifolds.
16:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.1
Fritz Eisenbrand (EPF Lausanne)
Strengthening convex relaxations of 0/1 sets using boolean formulas (Fiorini, Huynh & Weltge Math. Programming 2020) abstract
Abstract:
In this talk, I will speak about the above paper that is not co-authored by me. It features a very interesting and simple procedure to strengthen the relaxation of 0/1 integer programming problems from a boolean formula that defines the valid 0/1 points. In particular, this strengthens and simplifies an approach of Bienstock and Zuckerberg that was a breakthrough during the time that I got my PhD. This result showed that the Chvatal-Gomory closure of covering problems could be approximated in a PTAS fashion. If time permits, I will also mention some connection to work of Mika Göös.
16:15 • EPF Lausanne, Salle CO1
Prof. Dr. Jelani Nelson (University of California at Berkeley, USA)
Optimal bounds for approximate counting abstract
Abstract:
Counting up to N deterministically of course takes Theta(log N) bits. In the first ever streaming algorithm, Morris in 1978 gave a randomized algorithm that improved upon this bound exponentially. The best known analysis of his algorithm shows that it gives a 1+eps approximation to N with probability at least 1-delta using O(loglog N + log(1/eps) + log(1/delta)) bits with high probability (the space usage is itself a random variable). We show that a very slight (but necessary) tweak of his algorithm actually achieves the better bound O(loglog N + log(1/eps) + loglog(1/delta)) bits, and we also show a new matching lower bound, establishing optimality. Joint work with Huacheng Yu.