Mikhail Hlushchanka (University of Amsterdam)
The independence polynomial on recursive graph sequences - the dynamical perspective abstract
Abstract:
The distribution of the zeros of partition functions on graphs are intimately related to the analyticity of physical quantities and their phase transitions. In their pioneering work in the 1950s, Lee and Yang proved that the free energy per site of the cubic lattice is analytic at a given positive real parameter, provided that the complex zeros of the partition functions for a sequence of finite graphs converging to the lattice avoid a neighborhood of this parameter. In the last decade, a special focus was put on graph sequences that do not converge to a regular lattice but are instead defined recursively. Examples of such recursive graph sequences include hierarchical lattices, Cayley trees, Sierpiński gasket graphs, and various self-similar Schreier graphs. Significant progress has been made in studying the partition functions of the Ising, Potts, and Hard-Core models on these graphs (with the latter two corresponding to the chromatic and independence graph polynomials, respectively). One main advantage of working with recursive sequences of graphs is that the underlying recursion naturally induces an iterative system on the level of partition functions, often given in terms of rational maps in one or several (complex) variables. By analyzing the dynamical behavior of these iterative systems, we can gain insights into the properties of the respective graph polynomials, such as phase transitions and computational complexity.In our current work with Han Peters (University of Amsterdam), we attempt to establish a unified framework for recursive graph sequences in the Hard-Core model setting. We start with an arbitrary graph with k marked vertices. At each recursive step, we construct a new graph by taking n copies of the previous graph and connecting these copies along the marked vertices (according to a specified rule). The dynamical systems that emerge from the respective independence polynomials are represented by homogeneous polynomials of degree n in 2^k variables. Somewhat surprisingly, it turns out that these systems can be successfully analyzed in this general context. In the talk, I will report on our results on the structure of the zero sets of the independence polynomials for these recursive graph sequences, particularly highlighting the absence of phase transitions.
10:30 • Université de Genève, Conseil Général 7-9, Room 1-05
Aline Zanardini (EPFL)
Abstract:
In this talk, we will consider the problem of classifying linear systems of hypersurfaces inside projective space and up to projective equivalence. I will report on a possible approach to solving this problem via geometric invariant theory, and I will further illustrate how such an approach can be applied to some relevant geometric examples. This is based on joint work with Masafumi Hattori.
10:30 • Universität Basel, Seminarraum 00.003, Spiegelgasse 1
Euan Spence (University of Bath)
New theory for two-level domain-decomposition preconditioners for the high-frequency Helmholtz equation abstract
Abstract:
When solving self-adjoint positive-definite problems (such as Laplace’s equation) with domain-decomposition methods, coarse spaces provide global transfer of information, and are the key to parallel scalability. However, the design of practical coarse spaces for high-frequency wave problems, such as the high-frequency Helmholtz equation, is much more difficult than in the self-adjoint positive-definite case. In the last year, there have been several papers providing theory for specific coarse-spaces consisting of (pre-computed) problem-adapted basis functions. This talk will present:1) a general theory that applies to all these previously-analysed coarse spaces, and2) new results about piecewise-polynomial coarse spaces.This is joint work with Jeffrey Galkowski (University College London) and Ivan Graham (University of Bath).
14:00 • Université de Genève, Conseil Général 7-9, Room 1-05
Eva Bayer-Fluckiger
Automorphisms of K3 surfaces and cyclotomic polynomials abstract
Abstract:
Let X be a complex projective K3 surface and let TX be its transcendental lattice. The characteristic polynomials of the isomorphisms of TX induced by automorphisms of X are powers of cyclotomic polynomials. Which powers of cyclotomic polynomials occur? The aim of this talk is to answer this question, as well as related ones.
14:00 • EPF Lausanne, Bernoulli Center
Rob Corless (University of Ontario)
Structured Backward Error for the WKB method abstract
Abstract:
The classical WKB method (also known as the WKBJ method, the LG method, or the phase integral method) for solving singularly perturbed linear differential equations has never, as far as we know, been looked at from the structured backward error (BEA) point of view. This is somewhat surprising, because a simple computation shows that for some important problems, the WKB method gives the exact solution of a problem of the same structure that can be expressed in finitely many terms. This kind of analysis can be extremely useful in assessing the validity of a solution provided by the WKB method. In this paper we show how to do this and explore some of the consequences, which include a new iterative algorithm to improve the quality of the WKB solution. We also explore a new hybrid method where the potential is approximated by Chebyshev polynomials, which can be implemented in a few lines of Chebfun.This is joint work with Nic Fillion, Simon Fraser University
15:00 • Université de Genève, Conseil Général 7-9, Room 1-05
Marco Gualtieri (Toronto)
Groupoids, generalized Kahler structures, and (2,2) supersymmetry abstract
Abstract:
It has recently become clear that the 2d supersymmetric sigma model has a hidden higher groupoid structure, which generalizes the appearance of the classifying stack BG in Chern-Simons theory. I will describe our recent work on this subject in https://arxiv.org/abs/2407.00831 and outline how the higher groupoids govern the behaviour of generalized Kahler metrics.
15:00 • Université de Genève, Conseil Général 7-9, Room 1-07
Barbara Betti (MPI MiS Leipzig)
What is... a Khovanskii basis? abstract
Abstract:
Gröbner bases are one of the main tools in computer algebra to solve many theoretical problems. For instance, they provide algorithms to solve the ideal membership problem, to perform elimination of variables and to solve zero-dimensional polynomial systems. In this talk, we will recall some basics notions about Gröbner bases and introduce the analogous but less known Khovanskii (or Sagbi) bases. These are particularly well-behaved sets of algebra generators that allow similar algorithms on subalgebras of the polynomial ring. Unlike Gröbner bases, Khovanskii bases are not always finite. We will discuss examples and introduce applications of Khovanskii bases to solve structured equations on projective varieties (based on joint work with M.Panizzut and S. Telen).
15:45 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room G 19.2
Feliks Nüske
Learning Metastable Dynamics: Application to Molecular Dynamics abstract
Abstract:
Metastablility is a phenomenon which often inhibits the efficient simulation of dynamical systems, or the generation of samples from high-dimensional probability measures. In particular, it is frequently encountered in computer simulations of biological macromolecules using molecular dynamics. It is well-known that metastable transitions and their time scales are encoded in the dominant spectrum of certain transition operators, also called Koopman operators. The study of Koopman operators, and their data-driven approximation by algorithms like the Extended Dynamic Mode Decomposition (EDMD), have gained significant traction in recent years.In this talk, I will report on recent progress concerning the data-driven analysis of metastable systems using Koopman operators. First, I will introduce approximation methods based on reproducing kernel Hilbert spaces (RKHS), which allow the use of rich approximation spaces, and explain how the resulting large-scale linear problems can be solved efficiently using random Fourier features (RFF). Second, I will explain how similar ideas can be applied to learn models for the infinitesimal generator, which allows for a more detailed system analysis, including interpolation across statistical ensembles, or the definition of reduced (coarse grained) models.
16:15 • EPF Lausanne, CM 1 517
Ilya Molchanov (University of Bern)
The semigroup of metric measure spaces and its infinitely divisible measure abstract
Abstract:
The family of metric measure spaces can be endowed with the semigroup operation being the Cartesian product. The aim of this talk is to arrive at the generalisation of the fundamental theorem of arithmetics for metric measure spaces that provides a unique decomposition of a general space into prime factors. These results are complementary to several partial results available for metric spaces (like de Rham\'s theorem on decomposition of manifolds). Finally, the infinitely divisible and stable laws on the semigroup of metric measure spaces are characterised (joint work with S.N. Evans (Berkeley)
17:15 • Université de Fribourg, room Phys 2.52