Past

The quantum unipotent coordinate ring has a cluster algebra structure. On the other hand, this ring is isomorphic to the Grothendieck ring of the module category of quiver Hecke algebras (QHA). We can prove that cluster monomials of the quantum unipotent coordinate ring correspondi to real simple modules. This is a joint work with Seok-Jin Kang, Myungho Kim and Se-jin Oh.

Numerical simulations indicate that deep artificial neural networks (DNNs) seem to be able to overcome the curse of dimensionality in many computational  problems in the sense that the number of real parameters used to describe the DNN grows at most polynomially in both the reciprocal of the prescribed approximation accuracy and the dimension of the function which the DNN aims to approximate. However, there are only a few special situations where results in the literature can rigorously explain the success of DNNs when approximating high-dimensional functions.

In this talk it is revealed that DNNs do indeed overcome the curse of dimensionality in the numerical approximation of Kolmogorov PDEs with constant diffusion and nonlinear drift coefficients. A crucial ingredient in our proof of this result is the fact that the artificial neural network used to approximate the PDE solution really is a deep artificial neural network with a large number of hidden layers.

For $G$ connected, reductive algebraic group defined over $\mathbb{C}$ the Springer Correspondence gives a bijection between the irreducible representations of the Weyl group $W$ of $G$ and certain pairs comprising a $G$-orbit on the nilpotent cone of the Lie algebra of $G$ and an irreducible local system attached to that $G$-orbit. These irreducible representations can be concretely realised as a W-action on the top degree homology of the fibres of the Springer resolution. These Springer fibres are geometrically very rich and provide interesting Weyl group combinatorics: for instance, the irreducible components of these Springer fibres form a basis for the corresponding irreducible representation of $W$. In this talk, I'll give a general survey of the Springer Correspondence and then discuss recent joint projects with Daniele Rosso, Vinoth Nandakumar and Arik Wilbert on Kato's Exotic Springer correspondence.

Graph sampling with noise is a fundamental problem in graph signal processing (GSP). A popular biased scheme using graph Laplacian regularization (GLR) solves a system of linear equations for its reconstruction. Assuming this GLR-based reconstruction scheme, we propose a fast sampling strategy to maximize the numerical stability of the linear system--i.e., minimize the condition number of the coefficient matrix. Specifically, we maximize the eigenvalue lower bounds of the matrix that are left-ends of Gershgorin discs of the coefficient matrix, without eigen-decomposition. We propose an iterative algorithm to traverse the graph nodes via Breadth First Search (BFS) and align the left-ends of all corresponding Gershgorin discs at lower-bound threshold T using two basic operations: disc shifting and scaling. We then perform binary search to maximize T given a sample budget K. Experiments on real graph data show that the proposed algorithm can effectively promote large eigenvalue lower bounds, and the reconstruction MSE is the same or smaller than existing sampling methods for different budget K at much lower complexity.

Integrable models provide simplified examples of quantum field theories with self-interaction. As often in relativistic quantum theory, their local observables are difficult to control mathematically. One either tries to construct pointlike local quantum fields, leading to possibly divergent series expansions, or one defines the local observables indirectly via wedge-local quantities, losing control over their explicit form.

We propose a new, hybrid approach: We aim to describe local quantum fields; but rather than exhibiting their n-point functions and verifying the Wightman axioms, we establish them as closed operators affiliated with a net of von Neumann algebras. This is shown to work at least in the Ising model.

George Soules [1] introduced a set of vectors $r_1,...,r_N$ with the remarkable property that for any set of ordered numbers $\lambda_1\geq\dots\geq\lambda_N$, the matrix $\sum_n \lambda_nr_nr_n^T$ has nonnegative off-diagonal entries. Later, it was found [2] that there exists a whole class of such vectors - Soules vectors - which are intimately connected to binary rooted trees. In this talk I will describe the construction of Soules vectors starting from a binary rooted tree, and introduce some basic properties. I will also cover a number of applications: the inverse eigenvalue problem, equitable partitions in Laplacian matrices and the eigendecomposition of the Clauset-Moore-Newman hierarchical random graph model.

[1] Soules (1983), Constructing Symmetric Nonnegative Matrices
[2] Elsner, Nabben and Neumann (1998), Orthogonal bases that lead to symmetric nonnegative matrices

In joint work with Peter Topping we introduce pyramid Ricci flows, defined throughout uniform regions of spacetime that are not simply parabolic cylinders, and enjoying curvature estimates that are not required to remain spatially constant throughout the domain of definition. This weakened notion of Ricci flow may be run in situations ill-suited to the classical theory. As an application of pyramid Ricci flows, we obtain global regularity results for three-dimensional Ricci limit spaces (extending results of Miles Simon and Peter Topping) and for higher dimensional PIC1 limit spaces (extending not only the results of Richard Bamler, Esther Cabezas-Rivas and Burkhard Wilking, but also the subsequent refinements by Yi Lai).
 

Many singular stochastic PDEs are expected to be universal objects that govern a wide range of microscopic models in different universality classes. Two notable examples are KPZ and \Phi^4_3. In these cases, one usually finds a parameter in the system, and tunes according to the space-time scale in such a way that the system rescales to the SPDE in the large-scale limit. We justify this belief for a large class of continuous microscopic growth models (for KPZ) and phase co-existence models (for Phi^4_3), allowing microscopic nonlinear mechanisms far beyond polynomials. Aside from the framework of regularity structures, the main new ingredient is a moment bound for general nonlinear functionals of Gaussians. This essentially allows one to reduce the problem of a general function to that of a polynomial. Based on a joint work with Martin Hairer, and another joint work in progress with Chenjie Fan and Jiawei Li. 

In a recent paper, Basterra, Bobkova, Ponto, Tillmann and Yeakel defined
topological operads with homological stability (OHS) and proved that the
group completion of an algebra over an OHS is weakly equivalent to an
infinite loop space.

In this talk, I shall outline a construction which to an algebra A over
an OHS associates a new infinite loop space. Under mild conditions on
the operad, this space is equivalent as an infinite loop space to the
group completion of A. This generalises a result of Wahl on the
equivalence of the two infinite loop space structures constructed by
Tillmann on the classifying space of the stable mapping class group. I
shall also talk about an application of this construction to stable
moduli spaces of high-dimensional manifolds in thesense of Galatius and
Randal-Williams.

We will start by presenting two basic probabilistic effects for questions concerning the regularity of functions and nonlinear operations on functions. We will then overview well-posedenss results for the nonlinear wave equation, the nonlinear Schr\"odinger equation and the nonlinear heat equation, in the presence of singular randomness.

In this talk we discuss new effective methods to test pairwise containment of arbitrary (possibly singular) subvarieties of any smooth projective toric variety and to determine algebraic multiplicity without working in local rings. These methods may be implemented without using Gröbner bases; in particular any algorithm to compute the number of solutions of a zero-dimensional polynomial system may be used. The methods arise from techniques developed to compute the Segre class s(X,Y) of X in Y for X and Y arbitrary subschemes of some smooth projective toric variety T. In particular, this work also gives an explicit method to compute these Segre classes and other associated objects such as the Fulton-MacPherson intersection product of projective varieties.
These algorithms are implemented in Macaulay2 and have been found to be effective on a variety of examples. This is joint work with Corey Harris (University of Oslo).

A virtue of the special geometry underlying the string theory moduli space of  Calabi--Yau manifolds is the existence of a canonical choice of moduli space coordinates. In heterotic theories, as much as we would desire it, there is no obvious choice of coordinates and so we should be covariant. I will discuss some issues in doing this.

Aura Raulo (Ecological and Evolutionary Dynamics) and Marie-Claire Koschowitz (Vertebrate Palaeobiology) discuss their work and its mathematical challenges.

Aura Raulo

" Aura Raulo is a graduate student in Zoology Department working on transmission of symbiotic bacteria in the social networks of their animal hosts"
Title: Heaps in networks - How we share our microbiota through kisses
Abstract: Humans, like all vertebrates have a microbiome, a diverse community of symbiotic bacteria that live in and on us and are crucial for our functioning. These bacteria help us digest food, regulate our mood and function as a key part of our immune system. Intriguingly, while they are part of us, they are, unlike our other cells, in constant flux between us, challenging the traditional definition of a biological individual. Many of these bacteria need intimate social contact to be transmitted from human to human, making social network analysis tools handy in explaining their community dynamics.What then is a recipe for a ``good microbiome”? Theories and evidence implies that the most healthy and immunologically robust microbiome composition is both diverse, semi-stable and somewhat synchronized among closely interacting individuals, but little is known about what kind of transmission landscapes determine these bacterial cocktails. In my talk, I will present humanmicrobiome as a network trait: a metacommunity of cells shaped by an equilibrium of isolation and contact among their hosts. I propose that we do notnecessarily need to think of levels of life (e.g. cells, individuals, populations) as being neatly nested inside of each other. Rather, aggregations of cooperating cells (both bacteria and human cells) can be considered as mere tighter clusters in their interaction network, dynamically creating de novo defined units of life. I will present a few game theoretical evolutionary dilemmas following from this perspective and highlight outstanding questions in mapping how network position of the host translates into community composition of bacteria in flux.

Marie Koschowitz
“Marie Koschowitz is a PhD student in the Department of Zoology and the Department of Earth Sciences, working on comparative physiology and large scale evolutionary patterns in reptiles such as crocodiles, birds and dinosaurs."
Title: Putting the maths into dinosaurs – A zoologist's perspective
Abstract: Contemporary palaeontology is a subject area that often deals with sparse data.Therefore, palaeontologists became rather inventive in pursuit of getting the most out of what is available. If we find a dinosaur’s skull that shows prominent, but puzzling, bony ridges without any apparent function, how can we make meaningful interpretations of its purpose in the living animal that was? If we are confronted with a variety of partially preserved bones from animals looking anatomically similar, but not quite alike, how can we infer relationships in the absence of genetic data?Some methods that resolve these questions, such as finite element analysis, were borrowed from engineering. Others, like comparative phylogenetics or MCMC generalised mixed effects models, are even more directly based on mathematical computations. All of these approaches help us to calculate things like a raptors bite-force and understand the ins and outsof their skulls anatomy, or why pterosaurs and plesiosaurs aren’t exactly dinosaurs. This talk aims to presents a selection of current approaches to applied mathematics which have been inspired by interdisciplinary research – and to foster awareness of all the ways how mathematicians can get involved in “dinosaur research”, if they feel inclined to do so.


 

The class of sheaf Laplacians can be characterized as the convex closure of a certain set of sparse semidefinite matrices. From this viewpoint, the study of sheaf Laplacians becomes a question of linear algebra on sparse matrices. I will discuss the applications of this perspective to the problems of approximating, sparsifying, and learning sheaves.

This workshop will focus on the main causes of exam stress, anxiety and panic and look at practical strategies to manage and overcome these issues. We will also review strategies to best support exam preparation.

Dr Ruth Collins is a Chartered Psychologist who specialises in the management of anxiety and panic. She is also a trained mindfulness teacher and an associate of the Oxford Mindfulness Centre.

Inertia-gravity waves (IGWs) are ubiquitous in the ocean and the atmosphere. Once generated (by tides, topography, convection and other processes), they propagate and scatter in the large-scale, geostrophically-balanced background flow. I will discuss models of this scattering which represent the background flow as a random field with known statistics. Without assumption of spatial scale separation between waves and flow, the scattering is described by a kinetic equation involving a scattering cross section determined by the energy spectrum of the flow. In the limit of small-scale waves, this equation reduces to a diffusion equation in wavenumber space. This predicts, in particular, IGW energy spectra scaling as k^{-2}, consistent with observations in the atmosphere and ocean, lending some support to recent claims that (sub)mesoscale spectra can be attributed to almost linear IGWs.  The theoretical predictions are checked against numerical simulations of the three-dimensional Boussinesq equations.
(Joint work with Miles Savva and Hossein Kafiabad.)

The discrete fundamental groups of a metric space can be thought of as fundamental groups that `ignore' closed loops up to some specified size R. As the parameter R grows, these groups have been used to produce interesting invariants of coarse geometry. On the other hand, as R gets smaller one would expect to retrieve the usual fundamental group as a limit. In this talk I will try to briefly illustrate both these aspects.

The problem of decomposing a given dataset as a superposition of basic motifs arises in a wide range of application areas, including neural spike sorting and the analysis of astrophysical and microscopy data. Motivated by these problems, we study a "short-and-sparse" deconvolution problem, in which the goal is to recover a short motif a from its convolution with a random spike train $x$. We formulate this problem as optimization over the sphere. We analyze the geometry of this (nonconvex) optimization problem, and argue that when the target spike train is sufficiently sparse, on a region of the sphere, every local minimum is equivalent to the ground truth, up to symmetry (here a signed shift). This characterization obtains, e.g., for generic kernels of length $k$, when the sparsity rate of the spike train is proportional to $k^{-2/3}$ (i.e., roughly $k^{1/3}$ spikes in each length-$k$ window). This geometric characterization implies that efficient methods obtain the ground truth under the same conditions. 

Our analysis highlights the key roles of symmetry and negative curvature in the behavior of efficient methods -- in particular, the role of a "dispersive" structure in promoting efficient convergence to global optimizers without the need to explicitly leverage second-order information. We sketch connections to broader families of benign nonconvex problems in machine learning and signal processing, in which efficient methods obtain global optima independent of initialization. These problems include variants of sparse dictionary learning, tensor decomposition, and phase recovery.

Joint work with Yuqian Zhang, Yenson Lau, Han-Wen Kuo, Dar Gilboa, Sky Cheung, Abhay Pasupathy

Atom Probe Tomography is a powerful 3D mass spectrometry technique. By pulsing the sample apex with an electric field, surface atoms are ionised and collected by a detector. A 3D image of estimated initial ion positions is constructed via an image reconstruction protocol. Current protocols assume ion trajectories follow a stereographic projection. However, this method assumes a hemispherical sample apex that fails to account for varying material ionisation rates and introduces severe distortions into atomic distributions for complex material systems.

We aim to develop continuum models and use this to derive a time-dependent mapping describing how ion initial positions on the sample surface correspond to final impact positions on the detector. When correctly calibrated with experiment, such a mapping could be used for performing reconstruction.

Currently we track the sample surface using a level set method, while the electric field is solved via BEM or a FEM-BEM coupling. These field calculations must remain accurate close to the boundary. Calibrating unknown evaporation parameters with experiment requires an ensemble of models per experiment. Therefore, we are also looking to maximise model efficiency via BEM compression methods i.e. fast multipole BEM. Efficiently constructing and reliably interpolating the non-bijective trajectory mapping, while accounting for ion trajectory overlap and instabilities (at sample surface corners), also presents intriguing problems.

This project is in collaboration with Cameca, the leading manufacturer of commercial atom probe instruments. If successful in minimising distortions such a technique could become valuable within the semiconductor industry.

PLEASE NOTE THAT THIS SEMINAR IS CANCELLED DUE TO UNFORSEEN CIRCUMSTANCES.

We introduce a new probabilistic model for primes, which we believe is a better predictor for large gaps than the models of Cramer and Granville. We also make strong connections between our model, prime k-tuple counts, large gaps and the "square-root sieve".  In particular, our model makes a prediction about large prime gaps that may contradict the models of Cramer and Granville, depending on the tightness of a certain sieve estimate. This is joint work with Bill Banks and Terence Tao.

Gauge-theoretic invariants such as Donaldson or Seiberg–Witten invariants of 4-manifolds, Casson invariants of 3-manifolds, Donaldson–Thomas invariants of Calabi–Yau 3- and 4-folds, and putative Donaldson–Segal invariants of G_2 manifolds are defined by constructing a moduli space of solutions to an elliptic PDE as a (derived) manifold and integrating the (virtual) fundamental class against cohomology classes. For a moduli space to have a (virtual) fundamental class it must be compact, oriented, and (quasi-)smooth. We first describe a general framework for addressing orientability of gauge-theoretic moduli spaces due to Joyce–Tanaka–Upmeier. We then show that the moduli stack of perfect complexes of coherent sheaves on a Calabi–Yau 4-fold X is a homotopy-theoretic group completion of the topological realisation of the moduli stack of algebraic vector bundles on X. This allows one to extend orientations on the locus of algebraic vector bundles to the boundary of the (compact) moduli space of coherent sheaves using the universal property of homotopy-theoretic group completions. This is a necessary step in constructing Donaldson–Thomas invariants of Calabi–Yau 4-folds. This is joint work with Yalong Cao and Dominic Joyce.