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 28, 2012 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Ricardo Fukasawa

Cutting planes based on multiple rows of a simplex tableau

Speaker: Ricardo Fukasawa
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Cutting planes are one of the most essential components in modern mixed-integer programming solvers.

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

Tutte seminar - Peter Nelson

The Density Hales-Jewett Theorem and matroid theory

Speaker: Peter Nelson
Affiliation: Victoria University of Wellington
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The Density Hales-Jewett theorem is a powerful tool in Ramsey theory that finds a highly structured subset in an arbitrary dense set of strings over a finite alphabet.

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

Tutte seminar - Chaitanya Swamy

Black-Box Reductions for Cost-Sharing Mechanism Design

Speaker: Levent Tunçel
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Given n self-interested players who compete for some service or good, a cost-sharing mechanism (or protocol) must decide which players to serve and what prices to charge to the players so that the prices recover the cost incurred to

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

Tutte seminar - Nick Wormald

Small subgraph conditioning, cycle factors, restricted permutations, and combs

Speaker: Nick Wormald
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Consider a uniformly random t-dimensional lattice walk taking only nonnegative steps in each dimension, starting at 0 and finishing at some point x=(x_1, ..., x_t). Suppose that k > 0 divides m = x_1 + 2x_2 + ...

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

Tutte seminar - Jim Geelen

Connectivity in matroids and graphs

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

Abstract:

Tutte's Wheels Theorem gives an inductive way to construct simple 3-connected graphs. We give an analogous result for a weak version of k-connectivity, for arbitrary k.

Friday, November 16, 2012 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Christian Borgs

Convergence of sparse graphs as a problem at the intersection of graph theory, statistical physics and probility

Speaker: Christan Borgs
Affiliation: Microsoft Research New England
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Many real-world graphs are large and growing. This naturally raises the question of a suitable concept of graph convergence.

Friday, November 23, 2012 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Antoine Deza

Combinatorial, computational, and geometric approaches to the colourful simplicial depth

Speaker: Antoine Deza
Affiliation: McMaster University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

In statistics, there are several measures of the depth of a point p relative to a fixed set S of sample points in dimension d.

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

Tutte seminar - Marcus Appleby

Galois Symmetries of a SIC-POVM

Speaker: Levent Tunçel
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The problem of proving (or disproving) the existence of symmetric informationally complete positive operator valued measures (SICs) has been the focus of much effort in the quantum information community during the last 12 years.

Friday, December 14, 2012 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Sanjeeb Dash

Cutting planes for mixed-integer programs derived from multi-branch split cuts

Speaker: Sanjeeb Dash
Affiliation: IBM TJ Watson Research Center
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Cutting planes (cuts, for short), or inequalities satisfied by integral solutions of systems of linear inequalities, are important tools used in modern solvers for integer programming problems.

Friday, January 18, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - David Wagner

Stable polynomials, matroids, and sums of squares

Speaker: David Wagner
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A multivariate polynomial p(x1,...,xn) is stable provided that it never vanishes when all variables are complex numbers with positive imaginary part.