Past

This talk is rescheduled and will take place on 21 January 2025

A zero-one matrix $M$ is said to contain another zero-one matrix $A$ if we can delete some rows and columns of $M$ and replace some 1-entries with 0-entries such that the resulting matrix is $A$. The extremal number of $A$, denoted $\operatorname{ex}(n,A)$, is the maximum number of 1-entries that an $n\times n$ zero-one matrix can have without containing $A$. The systematic study of this function for various patterns $A$ goes back to the work of Furedi and Hajnal from 1992, and the field has many connections to other areas of mathematics and theoretical computer science. The problem has been particularly extensively studied for so-called acyclic matrices, but very little is known about the general case (that is, the case where $A$ is not necessarily acyclic). We prove the first asymptotically tight general result by showing that if $A$ has at most $t$ 1-entries in every row, then $\operatorname{ex}(n,A)\leq n^{2-1/t+o(1)}$. This verifies a conjecture of Methuku and Tomon.

Our result also provides the first tight general bound for the extremal number of vertex-ordered graphs with interval chromatic number two, generalizing a celebrated result of Furedi, and Alon, Krivelevich and Sudakov about the (unordered) extremal number of bipartite graphs with maximum degree $t$ in one of the vertex classes.

Joint work with Barnabas Janzer, Van Magnan and Abhishek Methuku.

A modern perspective on symmetry in quantum theories identifies the topological invariance of a symmetry operator within correlation functions as its defining property. Within this paradigm, a framework has emerged enabling a calculus of topological defects in terms of a higher-dimensional topological quantum field theory. In this seminar, I will discuss aspects of this construction for Euclidean lattice field theories. Exploiting this framework, I will present generalisations of the celebrated Kramers-Wannier duality of the Ising model, as combinations of gauging procedures and generalised Fourier transforms of the local weights encoding the dynamics. If time permits, I will discuss implications of this framework for the real-space renormalisation group flow of these theories.

The "index of hypocoercivity" is defined via a coercivity-type estimate for the self-adjoint/skew-adjoint parts of the generator, and it quantifies `how degenerate' a hypocoercive evolution equation is, both for ODEs and for evolutions equations in a Hilbert space. We show that this index characterizes the polynomial decay of the propagator norm for short time and illustrate these concepts for the Lorentz kinetic equation on a torus. Discrete time analogues of the above systems (obtained via the mid-point rule) are contractive, but typically not strictly contractive. For this setting we introduce "hypocontractivity" and an "index of hypocontractivity" and discuss their close connection to the continuous time evolution equations.

This talk is based on joint work with F. Achleitner, E. Carlen, E. Nigsch, and V. Mehrmann.

References:
1) F. Achleitner, A. Arnold, E. Carlen, The Hypocoercivity Index for the short time behavior of linear time-invariant ODE systems, J. of Differential Equations (2023).
2) A. Arnold, B. Signorello, Optimal non-symmetric Fokker-Planck equation for the convergence to a given equilibrium, Kinetic and Related Models (2022).
3) F. Achleitner, A. Arnold, V. Mehrmann, E. Nigsch, Hypocoercivity in Hilbert spaces, J. of Functional Analysis (2025).
 

Heegner points are a powerful tool for understanding the structure of the group of rational points on elliptic curves. In this talk, I will describe these points and the ideas surrounding their generalisation to other situations.

June Huh proved in 2012 that the Betti numbers of the complement of a complex hyperplane arrangement form a log concave sequence.  But what if the arrangement has symmetries, and we regard the cohomology as a representation of the symmetry group?  The motivating example is the braid arrangement, where the complement is the configuration space of n points in the plane, and the symmetric group acts by permuting the points.  I will present an equivariant log concavity conjecture, and show that one can use representation stability to prove infinitely many cases of this conjecture for configuration spaces.
 

The talk will focus on recent developments regarding the (near-)critical behaviour of certain statistical physics models with long-range dependence in dimensions larger than 2, but smaller than 6, above which mean-field behaviour is known to set in. This “intermediate” regime remains a great challenge for mathematicians. The models revolve around a certain percolation phase transition that brings into play very natural probabilistic objects, such as random walk traces and the Gaussian free field. 

I will discuss recent and ongoing work with Davesh Maulik that explains how Gromov-Witten invariants behave under simple normal crossings degenerations. The main outcome of the study is that if a projective manifold $X$ undergoes a simple normal crossings degeneration, the Gromov-Witten theory of $X$ is determined, via universal formulas, by the Gromov-Witten theory of the strata of the degeneration. Although the proof proceeds via logarithmic geometry, the statement involves only traditional Gromov-Witten cycles. Indeed, one consequence is a folklore conjecture of Abramovich-Wise, that logarithmic Gromov-Witten theory “does not contain new invariants”. I will also discuss applications of this to a conjecture of Levine and Pandharipande, concerning the relationship between Gromov-Witten theory and the cohomology of the moduli space of curves.

In recent years, a new class of deep neural networks has emerged, which finds its roots at model-based iterative algorithms solving inverse problems. We call these model-based neural networks deep unfolding networks (DUNs). The term is coined due to their formulation: the iterations of optimization algorithms are “unfolded” as layers of neural networks, which solve the inverse problem at hand. Ever since their advent, DUNs have been employed for tackling assorted problems, e.g., compressed sensing (CS), denoising, super-resolution, pansharpening. 

In this talk, we will revisit the application of DUNs on the CS problem, which pertains to reconstructing data from incomplete observations. We will present recent trends regarding the broader family of DUNs for CS and dive into their theory, which mainly revolves around their generalization performance; the latter is important, because it informs us about the behaviour of a neural network on examples it has never been trained on before. 
Particularly, we will focus our interest on overparameterized DUNs, which exhibit remarkable performance in terms of reconstruction and generalization error. As supported by our theoretical and empirical findings, the generalization performance of overparameterized DUNs depends on their structural properties. Our analysis sets a solid mathematical ground for developing more stable, robust, and efficient DUNs, boosting their real-world performance.

I will discuss the preprint arXiv:2409.18130 describing an interesting connection between 4d N=2 SCFTs and 2d chiral CFTs (alias: Vertex Operator Algebras) by way of 3d EFTs.

This session is particularly aimed at fourth-year and OMMS students who are completing a dissertation this year. For many of you this will be the first time you have written such an extended piece on mathematics. The talk will include advice on planning a timetable, managing the workload, presenting mathematics, structuring the dissertation and creating a narrative, and avoiding plagiarism.

After recalling how Hecke algebras occur in the representation theory of reductive groups, we will introduce affine Hecke algebras through a combinatorial object called a root datum. Through a worked example we will construct a filtration on the affine Hecke algebra from which we obtain the graded Hecke algebra. This has a role analogous to the Lie algebra of an algebraic group.

We will discuss star operations on these rings, with a view towards the classical problem of studying unitary representations of reductive groups.

We consider a system of interacting particles as a model for a foraging ant colony, where each ant is represented as an active Brownian particle. The interactions among ants are mediated through chemotaxis, aligning their orientations with the upward gradient of a pheromone field. Unlike conventional models, our study introduces a parameter that enables the reproduction of two distinctive behaviours: the conventional Keller-Segel aggregation and the formation of travelling clusters without relying on external constraints such as food sources or nests. We consider the associated mean-field limit of this system and establish the analytical and numerical foundations for understanding these particle behaviours.

The monadic second-order theory S1S of (ℕ,<) is decidable (it essentially describes ω-automata). Undecidability of the monadic theory of (ℝ,<) was proven by Shelah. Previously, Rabin proved decidability if the monadic quantifier is restricted to Fσ-sets.
We discuss decidability for Borel sets, or even σ-combinations of analytic sets. Moreover, the Boolean combinations of Fσ-sets form an elementary substructure. Under determinacy hypotheses, the proof extends to larger classes of sets.

A non-local game involves two non-communicating players who cooperatively play to give winning pairs of answers to questions posed by an external referee. Non-local games provide a convenient framework for exhibiting quantum supremacy in accomplishing certain tasks and have become increasingly useful in quantum information theory, mathematics, computer science, and physics in recent years. Within mathematics, non-local games have deep connections with the field of operator algebras, group theory, graph theory, and combinatorics. In this talk, I will provide an introduction to the theory of non-local games and quantum correlation classes and show their connections to different branches of mathematics. We will discuss how entanglement-assisted strategies for non-local games may be interpreted and studied using tools from operator algebras, group theory, and combinatorics. I will then present a general framework of non-local games involving quantum questions and answers.

In this talk we study the numerical approximation of the jump-diffusion McKean--Vlasov SDEs with super-linearly growing drift, diffusion and jump-coefficient. In the first step, we derive the corresponding interacting particle system and define a Milstein-type approximation for this. Making use of the propagation of chaos result and investigating the error of the Milstein-type scheme we provide convergence results for the scheme. In a second step, we discuss potential simplifications of the numerical approximation scheme for the direct approximation of the jump-diffusion McKean--Vlasov SDE. Lastly, we present the results of our numerical simulations.

Given an elliptic curve over the rationals, a natural problem is to find an explicit point of infinite order over a given number field when there is expected to be one. Geometric constructions are known in only two different settings. That of Heegner points, developed since the 1950s, which yields points over abelian extensions of imaginary quadratic fields. And that of Stark-Heegner points, from the late 1990s: here the points constructed are conjectured to be defined over abelian extensions of real quadratic fields. I will describe a new analytic formula which encompasses both of these, and conjecturally yields points in many other settings. This is joint work with Henri Darmon and Victor Rotger.

AI tools like ChatGPT, Microsoft Copilot, GitHub Copilot, Claude and even older AI-enabled tools like Grammarly and MS Word, are becoming an everyday part of our research environment.  This last-minute opening up of a seminar slot due to the unfortunate illness of our intended speaker (who will hopefully re-schedule for next term) gives us an opportunity to discuss what this means for us as researchers; what are good helpful uses of AI, and are there uses of AI which we might view as inappropriate?  Please come ready to participate with examples of things which you have done yourselves with AI tools.

The Parker conjecture, which explores whether magnetic fields in perfectly conducting plasmas can develop tangential discontinuities during magnetic relaxation, remains an open question in astrophysics. Helicity conservation provides a topological barrier against topologically nontrivial initial data relaxing to a trivial solution. Preserving this mechanism is therefore crucial for numerical simulation.  

This paper presents an energy- and helicity-preserving finite element discretization for the magneto-frictional system for investigating the Parker conjecture. The algorithm enjoys a discrete version of the topological mechanism and a discrete Arnold inequality. 
We will also discuss extensions to domains with nontrivial topology.

This is joint work with Prof Patrick Farrell, Dr Kaibo Hu, and Boris Andrews

The McCullough-Miller space is a contractible simplicial complex that admits an action of the pure symmetric (outer) automorphisms of the free group, with stabilizers that are free abelian. This space has been used to derive several cohomological properties of these groups, such as computing their cohomology ring and proving that they are duality groups. In this talk, we will generalize the construction to right-angled Artin groups (RAAGs), and use it to obtain some interesting cohomological results about the pure symmetric (outer) automorphisms of RAAGs.