Events

Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:

In celebration of the 40th anniversary of the department, and the 50th anniversary of the university, the Department of Combinatorics and Optimization at the University of Waterloo hosted a six day conference June 18-23, 2007. The theme focussed on the six main research areas represented by the department: algebraic combinatorics; combinatorial optimization; continuous optimization; cryptography; graph theory; and quantum computing. The goal of the conference was to encourage and stimulate both further research within these areas, and cross-discipline interaction.

Friday, September 14, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Maarten can den Nest

Width Parameters of Graphs and Codes, and Tree Tensor Networks

Speaker: Maarten can den Nest
Affiliation: Institute for Quantum Optics and Quantum Information
Room: Mathematics & Computer Building (MC) 5158

Abstract

In this talk we will consider recent results, where we find that certain problems in graph theory can be linked to problems in quantum information theory (QIT), and that mathematical techniques rec

Friday, September 21, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Kevin Purbhoo

Tableaux, Puzzles and Mosaics

Speaker: Kevin Purbhoo
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

The Littlewood-Richardson numbers show up in a number of different areas of mathematics. They are structure constants of the ring of symmetric functions, which connects them to representation theory and cohomology of Grassmannians.

Friday, September 28, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Andrew Childs

Optimal Quantum Adversary Lower Bounds for Ordered Search

Speaker: Andrew Childs
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

How many steps are required to search an ordered list of n items? For a classical computer, about log2 n steps are necessary and sufficient.

Friday, October 5, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jim Geelen

The k-Linkage Problem for Graphs

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The k-linkage problem is the problem of finding internally disjoint paths connecting k prescribed pairs of vertices in a given graph.

Friday, October 12, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Hristo Sendov

On the Tunçel Conjecture: A New Class of Self-Concordant Barriers on Sets of Symmetric Matrices

Speaker: Hristo Sendov
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Given a separable strongly self-concordant function $f:\R^n \rightarrow \R$, we show the associated spectral function $F(X)= (f \circ \lambda)(X)$ is also strongly self-concordant function.

Friday, October 19, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jochen Könemann

Group-Strategy Proof Mechanisms for Network Design Games

Speaker: Jochen Könemann
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

About 15 years ago, Goemans and Williamson formally introduced the primal-dual framework for approximation algorithms and applied it to a class of network design optimization problems.

Friday, October 26, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Nick Wormald

Counting Unrooted Maps and Convex Polyhedra

Speaker: Hristo Sendov
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Since the time of Euler, the number of convex polyhedra with a given number of faces, or vertices and faces, has been under investigation.

Friday, November 2, 2007 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Ashwin Nayak

The Direct-Product Property, Subdistribution Bounds, and Applications

Speaker: Ashwin Nayak
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance.

Friday, November 9, 2007 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Chris Godsil

Are Most Graphs Determined by their Spectrum?

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The spectrum of a graph is the spectrum of its adjacency matrix. We will discuss the question raised in the title. At this point it is not even clear what the right conjecture is.