It is a widely accepted philosophy in additive number theory that convex sets ought not to exhibit much additive structure. We could measure this by estimating the sizes of their sumsets. In this talk, we will hopefully move from the philosophical to the concrete, by giving ways to see that convex sets and functions have poor additive structure. We will also discuss some recent developments in the area.

The AdS/CFT correspondence provides a rich setup to study the properties of gauge theories and the dual theories of gravity, in particular their thermodynamic properties. On RxS3, the maximally supersymmetric Yang-Mills theory with gauge group U(N) exhibits a phase transition that resembles the confinement-deconfinement transition of QCD. For infinite N, this transition is characterized by Hagedorn behavior. We show how the corresponding Hagedorn temperature can be calculated at any value of the ’t Hooft coupling via integrability. For large but finite N, we show how the Hagedorn behavior is replaced by Lee-Yang behavior.

This will be a zoom seminar with communal viewing in L4

Deep learning continues to dominate machine learning and has been successful in computer vision, natural language processing, etc. Its impact has now expanded to many research areas in science and engineering. In this talk, I will mainly focus on some recent impacts of deep learning on computational mathematics. I will present our recent work on bridging deep neural networks with numerical differential equations, and how it may guide us in designing new models and algorithms for some scientific computing tasks. On the one hand, I will present some of our works on the design of interpretable data-driven models for system identification and model reduction. On the other hand, I will present our recent attempts at combining wisdom from numerical PDEs and machine learning to design data-driven solvers for PDEs and their applications in electromagnetic simulation.

In this talk, we describe some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics.

The motivations for this work come from Computer Science, but there may be something of interest for model theorists and other logicians.

The basic setting involves studying the category of relational structures via a resource-indexed family of adjunctions with some process category - which unfolds relational structures into treelike forms, allowing natural resource parameters to be assigned to these unfoldings.

One basic instance of this scheme allows us to recover, in a purely structural, syntax-free way:

- the Ehrenfeucht-Fraisse game

- the quantifier rank fragments of first-order logic

- the equivalences on structures induced by (i) the quantifier rank fragments, (ii) the restriction to the existential-positive part, and (iii) the extension with counting quantifiers

- the combinatorial parameter of tree-depth (Nesetril and Ossona de Mendez).

Another instance recovers the k-pebble game, the finite-variable fragments, the corresponding equivalences, and the combinatorial parameter of treewidth.

Other instances cover modal, guarded and hybrid fragments, generalized quantifiers, and a wide range of combinatorial parameters.

This whole scheme has been axiomatized in a very general setting, of arboreal categories and arboreal covers.

Beyond this basic level, a landscape is beginning to emerge, in which structural features of the resource categories, adjunctions and comonads are reflected in degrees of logical and computational tractability of the corresponding languages.

Examples include semantic characterisation and preservation theorems, Lovasz-type results on  isomorphisms, and classification of constraint satisfaction problems.

The speakers will be giving short presentations introducing topics in algebraic number theory, arithmetic topology, random matrix theory, and analytic number theory.

Undergrads and Master's students are encouraged to come and sample a taste of research in these areas.