Virtual

In 1997 Pimsner described how to construct two universal C*-algebras associated with an injective C*-correspondence, now known as the Toeplitz--Pimsner and Cuntz--Pimsner algebras. In this talk I will recall their construction, focusing for simplicity on the case of a finitely generated projective correspondence. I will describe the associated six-term exact sequence in K(K)-theory and explain how these can be used in practice for computational purposes. Finally, I will describe how, in the case of a self-Morita equivalence, these exact sequences can be interpreted as an operator algebraic version of the classical Gysin sequence for circle bundles.

The heart of modern machine learning (ML) is the approximation of high dimensional functions. Traditional approaches, such as approximation by piecewise polynomials, wavelets, or other linear combinations of fixed basis functions, suffer from the curse of dimensionality (CoD). We will present a mathematical perspective of ML, focusing on the issue of CoD. We will discuss three major issues: approximation theory and error analysis of modern ML models, dynamics and qualitative behavior of gradient descent algorithms, and ML from a continuous viewpoint. We will see that at the continuous level, ML can be formulated as a series of reasonably nice variational and PDE-like problems. Modern ML models/algorithms, such as the random feature and two-layer and residual neural network models, can all be viewed as special discretizations of such continuous problems. We will also present a framework that is suited for analyzing ML models and algorithms in high dimension, and present results that are free of CoD. Finally, we will discuss the fundamental reasons that are responsible for the success of modern ML, as well as the subtleties and mysteries that still remain to be understood.

In this talk, I will present different PDE models involving surface tension where it may be efficient to consider augmented versions.

In this talk, I will explain a new wall-crossing phenomenon on P^3 that induces non-Q-factorial singularities and thus cannot be understood as an operation in the MMP of the moduli space, unlike the case for many surfaces.  If time permits, I will explain how the wall-crossing could help to understand the geometry of the associated Hilbert scheme and PT moduli space.

A common theme in the definitions of larger large cardinals is the existence of elementary embeddings from the universe into an inner model. In contrast, smaller large cardinals, such as weakly compact and Ramsey cardinals, are usually characterized by their combinatorial properties such as existence of large homogeneous sets for colorings. It turns out that many familiar smaller large cardinals have elegant elementary embedding characterizations. The embeddings here are correspondingly ‘small’; they are between transitive set models of set theory, usually the size of the large cardinal in question. The study of these elementary embeddings has led us to isolate certain important properties via which we have defined robust hierarchies of large cardinals below a measurable cardinal. In this talk, I will introduce these types of elementary embeddings and discuss the large cardinal hierarchies that have come out of the analysis of their properties. The more recent results in this area are a joint work with Philipp Schlicht.

Forcing axioms state that the universe inherits certain properties of generic extensions for a given class of forcings. They are usually formulated via the existence of filters, but several alternative characterisations are known. For instance, Bagaria (2000) characterised some forcing axioms via generic absoluteness for objects of size $\omega_1$. In a related new approach, we consider principles stating the existence of filters that induce correct evaluations of sufficiently simple names in prescribed ways. For example, for the properties ‘nonempty’ or ‘unbounded in $\omega_1$’, consider the principle: whenever this property is forced for a given sufficiently simple name, then there exists a filter inducing an evaluation with the same property. This class of principles turns out to be surprisingly general: we will see how to characterise most known forcing axioms, but also some combinatorial principles that are not known to be equivalent to forcing axioms. This is recent joint work in progress with Christopher Turner.

Leibniz’s principle of identity of indiscernibles at first sight appears completely unrelated to set theory, but Mycielski (1995) formulated a set-theoretic axiom nowadays referred to as LM (for Leibniz-Mycielski) which captures the spirit of Leibniz’s dictum in the following sense:  LM holds in a model M of ZF iff M is elementarily equivalent to a model M* in which there is no pair of indiscernibles.  LM was further investigated in a 2004  paper of mine, which includes a proof that LM is equivalent to the global form of the Kinna-Wagner selection principle in set theory.  On the other hand, one can formulate a strong negation of Leibniz’s principle by first adding a unary predicate I(x) to the usual language of set theory, and then augmenting ZF with a scheme that ensures that I(x) describes a proper class of indiscernibles, thus giving rise to an extension ZFI of ZF that I showed (2005) to be intimately related to Mahlo cardinals of finite order. In this talk I will give an expository account of the above and related results that attest to a lively interaction between set theory and Leibniz’s principle of identity of indiscernibles.