Events

Strict Complementarity in Continuous Optimization

Abstract:

Most of us are familiar with the complementarity conditions and related theorems at least in the setting of linear optimization.

Sign-Solvability of Linear Programming and Linear Complementarity Problems

Abstract:

This talk presents an attempt to connect qualitative matrix theory with linear programming and linear complementarity problems.

Chromatic Zeros of Graphs

Abstract:

The φ⁴- and Penner models of 2d quantum gravity, the moduli space of curves and properties of 2-cell embeddings of graphs in Riemann surfaces

Abstract:

A map is a 2-cell embedding of a graph in a Riemann surface.

Approximation algorithms for (two) discrete stochastic optimization problems

Abstract:

One of the most active areas of research in the design of approximation algorithms is for discrete stochastic optimization problems, with a particular focus on 2-stage problems with recourse.

Unsolved Problems in Graph Theory

Abstract:

A book entitled "Graph Theory", co-authored by myself and Professor J.A. Bondy, has recently been published by Springer. It has an Appendix on unsolved problems. The aim of this talk is to present a selection of problems from that appendix.

A survey of quantum computer algorithms

Abstract:

In the past decade there has been a wide range of progress in quantum algorithms, such as algorithms for some generalizations of the hidden subgroup problem (which includes the factoring and discrete logarithm problems as special cases), the development an

Expanders, Universal Graphs and Disjoint Paths

Abstract:

The tight connection between the eigenvalues of a graph and its combinatorial properties leads to most of the interesting combinatorial and algorithmic applications of expanders.

Isomorphism and Canonical Labeling of Tournaments

Abstract:

We give a polynomial-time oracle algorithm for canonical labeling of tournaments that accesses oracles for tournament isomorphism and for canonizing rigid tournaments. For general graphs such a result is not known. 

On the Maximum of the Stirling Numbers

Abstract:

Say an integer n is exceptional if the maximum Stirling number of the second kind S(n, k) occurs for two(of necessity consecutive) values of k.