Future students

Title: Unitary Groups, II

Abstract:

Actually the title should be 2 Unitary groups - I will discuss the 2-dimensional unitary groups.

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: 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: Unitary Groups

Abstract:

Unitary groups play an important role in physics and in finite geometry. This talk, the first of two, will provide an introduction to the topic focusing on the case where the underlying field is the complex numbers.

Title: Counting matroids

Abstract:

We discuss several recent results concerning matroid enumeration and typical properties of matroids, emphasizing the central role that sparse paving matroids play in these results.

Title: Traveling Salesman Problems

Abstract:

We discuss open research questions, both theoretical and computational, surrounding the traveling salesman problem.

Title: Random Networks: Enumeration, Generation, and Universality

Abstract:

Large networks appear in almost all branches of the sciences and in everyday life, and they are often modeled by random graphs. Among the various random graph models, random graphs with specified degrees are particularly important in modelling and analyzing real-world networks.

Title: An introduction to gammoids

Abstract:

A gammoid is a matroid that is defined via vertex connectivity in a graph.

Title: Comprehensive robust counterparts of uncertain problems

Abstract:

We continue our study of Robust Optimization by discussing the paper by Ben-Tal,  Boyd and Nemirovski, "Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems."

Title: Mixing in Discrete-Time Quantum Walks

Abstract:

Discrete-time quantum walks are building blocks for quantum algorithms. There are some parameters of a quantum walk that affect the performance of a quantum algorithm, such as the (time-averaged) limiting distribution and the mixing time.