Cambridge

Derived moduli stacks extend moduli stacks to give families over simplicial or dg rings. Lurie's representability theorem gives criteria for a functor to be representable by a derived geometric stack, and I will introduce a variant of it. This establishes representability for problems such as moduli of sheaves and moduli of polarised schemes.

A cactus product is much like a wedge product of pointed spaces, but instead of being uniquely defined there is a moduli space of possible cactus products. I will discuss how this space can be interpreted geometrically and how its combinatorics calculates the homology of the automorphism group of a free product with no free group factors. Then I will reinterpret the moduli space with Outer space in mind: the lobes of the cacti now behave like boundaries and our free products can now include free group factors.

A number is said to be $y$-smooth if all of its prime factors are

at most $y$. A lot of work has been done to establish the (equi)distribution

of smooth numbers in arithmetic progressions, on various ranges of $x$,$y$

and $q$ (the common difference of the progression). In this talk I will

explain some recent results on this problem. One ingredient is the use of a

majorant principle for trigonometric sums to carefully analyse a certain

contour integral.

Joyce and Song expressed the wall-crossing behaviour of Donaldson-Thomas invariants using a sum over graphs. Joyce expected that these would have something to do with the Feynman diagrams of suitable physical theories. I will show how this can be achieved in the framework for wall-crossing proposed by Gaiotto, Moore and Neitzke. JS diagrams emerge from small corrections to a hyperkahler metric. The basics of GMN theory will be explained during the first talk.

Joyce and Song expressed the wall-crossing behaviour of Donaldson-Thomas invariants using a sum over graphs. Joyce expected that these would have something to do with the Feynman diagrams of suitable physical theories. I will show how this can be achieved in the framework for wall-crossing proposed by Gaiotto, Moore and Neitzke. JS diagrams emerge from small corrections to a hyperkahler metric. The basics of GMN theory will be explained during the

first talk.

We say that a hypergraph is \emph{stable} if each sufficiently large subset of its vertices either spans many hyperedges or is very structured. Hypergraphs that arise naturally in many classical settings posses the above property. For example, the famous stability theorem of Erdos and Simonovits and the triangle removal lemma of Ruzsa and Szemeredi imply that the hypergraph on the vertex set $E(K_n)$ whose hyperedges are the edge sets of all triangles in $K_n$ is stable. In the talk, we will present the following general theorem: If $(H_n)_n$ is a sequence of stable hypergraphs satisfying certain technical conditions, then a typical (i.e., uniform random) $m$-element independent set of $H_n$ is very structured, provided that $m$ is sufficiently large. The above abstract theorem has many interesting corollaries, some of which we will discuss. Among other things, it implies sharp bounds on the number of sum-free sets in a large class of finite Abelian groups and gives an alternate proof of Szemeredi’s theorem on arithmetic progressions in random subsets of integers.

Joint work with Noga Alon, Jozsef Balogh, and Robert Morris.