Events

Title: Quantum walks II: spectral decomposition

Abstract:  This week, we continue with our learning series on quantum  
walks. Spectral decomposition is an important tool in algebraic graph  
theory. We will discuss its application in the study of continuous-time quantum walks.

Title: Improved Cheeger's inequalities

Title: On the minimum-cost chain-constrained spanning tree problem

Title: Brooks' theorem for matroids

Abstract: Let G be a graph with maximum degree $\Delta$. Brooks' theorem states that G has chromatic number at most $\Delta$+1, and that if equality holds, then G is a clique or odd cycle. I will discuss a natural matroidal analogue of this result, proved very recently by James Oxley.

Title: Generalized quadrangles III

Abstract: This week, we continue with our learning series on generalized quadrangles. We will discuss polarities, ovoids and spreads.

Title: How many colors can be saved?

Title: Low rank matrix recovery using Schatten-p quasi norm minimization

Abstract: We consider an f-version of Mirsky's singular value inequalities.  
Using a particular version of this inequality, we provide sufficient  
conditions to explain when the Schatten-p quasi norm minimization can  
be used for low rank matrix recovery.

Title: Large induced forests in subcubic and planar graphs

Title: On the power of PPT-preserving and non-signalling codes

Title: Modifying the Lovász theta function for obtaining upper bounds on
the stability number