Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

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 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:
Friday, September 5, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Aaron Williams

Gray codes, universal cycles, and the cool-lex order

Speaker: Aaron Williams
Affiliation: University of Victoria
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The research area of combinatorial generation is concerned with minimal-change orderings for combinatorial objects of a particular type.

Friday, September 12, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Noga Alon

Combinatorial reasoning in Information Theory

Speaker: Noga Alon
Affiliation: Tel Aviv University and IAS, Princeton
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Combinatorial arguments have played a crucial role in the investigation of several surprising phenomena in Information Theory.

Friday, September 19, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Chaitanya Swamy

Approximation algorithms for envy-free profit-maximization problems

Speaker: Chaitanya Swamy
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We consider a class of pricing problems, called envy-free profit-maximization problems, wherein a seller wants to set prices on items and allocate items (which are available in limited supply) to customers so as to maximize hi

Friday, September 26, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Chris Godsil

Perfect state transfer on graphs

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

Abstract:

A continuous quantum walk on a graph is a quantum analog of a continuous random walk on a graph. If the adjacency matrix of the graph is $A$, then the behaviour of the walk is governed by the unitary matrix $H(t) := \exp(iAt)$.

Friday, October 3, 2008 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Seminar - Shang-Hua Teng

On the Complexity of Game and Market Equilibria

Speaker: Shang-Hua Teng
Affiliation: Boston University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

I will present some recent results in Algorithmic Game Theory and particularly in computing and approximating game and market equilibria.

Friday, October 10, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Sebi Cioaba

Recent developments in spectral graph theory

Speaker: Sebi Cioaba
Affiliation: University of Toronto
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Spectral graph theory studies the connections between the structure of a graph and its eigenvalues.

Friday, October 17, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Bertrand Guenin

Isomorphism theorems for even cycles and even cuts in graphs

Speaker: Bertrand Guenin
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A seminal result of Whitney characterizes when two graphs have the same cycle space (or equivalently the same cut space): namely, this occurs exactly when one graph can be obtained from the other by repeatedly rearranging the graph a

Friday, October 24, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Paul Seymour

Well-quasi-ordering tournaments and Rao's degree-sequence conjecture

Speaker: Paul Seymour
Affiliation: Princeton University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Rao conjectured about 1980 that in every infinite set of degree sequences (of graphs), there are two degree sequences with graphs one of which is an induced subgraph of the other.

Friday, October 31, 2008 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jim Geelen

Binary matroid minors

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

Abstract:

In joint work with Bert Gerards and Geoff Whittle, we have proved a structural characterization for minor-closed classes of binary matroids. I will give a brief description of the theorem and discuss potential applications.

Friday, November 7, 2008 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Elliot Anshelevich

Terminal Backup, 3D Matching and Covering Cubic Graphs

Speaker: Elliot Anshelevich
Affiliation: Rensselaer Polytechnic Institute
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We define a problem called Simplex Matching, and show that it is solvable in polynomial time.