Thu, 20 Jan 2011
17:00
L3

tba

Tobias Kaiser
(Passau)
Mon, 29 Nov 2010

12:00 - 13:00
L3

Generalized Geometry in AdS/CFT and Volume Minimization

Maxime Gabella
(Oxford)
Abstract
Motivated by the study of general supersymmetric AdS_5 solutions of type IIB supergravity with fluxes, I will define a notion of "generalized Sasaki-Einstein geometry," characterized by a differential system for a triple of symplectic forms in 4d. I will then show that the minimization of the contact volume over a space of generalized Sasakian structures determines the Reeb vector field for such a solution. This is the geometric counterpart of a-maximization in superconformal field theory. This variational procedure will be put to good use by computing BPS quantities for a predicted infinite family of solutions dual to mass-deformed generalized conifolds.
Wed, 24 Nov 2010

12:00 - 13:00
L3

Lectures on global Springer theory II

Zhiwei Yun
(MIT)
Abstract

Extend the affine Weyl group action in Lecture I to double affine Hecke algebra action, and (hopefully) more examples.

Tue, 23 Nov 2010

10:00 - 11:00
L3

Lectures on global Springer theory I

Zhiwei Yun
(MIT)
Abstract

Introduce the parabolic Hitchin fibration, construct the affine Weyl group action on its fiberwise cohomology, and study one example.

Mon, 15 Nov 2010

12:00 - 13:00
L3

The Large Hadron Collider – the story so far

Alan Barr
(Oxford)
Abstract
String theory has a vested interest in a particular S1xS1 object found just outside Geneva. The machine in question has been colliding protons at high energy since March this year, and by now the ATLAS and CMS experiments have clocked up more than 10^12 high-energy events. In this seminar I present the status of the accelerator and detectors, highlight the major physics results obtained so far, and discuss the extent to which information from the LHC can inform us about TeV-scale theory.
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).

Mon, 22 Nov 2010

12:00 - 13:00
L3

Constraining F-theory GUTs

Sakura Schafer-Nameki
(Kings College London)
Abstract
String theory phenomenology generically suffers from either too much flexibility (and lack of predictability) or from the a high specialization to case by case studies. I will discuss how F-theory GUT model building manages to get around these pitfalls, in particular, I will explain, how to systematically include global string consistency conditions, which are independent of the specific compactification, and which come with the benefit of highly constraining the class of GUT models that can arise from F-theory.
Subscribe to L3