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, February 27, 2009 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Levent Tunçel

Fundamentals of Convergence Theories for Convex Relaxation Hierarchies

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

Abstract:

Lift-and-project operators provide an automatic way for constructing all facets of the convex hull of 0,1 vectors in a polytope given by linear or polynomial inequalities.

Friday, March 6, 2009 3:30 pm - 4:30 pm EST (GMT -05:00)

Tutte seminar - Yinyu Ye

A Unified Theorem on Semidefinite Programming Rank Reduction and its Applications

Speaker: Yinyu Ye
Affiliation: Stanford University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

We present a unified theorem on semidefinite programming solution rank reduction that provides a unified treatment of and generalizes several well--known results in the literature.

Friday, March 13, 2009 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Pablo Parrilo

From the stable set problem to convex algebraic geometry

Speaker: Pablo Parrilo
Affiliation: MIT
Room: Mathematics & Computer Building (MC) 5158

Abstract:

The Lovasz theta body TH(G) is a well-known relaxation of the stable set polytope STAB(G) that is computable using semidefinite programming.

Friday, March 20, 2009 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Guy Kortsarz

Increasing connectivity of a graph from 1 to 2

Speaker: Guy Kortsarz
Affiliation: Rutgers University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Given an unweighted graph G(V,E) and a set F\subseteq V\times V the goal is to find a minimum SIZE F'\subset F such that G(V,E+F') is 2 edge-connected, namely, every edge lies in a cycle in G(V,E+F'). 

Friday, March 27, 2009 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Edlyn Teske

Pairing-friendly elliptic curves with variable CM discriminant

Speaker: Edlyn Teske
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems.

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

Tutte seminar - David Wagner

The Random Cluster Model

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

Abstract:

The random cluster model (RCM) is an object of interest in graph theory, probability, and statistical mechanics. Its combinatorial aspects include chromatic polynomials, spanning trees or forests, and connected spanning subgraphs.

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

Tutte seminar - Dan McQuillan

Kotzig Arrays and Magic Labelings

Speaker: Dan McQuillan
Affiliation: Norwich University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A total labeling is a bijective assignment of integers 1,2,3,.. to the vertices and edges of a graph. A vertex-magic total labeling (VMTL) has the added property that for each vertex v, the sum of its label and its incident edge labels is a constant.

Friday, May 8, 2009 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - David Jackson

A quantum invariant of knots

Speaker: David Jackson
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

A (mathematical) knot is the everyday, perhaps mundane, object but with its two free ends having been smoothly sealed together.

Friday, May 15, 2009 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Ian Goulden

Kerov's character polynomials and permutations

Speaker: Ian Goulden
Affiliation: University of Waterloo
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Kerov's character polynomials give an expression for a particular scaling of irreducible characters of the symmetric group, as a polynomial in the free cumulants of the corresponding Young diagram.

Friday, May 22, 2009 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Alan Frieze

The Karp-Sipser Matching Algorithm and Refinements

Speaker: Alan Frieze
Affiliation: Carnegie Mellon University
Room: Mathematics & Computer Building (MC) 5158

Abstract:

Karp and Sipser (1981) proposed a simple greedy matching algorithm that they showed to work surprisingly well on sparse random graphs.