Mon, 01 Nov 2010

12:00 - 13:00
L3

New three-generation models from the heterotic standard embedding

Rhys Davies
(Oxford)
Abstract

Recently, two new Calabi-Yau threefolds have been discovered which have small Hodge numbers, and give rise to three chiral generations of fermions via the so-called 'standard embedding' compactification of the heterotic string.
In this talk I will describe how to deform the standard embedding on these manifolds in order to achieve the correct gauge group.  I will also describe how to calculate the resulting spectrum and interactions, which is still work in progress.

Mon, 08 Nov 2010

12:00 - 13:00
L3

Generalised Space-Time and Duality

Peter West
(Kings College London)
Abstract
I will review the conjectured E_{11} symmetry of strings and branes. I will explain how it is natural in the context of this symmetry to introduce a generalised space-time with a corresponding generalised geometry.
Tue, 18 Jan 2011

12:00 - 13:00
L3

Quantum communication in Rindler spacetime

Prakash Panangaden (McGill, visiting Comlab)
Abstract

Communication between observers in a relativistic scenario has proved to be

a setting for a fruitful dialogue between quantum field theory and quantum

information theory. A state that an inertial observer in Minkowski space

perceives to be the vacuum will appear to an accelerating observer to be a

thermal bath of radiation. We study the impact of this Davies-Fulling-Unruh

noise on communication, particularly quantum communication from an inertial

sender to an accelerating observer and private communication between two

inertial observers in the presence of an accelerating eavesdropper. In both

cases, we establish compact, tractable formulas for the associated

communication capacities assuming encodings that allow a single excitation

in one of a fixed number of modes per use of the communications channel.

Tue, 16 Nov 2010

14:30 - 15:30
L3

Triangles in tripartite graphs

John Talbot
(UCL)
Abstract

How many triangles must a graph of density d contain? This old question due to Erdos was recently answered by Razborov, after many decades of progress by numerous authors.

We will consider the analogous question for tripartite graphs. Given a tripartite graph with prescribed edges densities between each

pair of classes how many triangles must it contain?

Tue, 26 Oct 2010

14:30 - 15:30
L3

When not knowing can slow you down

Raphael Clifford
(Bristol)
Abstract

Combinatorial pattern matching is a subject which has given us fast and elegant algorithms for a number of practical real world problems as well as being of great theoretical interest. However, when single character wildcards or so-called "don't know" symbols are introduced into the input, classic methods break down and it becomes much more challenging to find provably fast solutions. This talk will give a brief overview of recent results in the area of pattern matching with don't knows and show how techniques from fields as disperse FFTs, group testing and algebraic coding theory have been required to make any progress. We will, if time permits, also discuss the main open problems in the area.

Subscribe to L3