The Maze Problem
Abstract
Do there exist universal sequences for all mazes on the two-dimensional integer lattice? We will give background on this question, as well as some recent results. Joint work with Mariaclara Ragosta.
Do there exist universal sequences for all mazes on the two-dimensional integer lattice? We will give background on this question, as well as some recent results. Joint work with Mariaclara Ragosta.
Let X be a smooth rigid-analytic variety. Ardakov and Wadsley introduced the sheaf D-cap of infinite order differential operators on X, along with the category of coadmissible D-cap-modules. In this talk, we present a Riemann–Hilbert correspondence for these coadmissible D-cap-modules. Specifically, we interpret a coadmissible D-cap-module as a p-adic differential equation, explain what it means to solve such an equation, and describe how to reconstruct the module from its solutions.
Einstein’s equations are difficult to solve and if you want to compute something in holography knowing an explicit metric seems to be essential. Or is it? For some theories, observables, such as on-shell actions and free energies, are determined solely in terms of topological data, and an explicit metric is not needed. One of the key tools that has recently been used for this programme is equivariant localization, which gives a method of computing integrals on spaces with a symmetry. In this talk I will give a pedestrian introduction to equivariant localization before showing how it can be used to compute the on-shell action of 6d Romans Gauged supergravity.
Many applications in machine learning involve data represented as probability distributions. The emergence of such data requires radically novel techniques to design tractable gradient flows on probability distributions over this type of (infinitedimensional) objects. For instance, being able to flow labeled datasets is a core task for applications ranging from domain adaptation to transfer learning or dataset distillation. In this setting, we propose to represent each class by the associated conditional distribution of features, and to model the dataset as a mixture distribution supported on these classes (which are themselves probability distributions), meaning that labeled datasets can be seen as probability distributions over probability distributions. We endow this space with a metric structure from optimal transport, namely the Wasserstein over Wasserstein (WoW) distance, derive a differential structure on this space, and define WoW gradient flows. The latter enables to design dynamics over this space that decrease a given objective functional. We apply our framework to transfer learning and dataset distillation tasks, leveraging our gradient flow construction as well as novel tractable functionals that take the form of Maximum Mean Discrepancies with Sliced-Wasserstein based kernels between probability distributions.
Six-functor formalisms are ubiquitous in mathematics, and I will start this talk by giving a quick introduction to them. A three-functor formalism is, as the name suggests, (the better) half of a six-functor formalism. I will discuss what it means for such a three-functor formalism to be unitary, and why commutative Von Neumann algebras (and hence, by the Gelfand-Naimark theorem, measure spaces) admit a unitary three-functor formalism that can be viewed as mixing sheaf theory with functional analysis. Based on joint work with André Henriques.
We present a kinetic version of the optimal transport problem for probability measures on phase space. The central object is a second-order discrepancy between probability measures, analogous to the 2-Wasserstein distance, but based on the minimisation of the squared acceleration. We discuss the equivalence of static and dynamical formulations and characterise absolutely continuous curves of measures in terms of reparametrised solutions to the Vlasov continuity equation. This is based on joint work with Giovanni Brigati (ISTA) and Filippo Quattrocchi (ISTA).
Petros will present recent advances of developing ML algorithms for applications in computational and experimental fluid dynamics. A particular point of this talk is that classical control and optimisation techniques can outperform machine learning algorithms. He will share lessons learned and suggest future directions.
Bio: Petros Koumoutsakos is Herbert S. Winokur, Jr. Professor of Computing in Science and Engineering at Harvard University. He has served as the Chair of Computational Science at ETHZ Zurich (1997-2020) and has held visiting fellow positions at Caltech, the University of Tokyo, MIT and TU Berlin. Petros is elected Fellow of the American Society of Mechanical Engineers (ASME), the American Physical Society (APS), the Society of Industrial and Applied Mathematics (SIAM). He is recipient of the Advanced Investigator Award by the European Research Council and the ACM Gordon Bell prize in Supercomputing. He is elected International Member to the US National Academy of Engineering (NAE). His research interests are on the fundamentals and applications of computing and artificial intelligence to understand, predict and optimize fluid flows in engineering, nanotechnology, and medicine.
Abstract: This talk introduces the ZX-calculus, a powerful graphical language for reasoning about quantum computations. I will start with an overview of process theories, a general framework for describing how processes act upon different types of information. I then focus on the process theory of quantum circuits, where each function (or gate) is a unitary linear transformation acting upon qubits. The ZX-calculus simplifies the set of available gates in terms of two atomic operations: Z and X spiders, which generalize rotations around the Z and X axes of the Bloch sphere. I demonstrate how to translate quantum circuits into ZX-diagrams and how to simplify ZX diagrams using a set of seven equivalences. Through examples and illustrations, I hope to convey that the ZX-calculus provides an intuitive and powerful tool for reasoning about quantum computations, allowing for the derivation of equivalences between circuits. By the end of the talk listeners should be able to understand equations written in the ZX-calculus and potentially use them in their own work.
An arrangement of hypersurfaces in projective space is strict normal crossing if and only if its Euler discriminant is nonzero. We study the critical loci of all Laurent monomials in the equations of the smooth hypersurfaces. These loci form an irreducible variety in the product of two projective spaces, known in algebraic statistics as the likelihood correspondence and in particle physics as the scattering correspondence. We establish an explicit determinantal representation for the bihomogeneous prime ideal of this variety.
Joint work with T. Kahle, B. Sturmfels, M. Wiesmann
Due to a family emergency, the speaker unfortunately had to cancel this talk.
Since their introduction in 2017, Transformers have revolutionized large language models and the broader field of deep learning. Central to this success is the ground-breaking self-attention mechanism. In this presentation, I’ll introduce a mathematical framework that casts this mechanism as a mean-field interacting particle system, revealing a desirable long-time clustering behaviour. This perspective leads to a trove of fascinating questions with unexpected connections to Kuramoto oscillators, sphere packing, Wasserstein gradient flows, and slow dynamics.
Bio: Philippe Rigollet is a Distinguished Professor of Mathematics at MIT, where he serves as Chair of the Applied Math Committee and Director of the Statistics and Data Science Center. His research spans multiple dimensions of mathematical data science, including statistics, machine learning, and optimization, with recent emphasis on optimal transport and its applications. See https://math.mit.edu/~rigollet/ for more information.
This talk is hosted by the AI Reading Group
We investigate pattern formation for a 2D PDE-ODE bulk-cell model, where one or more bulk diffusing species are coupled to nonlinear intracellular
reactions that are confined within a disjoint collection of small compartments. The bulk species are coupled to the spatially segregated
intracellular reactions through Robin conditions across the cell boundaries. For this compartmental-reaction diffusion system, we show that
symmetry-breaking bifurcations leading to stable asymmetric steady-state patterns, as regulated by a membrane binding rate ratio, occur even when
two bulk species have equal bulk diffusivities. This result is in distinct contrast to the usual, and often biologically unrealistic, large
differential diffusivity ratio requirement for Turing pattern formation from a spatially uniform state. Secondly, for the case of one-bulk
diffusing species in R^2, we derive a new memory-dependent ODE integro-differential system that characterizes how intracellular
oscillations in the collection of cells are coupled through the PDE bulk-diffusion field. By using a fast numerical approach relying on the
``sum-of-exponentials'' method to derive a time-marching scheme for this nonlocal system, diffusion induced synchrony is examined for various
spatial arrangements of cells using the Kuramoto order parameter. This theoretical modeling framework, relevant when spatially localized nonlinear
oscillators are coupled through a PDE diffusion field, is distinct from the traditional Kuramoto paradigm for studying oscillator synchronization on
networks or graphs. (Joint work with Merlin Pelz, UBC and UMinnesota).
An explicit first-order drift-randomized Milstein scheme for a regime switching stochastic differential equation is proposed and its bi-stability and rate of strong convergence are investigated for a non-differentiable drift coefficient. Precisely, drift is Lipschitz continuous while diffusion along with its derivative is Lipschitz continuous. Further, we explore the significance of evaluating Brownian trajectories at every switching time of the underlying Markov chain in achieving the convergence rate 1 of the proposed scheme. In this context, possible variants of the scheme, namely modified randomized and reduced randomized schemes, are considered and their convergence rates are shown to be 1/2. Numerical experiments are performed to illustrate the convergence rates of these schemes along with their corresponding non-randomized versions. Further, it is illustrated that the half-order non-randomized reduced and modified schemes outperform the classical Euler scheme.
The BSD conjecture predicts that a rational elliptic curve $E$ has infinitely many points if and only if its $L$-function vanishes at $s=1$.
There are $p$-adic versions of similar phenomena. If $E$ is $p$-ordinary, there is, for example, a $p$-adic analytic analogue $L_p(E,s)$ of the $L$-function, and if $E$ has good reduction, then it has infinitely many rational points iff $L_p(E,1) = 0$. However if $E$ has split multiplicative reduction at $p$ - that is, if $E/\mathbf{Q}_p$ admits a Tate uniformisation $\mathbf{C}_p^{\times}/q^{\mathbf{Z}}$ - then $L_p(E,1) = 0$ for trivial reasons, regardless of $L(E,1)$; it has an 'exceptional zero'. Mazur--Tate--Teitelbaum's exceptional zero conjecture, proved by Greenberg--Stevens in '93, states that in this case the first derivative $L_p'(E,1)$ is much more interesting: it satisfies $L_p'(E,1) = \mathrm{log}(q)/\mathrm{ord}(q) \times L(E,1)/(\mathrm{period})$. In particular, it should vanish iff $L(E,1) = 0$ iff $E(\mathbf{Q})$ is infinite; and even better, it has a beautiful and surprising connection to the Tate period $q$, via the 'L-invariant' $\mathrm{log}(q)/\mathrm{ord}(q)$.
In this talk I will discuss exceptional zero phenomena and L-invariants, and a generalisation of the exceptional zero conjecture to automorphic representations of GL(3). This is joint work in progress with Daniel Barrera and Andrew Graham.
We propose and analyse two structure preserving finite volume schemes to approximate the solutions to a cross-diffusion system with self-consistent electric interactions introduced by Burger, Schlake & Wolfram (2012). This system has been derived thanks to probabilistic arguments and admits a thermodynamically motivated Lyapunov functional that is preserved by suitable two-point flux finite volume approximations. This allows to carry out the mathematical analysis of two schemes to be compared.
This is joint work with Maxime Herda and Annamaria Massimini.
The goal of the talk is to give an overview of the metric theory of currents by Ambrosio-Kirchheim, together with some recent progress in the setting of Banach spaces. Metric currents are a generalization to the metric setting of classical currents. Classical currents are the natural generalization of oriented submanifolds, as distributions play the same role for functions. We present a structure result for 1-metric currents as superposition of 1-rectifiable sets in Banach spaces, which generalizes a previous result by Schioppa. This is based on an approximation result of metric 1-currents with normal 1-currents. This is joint work with D. Bate, J. Takáč, P. Valentine, and P. Wald (Warwick).
High-order tensor methods for solving both convex and nonconvex optimization problems have recently generated significant research interest, due in part to the natural way in which higher derivatives can be incorporated into adaptive regularization frameworks, leading to algorithms with optimal global rates of convergence and local rates that are faster than Newton's method. On each iteration, to find the next solution approximation, these methods require the unconstrained local minimization of a (potentially nonconvex) multivariate polynomial of degree higher than two, constructed using third-order (or higher) derivative information, and regularized by an appropriate power of the change in the iterates. Developing efficient techniques for the solution of such subproblems is currently, an ongoing topic of research, and this talk addresses this question for the case of the third-order tensor subproblem. In particular, we propose the CQR algorithmic framework, for minimizing a nonconvex Cubic multivariate polynomial with Quartic Regularisation, by sequentially minimizing a sequence of local quadratic models that also incorporate both simple cubic and quartic terms.
The role of the cubic term is to crudely approximate local tensor information, while the quartic one provides model regularization and controls progress. We provide necessary and sufficient optimality conditions that fully characterise the global minimizers of these cubic-quartic models. We then turn these conditions into secular equations that can be solved using nonlinear eigenvalue techniques. We show, using our optimality characterisations, that a CQR algorithmic variant has the optimal-order evaluation complexity of $O(\epsilon^{-3/2})$ when applied to minimizing our quartically-regularised cubic subproblem, which can be further improved in special cases. We propose practical CQR variants that judiciously use local tensor information to construct the local cubic-quartic models. We test these variants numerically and observe them to be competitive with ARC and other subproblem solvers on typical instances and even superior on ill-conditioned subproblems with special structure.
Short Bio
Anna Juel is a physicist whose research explores the complex dynamics of material systems, particularly in two-phase flows and wetting phenomena. Her group focuses on microfluidics, fluid-structure interactions, and complex fluid flows, with applications ranging from chocolate moulding to airway reopening and flexible displays. Based at the Manchester Centre for Nonlinear Dynamics, her experimental work often uncovers surprising behaviour, driving new insights through combined experimentation and modelling.
The absolute Galois group of ℚₚ determines its field structure: a field K is p-adically closed if and only if its absolute Galois group is isomorphic to that of ℚₚ. This Galois-theoretic characterisation was proved by Koenigsmann in 1995, building on previous work by Arason, Elman, Jacob, Ware, and Pop. Similar results were obtained by Efrat and further developed in his 2006 book.
Our project aims to provide an optimal proof of this characterisation, incorporating improvements and new developments. These include a revised proof strategy; Efrat's construction of valuations via multiplicative stratification; the Galois characterisation of henselianity; systematic use of the standard decomposition; and the function field analogy of Krasner-Kazhdan-Deligne type. Moreover, we replace arguments that use Galois cohomology with elementary ones.
In this talk, I will focus on two key components of the proof: the construction of valuations from rigid elements, and the role of the function field analogy as developed via the non-standard methods of Jahnke-Kartas.
This is joint work with Jochen Koenigsmann and Benedikt Stock.