Seminar

Title: Entropy and enumeration

Abstract: The information-theoretic concept of entropy is closely related to enumeration;

Title: Science of Security-- Could Such a Thing Exist?

Abstract: Recent years have seen increasing calls to make security research more "scientific". Who can argue with science being desirable?

Title: Rapid mixing of Glauber dynamics for colorings below Vigoda’s 11/6 threshold 

Abstract:

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k-colorings of a graph G on n vertices with maximum degree Δ is rapidly mixing for k ≥ Δ+2.

Title: The smallest eigenvalues of Hamming, Johnson and other graphs

Abstract:

The smallest eigenvalue of graphs is closely related to other graph parameters such as the independence number, the chromatic number or the max-cut.

Title: Counting Partitions Inside a Rectangle

Abstract:

The study of integer partitions is a classic subject with applications ranging from number theory to representation theory and combinatorics.

Title: Acyclic Colouring of Graphs on Surfaces

Abstract: An acyclic k-colouring of a graph G is a proper k-colouring of G with no

Title: Using Linear Algebra to do Matching Theory

Abstract:

A matching in a graph is a set of edges with each vertex contained in at most one edge. A perfect matching is a matching in which each vertex is contained in some edge.

Title: Algorithms for Rank-1 Bimatrix Games

Abstract:

The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices.

Title: Periodicity on Oriented Graphs by way of Transcendental Number Theory

Abstract: Using the adjacency matrix of a graph, it is straightforward to show that perfect state transfer between two vertices at some time t implies that both vertices will be periodic at time 2t.

Title: Gaps in the crossing numbers of drawings of the complete graph

Abstract: In the late 1990’s, a 5-author manuscript circulated proving the existence of intervals of integers that connot occur as the crossing number of a “good” drawing of the complete graph.