Past

TBA

There are many constructions that yield C*-algebras. For example, we build them from groups, quantum groups, dynamical systems, and graphs. In this talk we look at C*-algebras that arise from a certain type of game. It turns out that the properties of the underlying game gives us very strong information about existence of traces of various types on the game algebra. The recent solution of the Connes Embedding Problem arises from a game whose algebra has a trace but no hyperlinear trace.

Assumed knowledge: Familiarity with tensor products of Hilbert spaces, the algebra of a discrete group, and free products of groups.

Abstract: In many situations, one needs to decide between acting to reveal data about a system and acting to generate profit; this is the trade-off between exploration and exploitation. A simple situation where we face this trade-off is a multiarmed bandit problem, where one has M ‘bandits’ which generate reward from an unknown distribution, and one must choose which bandit to play at each time. The key difficulty in the multi-armed bandit problem is that the action often affects the information obtained. Due to the curse of dimensionality, solving the bandit problem directly is often computationally intractable.

In this talk, we will formulate a general class of the multi-armed bandit problem as a relaxed stochastic control problem. By introducing an entropy premium, we obtain a smooth asymptotic approximation to the value function. This yields a novel semi-index approximation of the optimal decision process, obtained numerically by solving a fixed point problem, which can be interpreted as explicitly balancing an exploration–exploitation trade-off.  Performance of the resulting Asymptotic Randomised Control (ARC) algorithm compares favourably with other approaches to correlated multi-armed bandits.

As an application of the multi-armed bandit, we also consider a multi-armed bandit problem where the observation from each bandit arrive from a Generalised Linear Model. We then use such model to consider a dynamic online pricing problem. The numerical simulation shows that the ARC algorithm also performs well compared to others.
============

Kirigami, the relatively unheralded cousin of origami, is the art of cutting paper to articulate and deploy it as a whole. By varying the number, size, orientation and coordination of the cuts, artists have used their imagination and intuition to create remarkable sculptures in 2 and 3 dimensions. I will describe some of our attempts to quantify the inverse problem that artists routinely solve, combining elementary mathematical ideas, with computations and physical models. 

[[{"fid":"60095","view_mode":"media_portrait_large","fields":{"format":"media_portrait_large","field_file_image_alt_text[und][0][value]":false,"field_file_image_title_text[und][0][value]":false},"type":"media","field_deltas":{"1":{"format":"media_portrait_large","field_file_image_alt_text[und][0][value]":false,"field_file_image_title_text[und][0][value]":false}},"attributes":{"class":"media-element file-media-portrait-large","data-delta":"1"}}]]

Reconstructing continuous signals based on a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with ``simple'' Fourier structure -- e.g., those involving frequencies within a bounded range, a small number of frequencies, or a few blocks of frequencies. More broadly, any prior knowledge about a signal's Fourier power spectrum can constrain its complexity.  Intuitively, signals with more highly constrained Fourier structure require fewer samples to reconstruct.

We formalize this intuition by showing that, roughly speaking, a continuous signal from a given class can be approximately reconstructed using a number of samples equal to the statistical dimension of the allowed power spectrum of that class. We prove that, in nearly all settings, this natural measure tightly characterizes the sample complexity of signal reconstruction.

Surprisingly, we also show that, up to logarithmic factors, a universal non-uniform sampling strategy can achieve this optimal complexity for any class of signals. We present a simple, efficient, and general algorithm for recovering a signal from the samples taken. For bandlimited and sparse signals, our method matches the state-of-the-art. At the same time, it gives the first computationally and sample efficient solution to a broad range of problems, including multiband signal reconstruction and common kriging and Gaussian process regression tasks.

Our work is based on a novel connection between randomized linear algebra and the problem of reconstructing signals with constrained Fourier structure. We extend tools based on statistical leverage score sampling and column-based matrix reconstruction to the approximation of continuous linear operators that arise in the signal fitting problem. We believe that these extensions are of independent interest and serve as a foundation for tackling a broad range of continuous time problems using randomized methods.

This is joint work with Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker and Amir Zandieh

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please send email to @email.

In 2010, Hrushovski--Loeser studied the homotopy type of the Berkovich analytification of a quasi-projective variety over a valued field. In this talk, we explore the extent to which some of their results might hold in a relative setting. More precisely, given a morphism of quasi-projective varieties over a valued field, we ask if we might construct deformation retractions of the analytifications of the source and target which are compatible with the analytification of the morphism and whose images are finite simplicial complexes. 

An inner model is a ground if V is a set forcing extension of it. The intersection of the grounds is the mantle, an inner model of ZFC which enjoys many nice properties. Fuchs, Hamkins, and Reitz showed that the mantle is highly malleable. Namely, they showed that every model of set theory is the mantle of a bigger, better universe of sets. This then raises the possibility of iterating the definition of the mantle—the mantle, the mantle of the mantle, and so on, taking intersections at limit stages—to obtain even deeper inner models. Let’s call the inner models in this sequence the inner mantles.

In this talk I will present some results, both positive and negative, about the sequence of inner mantles, answering some questions of Fuchs, Hamkins, and Reitz, results which are analogues of classic results about the sequence of iterated HODs. On the positive side: (Joint with Reitz) Every model of set theory is the eta-th inner mantle of a class forcing extension for any ordinal eta in the model. On the negative side: The sequence of inner mantles may fail to carry through at limit stages. Specifically, it is consistent that the omega-th inner mantle not be a definable class and it is consistent that it be a definable inner model of ¬AC.

 An important property of a Gromov hyperbolic space is that every path that is locally a quasi-geodesic is globally a quasi-geodesic. A theorem of Gromov states that this is a characterization of hyperbolicity, which means that all the properties of hyperbolic spaces and groups can be traced back to this simple fact. In this talk we generalize this property by considering only Morse quasi-geodesics.

We show that not only does this allow us to consider a much larger class of examples, such as CAT(0) spaces, hierarchically hyperbolic spaces and fundamental groups of 3-manifolds, but also we can effortlessly generalize several results from the theory of hyperbolic groups that were previously unknown in this generality.
 

Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic. Due to the NP-hardness of this problem, most previous attempts rely on heuristic techniques. We formulate the problem as a mixed integer linear program and use a large scale optimisation technique of column generation to solve it without the need of heuristic pattern mining. Our approach focuses on accuracy and on the provision of optimality guarantees. Experimental results on real world datasets demonstrate that our proposed method is effective at producing highly accurate factorisations and improves on the previously available best known results for 16 out of 24 problem instances.

--

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please contact @email.

An algebra $R$ is said to satisfy the Dixmier-Moeglin equivalence if a prime ideal $P$ of $R$ is primitive if and only if it is rational, if and only if it is locally closed, and a commonly studied problem in non-commutative algebra is to classify rings satisfying this equivalence, e.g. $U(\mathfrak g)$ for a finite dimensional Lie algebra $\mathfrak g$. We explore methods of generalising this to a $p$-adic setting, where we need to weaken the statement. Specifically, if $\hat R$ is the $p$-adic completion of a $\mathbb Q_p$-algebra $R$, rather than approaching the Dixmier-Moeglin equivalence for $\hat R$ directly, we instead compare the classes of primitive, rational and locally closed prime ideals of $\hat R$ within suitable "deformations". The case we focus on is where $R=U(L)$ for a $\mathbb Z_p$-Lie algebra $L$, and the deformations have the form $\hat U(p^n L)$, and we aim to prove a version of the equivalence in the instance where $L$ is nilpotent.

In this talk, we will present an approach to constrained optimisation when the set of constraints is a smooth manifold. This setting is of particular interest in data science applications, as many interesting sets of matrices have a manifold structure. We will show how we may couple classic ideas from differential geometry with modern methods such as autodifferentiation to simplify optimisation problems from spaces with a difficult topology (e.g. problems with orthogonal or fixed-rank constraints) to problems on ℝⁿ where we can use any classical optimisation methods to solve them. We will also show how to use these methods to automatically compute quantities such as the Riemannian gradient and Hessian. We will present the library GeoTorch that allows for putting these kind of constraints within models written in PyTorch by adding just one line to the model. We will also comment on some convergence results if time allows.

A link for this talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please contact @email.

Multivariate point processes are used to model event-type data in a wide range of domains. One interesting application is to model the emission of electric impulses of biological neurons. In this context, the point process model needs to capture the time-dependencies and interactions between neurons, which can be of two kinds: exciting or inhibiting. Estimating these interactions, and in particular the functional connectivity of the neurons are problems that have gained a lot of attention recently. The general nonlinear Hawkes process is a powerful model for events occurring at multiple locations in interaction. Although there is an extensive literature on the analysis of the linear model, the probabilistic and statistical properties of the nonlinear model are still mainly unknown. In this paper, we consider nonlinear Hawkes models and, in a Bayesian nonparametric inference framework, derive concentration rates for the posterior distribution.  We also infer the graph of interactions between the dimensions of the process and prove that the posterior distribution is consistent on the graph adjacency matrix.

I will discuss some of Mazur's work about congruences between Eisenstein series and cusp forms, and then end with an application to class groups of fields $\mathbb{Q}(N^{1/p})$, where $N$ and $p$ are primes.  I will only assume some algebraic number theory.  In particular, nothing about modular forms will be assumed.
 

In this talk I will consider model-independent pricing problems in a stochastic interest rates framework. In this case the usual tools from Optimal Transport and Skorokhod embedding cannot be applied. I will show how some pricing problems in a fixed-income market can be reformulated as Weak Optimal Transport (WOT) problems as introduced by Gozlan et al. I will present a super-replication theorem that follows from an extension of WOT results to the case of non-convex cost functions.
This talk is based on joint work with M. Beiglboeck and G. Pammer.

 In this talk I will discuss possible extensions of the euclidean quantitative isoperimetric inequality to compact Riemannian manifolds. 
This is joint work with O. Chodosh (Stanford) and M. Engelstein (University of Minnesota).

Artin groups are a family of groups generalizing braid groups. The Tits conjecture, which was proved by Crisp-Paris, states that squares of the standard generators generate an obvious right-angled Artin subgroup. In a joint work with Kevin Schreve, we consider a larger collection of elements, and conjecture that their sufficiently large powers generate an obvious right-angled Artin subgroup. In the case of the braid group, regarded as a mapping class group of a punctured disc, these elements correspond to Dehn twist around the loops enclosing multiple consecutive punctures. This alleged right-angled Artin group is in some sense as large as possible; its nerve is homeomorphic to the nerve of the ambient Artin group. We verify this conjecture for some classes of Artin groups. We use our results to conclude that certain Artin groups contain hyperbolic surface subgroups, answering questions of Gordon, Long and Reid.

In this talk, I will work on a smooth projective threefold X which satisfies the Bogomolov-Gieseker conjecture of Bayer-Macrì-Toda, such as the projective space P^3 or the quintic threefold. I will show certain moduli spaces of 2-dimensional torsion sheaves on X are smooth bundles over Hilbert schemes of ideal sheaves of curves and points in X. When X is Calabi-Yau this gives a simple wall crossing formula expressing curve counts (and so ultimately Gromov-Witten invariants) in terms of counts of D4-D2-D0 branes. This is joint work with Richard Thomas. 

I will discuss various operator algebras in supersymmetric quantum field theories in various dimensions. The operator algebras are induced and classified by generalised topological twists. Omega deformation plays an important role in connecting different sectors. This talk is based on previous works and a work in progress with Junya Yagi.

One of the very unique properties of AdS_3 spacetimes is that we can introduce a finite number of massless higher spin fields without yielding an inconsistent theory. In this talk, we would like to comment on what the spectrum of these theories looks like: from the known contribution of the light spectrum, that corresponds to the vacuum character of the W_N algebra, we can use modular invariance to constraint the heavy spectrum of the theory. However, in doing so, we find negative norm states, inconsistent with unitarity. We propose a possible cure by adding light states that can be interpreted as massive particles with a conical defect associated to them, and study what scenario we are left with. The results that we will revisit are those presented in 2009.01830. 

In this session we will discuss how interviewing and being interviewed has changed now that interviews are conducted online. We will have a panel comprising Marya Bazzi, Mohit Dalwadi, Sam Cohen, Ian Griffiths and Frances Kirwan who have either experienced being interviewed online and have interviewed online and we will compare experiences with in-person interviews. 

One of the fundamental examples of geometric representation theory is the Springer correspondence which parameterises the irreducible representations of the Weyl group of a lie algebra in terms of nilpotent orbits of the lie algebra and irreducible representations of the equivariant fundamental group of said nilpotent orbits. If you don’t like geometry this may sound entirely mysterious. In this talk I will hopefully offer a gentle introduction to the subject and present a preprint by Lusztig (2020) which gives an entirely algebraic description of the springer correspondence.

This session is particularly aimed at fourth-year and OMMS students who are completing a dissertation this year. The talk will be given by Dr Richard Earl who chairs Projects Committee. 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, providing references and avoiding plagiarism.