Seminar

Title: Perfect state transfer on Cayley graphs

Abstract:

Perfect state transfer on Cayley graphs

Title: Edge-maximal graphs on surfaces

Abstract:

It is straightforward to show that, with the exception of small complete graphs, every edge-maximal planar graph triangulates the plane.

Title: A Quantum Query Complexity Trichotomy for Regular Languages

Abstract:

We consider the quantum query complexity of regular languages and discover a surprising trichotomy: each regular language has query complexity either Theta(1), ~Theta(sqrt(n)) or Theta(n). 

Title: Interpolated versions of the Central Limit Theorem, and crossings of pair-partitions

Abstract:

Title: Perfect state transfer on Hadamard diagonalizable graphs

Abstract:

A (weighted) graph whose Laplacian matrix is diagonalizable by a Hadamard matrix is said to be Hadamard diagonalizable.

Title: Sublinear separators in intersection graphs of convex shapes

Abstract: 

A balanced separator of an n-vertex graph is set of vertices whose deletion leaves only components of size at most 2n/3.

Title: Boundary measurement and sign variation in real projective space

Abstract:

Title: Discrete quantum walks, embeddings and designs

Abstract:

We construct a quantum walk from an embedding of a graph.

Title: Quantum Colouring and Derangements

Abstract:

Work in quantum information has lead to the introduction of quantum colourings.

Title: On the depth of cutting planesOn the depth of cutting planes

Abstract:

We tackle one of the most important open problems in computational integer programming: cut selection.

For four decades, cutting planes were believed to be useful only for structured combinatorial problems. This changed in 1995 when Balas, Ceria and Cornuéjols showed that Gomory cuts could helpfully strengthen the formulation of general integer programming problems. Since then, many other cut generation techniques have been developed, but their practical success has been moderate at best.