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:
Tuesday, March 25, 2014 4:30 pm - 4:30 pm EDT (GMT -04:00)

Joint colloquium with pure mathematics

Enumerating Maps

Speaker: Sean Carrell
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A map is a graph embedded in an orientable surface. In this talk we will discuss the various methods that have been used to enumerate different types of maps.

Thursday, March 27, 2014 2:00 pm - 2:00 pm EDT (GMT -04:00)

Algebraic combinatorics seminar - Yan Xu

A Bernstein Creation Operator of Schur Basis

Speaker: Yan Xu
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

In this talk, I will introduce an operator B that acts on 1 to create the Schur basis of Sym.

Friday, March 28, 2014 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte seminar - Ben Salisbury - cancelled

The Gindikin-Karpelevich Formula and Combinatorics of Crystals

Speaker: Jintai Ding
Affiliation: University of Cincinnati
Room: Mathematics and Computer Building (MC) 5168

Abstract:

The Gindikin-Karpelevich formula computes the constant of proportionality for the intertwining integral between two induced spherical representation of a $p$-adic reductive group $G.$ The right-hand side of this formula is a product ov

Wednesday, April 2, 2014 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graph theory seminar - Jim Geelen

Structure in Dense Triangle-free Graphs Part 1

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract:

Brandt and Thomass\’ e proved that every $n$-vertex triangle-free graph with minimum degree greater than $\frac 1 3 n$ is $4$-colourable.

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

Tutte seminar - David Gosset

The Bose-Hubbard Model is QMA-complete

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

Abstract:

The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph. The particles can move between adjacent vertices and experience a repulsive on-site interaction.

Wednesday, April 9, 2014 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graph theory seminar - Hamideh Hosseinzadeh

Algebraic Topology and Matchings in Hypergraphs

Speaker: Hamideh Hosseinzadeh
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract: 

Algebraic topology has shown to be a powerful toolbox for solving graph theoretical problems. However, many of the techniques used to solve matching-related problems in graphs do not easily carry over to the case of hypergraphs.

Friday, April 11, 2014 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte seminar - Andreas Feldmann

On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree

Speaker: Andreas Feldmann
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract: 

The bottleneck of the currently best known approximation algorithms for the NP-hard Steiner tree problem is the solution of its large, so called hypergraphic, linear programming relaxation (HYP).

Wednesday, April 16, 2014 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graph theory seminar - Jim Geelen

Structure in Dense Triangle-free Graphs - Part 2

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

Abstract:

Brandt and Thomassé proved that every n-vertex triangle-free graph
with minimum degree greater than (1/3)n is 4-colourable. On the other
hand, Hijnal proved that, for each ε>0, there are triangle-free graphs

Monday, April 21, 2014 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte seminar - Dmitriy Drusvyatskiy

Feasibility problems: from alternating projections to matrix completions.

Speaker: Dmitriy Drusvyatskiy
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Feasibility problems permeate computational mathematics. In the most general framework, we may seek a point in the intersection of two arbitrary closed sets.

Thursday, May 8, 2014 10:00 am - 10:00 am EDT (GMT -04:00)

Seminar - Tor Myklebust

Introduction to Interior Point Methods for Convex Optimization

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract:

This is the first of a series of three lectures on interior point methods for convex optimization.  Interior point methods (IPMs) are a class of algorithms for computing approximate solutions to convex optimization problems.  In this talk