Mon, 10 Oct 2011
14:15
L3

Hilbert schemes, Torus Knots, and Khovanov Homology

Jacob Rasmussen
(Cambridge)
Abstract

Khovanov homology is an invariant of knots in S^3 which categorifies the Jones polynomial. Let C be a singular plane curve. I'll describe some conjectures relating the geometry of the Hilbert scheme of points on C to a variant of Khovanov homology which categorifies the HOMFLY-PT polynomial. These conjectures suggest a relation between HOMFLY-PT homology of torus knots and the representation theory of the rational Cherednik algebra. As a consequence, we get some easily testable predictions about the Khovanov homology of torus knots.

Tue, 15 Nov 2011
14:15
Oxford-Man Institute

Market Selection: Hungry Misers and Happy Bankrupts

Chris Rogers
(Cambridge)
Abstract

The Market Selection Hypothesis is a principle which (informally) proposes that `less knowledgeable' agents are eventually eliminated from the market. This elimination may take the form of starvation (the proportion of output consumed drops to zero), or may take the form of going broke (the proportion of asset held drops to zero), and these are not the same thing. Starvation may result from several causes, diverse beliefs being only one.We firstly identify and exclude these other possible causes, and then

prove that starvation is equivalent to inferior belief, under suitable technical conditions. On the other hand, going broke cannot be characterized solely in terms of beliefs, as we show. We next present a remarkable example with two agents with different beliefs, in which one agent starves yet amasses all the capital, and the other goes broke yet consumes all the output -- the hungry miser and the happy bankrupt.

This example also serves to show that although an agent may starve, he may have long-term impact on the prices. This relates to the notion of price impact introduced by Kogan et al (2009), which we correct in the final section, and then use to characterize situations where asymptotically equivalent

pricing holds.

Tue, 21 Jun 2011

15:45 - 16:45
L3

The Fukaya category of the once-punctured torus

Yanki Lekili
(Cambridge)
Abstract

In joint work with Tim Perutz, we give a complete characterization of the Fukaya category of the punctured torus, denoted by $Fuk(T_0)$. This, in particular, means that one can write down an explicit minimal model for $Fuk(T_0)$ in the form of an A-infinity algebra, denoted by A, and classify A-infinity structures on the relevant algebra. A result that we will discuss is that no associative algebra is quasi-equivalent to the model A of the Fukaya category of the punctured torus, i.e., A is non-formal. $Fuk(T_0)$ will be connected to many topics of interest: 1) It is the boundary category that we associate to a 3-manifold with torus boundary in our extension of Heegaard Floer theory to manifolds with boundary, 2) It is quasi-equivalent to the category of perfect complexes on an irreducible rational curve with a double point, an instance of homological mirror symmetry.

Thu, 10 Feb 2011

16:00 - 17:00
L3

Applications of nilsequences to number theory

Ben Green
(Cambridge)
Abstract

I will introduce the notion of a nilsequence, which is a kind of

"higher" analogue of the exponentials used in classical Fourier analysis. I

will summarise the current state of our understanding of these objects. Then

I will discuss a variety of applications: to solving linear equations in

primes (joint with T. Tao), to a version of Waring's problem for so-called

generalised polynomials (joint with V. Neale and Trevor Wooley) and to

solving certain pairs of diagonal quadratic equations in eight variables

(joint work with L. Matthiesen). Some of the work to be described is a

little preliminary!

Tue, 09 Nov 2010

14:30 - 15:30
L3

Intersecting families of graphs

David Ellis
(Cambridge)
Abstract

A family of graphs F on a fixed set of n vertices is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. Simonovits and Sos conjectured that such a family has size at most (1/8)2^{\binom{n}{2}}, and that equality holds only if F
consists of all graphs containing some fixed triangle. Recently, the author, Yuval Filmus and Ehud Friedgut proved a strengthening of this conjecture, namely that if F is an odd-cycle-intersecting family of graphs, then |F| \leq (1/8) 2^{\binom{n}{2}}. Equality holds only if F consists of all graphs containing some fixed triangle. A stability result also holds: an odd-cycle-intersecting family with size close to the maximum must be close to a family of the above form. We will outline proofs of these results, which use Fourier analysis, together with an analysis of the properties of random cuts in graphs, and some results in the theory of Boolean functions. We will then discuss some related open questions.

All will be based on joint work with Yuval Filmus (University of Toronto) and Ehud Friedgut (Hebrew University of Jerusalem).

Wed, 20 Oct 2010
15:00
Gibson 1st Floor SR

Constructing Singular Monopoles from Cheshire Bows

Chris Blair
(Cambridge)
Abstract

Singular monopoles are solutions to the Bogomolny equation with prescribed singularities of Dirac monopole type. Previously such monopoles could be constructed only by the Nahm transform, with some difficulty. We therefore formulate a new construction of all singular monopoles. This construction relies on two ideas: Kronheimer's correspondence between singular monopoles on R^3 and self-dual connections on the multi-Taub-NUT space, and Cherkis' recent construction of self-dual connections on curved spaces using bow diagrams. As an example of our method we use it to obtain the explicit solution for a charge one SU(2) singular monopole with an arbitrary number of singularities.

Subscribe to Cambridge