Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

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 title matches:
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, January 25, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Jon Lee

Some submodular maximization algorithms

Speaker: Jon Lee
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Motivated by a problem of finding an optimal configuration of environmental monitoring stations, I will present some algorithms for a particular constrained submodular-maximization problem, the maximum-entropy sampling problem.

Friday, February 1, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Ian Post

The performance of the simplex method on deterministic Markov decision processes

Speaker: Ian Post
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Motivated by the search for strongly-polynomial algorithms for linear programming (an algorithm whose runtime depends only on the number of constraints and variables, not the sizes of the numbers involved), we analyze the

Friday, February 15, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Fatma Kilinc-Karzan

On Unified View of Nullspace-type Conditions for Sparse and Low-rank Recoveries

Speaker: Fatma Kilinc-Karzan
Affiliation: Carnegie Mellon University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We discuss a general notion of ~Ssparsity structure~T and present a unified framework for the recovery of "sparse-structured" signals from their linear image of reduced dimension possibly corrupted with noise

Friday, February 22, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Nicolai Hahnle

The Delta-ball game and the polynomial Hirsch conjecture

Speaker: Nicolai Hahnle
Affiliation: TU Berlin
Room: Mathematics and Computer Building (MC) 5158

Abstract:

The polynomial Hirsch conjecture, motivated by empirical observations in linear programming, is one of the fundamental open problems in the study of polyhedra.

Friday, March 1, 2013 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Guillauma Chapuy

Counting factorization of Coxeter elements into products of reflections

Speaker: Guillaume Chapuy
Affiliation: LIAFA, France
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A classical formula asserts that the number of factorizations of the full cycle (1,2,...,n) into (n-1) transpositions is n(n-2). I will talk about two generalizations of this result.

Friday, March 15, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - David Gosset

Universal computation by multi-particle quantum walk

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

Abstract:

A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition.

Friday, March 22, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Christoph Helmberg

Links between Spectral Properties of the Laplacian and Structural Properties of the Graph

Speaker: Christoph Helmberg
Affiliation: Chemnitz University of Technology, Germany
Room: Mathematics and Computer Building (MC) 5158

Abstract:

The Laplace matrix of a graph as well as its eigenvalues and eigenvectors appear in several rather diverse areas such as graph partitioning, Euclidean embedding problems, rigidity and

Wednesday, March 27, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Combinatorics and Optimization Professor talk - David Jao

Algebraic Curves in Cryptography

Speaker: Professor David Jao
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5136B

Abstract

Cryptosystems based on algebraic curves form one of the cornerstones of modern cryptography and represent one of the principal applications of algebraic geometry outside of mathematics.

Friday, April 5, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Penny Haxell

Extremal hpergraphs for packing and covering

Speaker: Penny Haxell
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A packing (or matching) in a hypergraph H is a set of pairwisedisjoint edges of H. A cover of H is a set C of vertices that meets all edges of H.

Friday, April 12, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - James Oxley

Inductive tools for handling internally 4-connected binary matroids

Speaker: James Oxley
Affiliation: Louisiana State University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A matroid is 3-connected if it does not break up as a 1-sum or a 2-sum. Numerous problems for matroids reduce easily to the study of 3-connected matroids.