Events

Title: Claws, ω and χ: induced binary submatroids

Abstract:

I will discuss the interplay between clique number, chromatic number, and excluding induced submatroids in the setting of binary matroids.

Title: Chromatic Symmetric Functions and H-Free Graphs

Abstract:

Chromatic symmetric functions are defined in terms of colourings of particular graphs. Some key conjectures in this area concern whether chromatic symmetric functions of claw-free graphs can be written in terms of other symmetric functions with positive coefficients.

Title: LWE Part 1: The problem, the cryptosystem and its relationship to lattice Problems

Abstract:

In this talk we will give an overview of the Learning With Errors problem,

Title: What's an amplituhedron?

Abstract: 

I'll introduce the amplituhedron, focusing on why the suffix "hedron" is justified.

Title: Data-driven Inverse Optimization with Imperfect Information

Abstract:

We continue our reading group with a paper by Kuhn et al with the same title as above.

Title: Quantum State Transfer

Abstract:

Many quantum algorithms may be modeled as a quantum process occurring on a graph.  We interpret quantum channels implemented by spin chains as wires for transmission of states. 

Title: A George Szekeres formula for restricted partitions

Abstract:

We give asymptotic formulas for the number of integer partitions of n with at most j parts and having largest part at most r, say A(n,j,r). We do this also for the number of partitions of n with largest part equal to  r and having exactly j parts, say C(n,j,r).

Title: D. Bertsimas, I. Popescu - Optimal inequalities in probability theory: A convex optimization approach

Abstract: Abstract. We propose a semidefinite optimization approach to the problem of deriving tight moment

Title: Unitary groups over finite fields

Abstract: I will discuss the unitary groups over finite fields, and the structures on which they act (these include 2-designs and generalized quadrangles).

Title: Excluding claws in binary matroids

Abstract: A simple binary matroid is claw-free if no rank-3 flats are independent. We discuss an exact structure theorem for such matroids and sketch its proof. This is joint work with Peter Nelson.