Events

Title: An introduction to vertex minors

Abstract:

This introductory lecture on vertex minors of graphs will highlight the similarities and differences with minors of graphs. We will also discuss the main conjectures relating to vertex minors.

Title: Post-Quantum Group-based Cryptography

Abstract:

The National Security Agency (NSA) in August 2015 announced plans to transition to post-quantum algorithms 

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.

Title: An introduction to gammoids

Abstract:

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

Title: Tangent Lines and the equation 28 = 7 × 4

Abstract:

I will discuss combinatorial aspects of tangent lines to curves and planar graphs. In algebraic geometry, every smooth plane curve has finitely many lines that are tangent to it at two separate points.

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: 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.