Events

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, November 18, 2016 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium: Bertrand Guenin

Title: Towards a possible resolution of the flowing conjecture 

Speaker: Bertrand Guenin
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Wednesday, November 23, 2016 4:00 pm - 4:00 pm EST (GMT -05:00)

Graphs and Matroids Seminar: Michelle Delcourt

Title: Toward a Conjecture of Thomassen

Speaker: Michelle Delcourt
Affiliation: University of Illinois, Urbana-Champaign
Room: MC 6486

Abstract:

Graphs and Matroids Seminar Abstract

Friday, November 25, 2016 3:30 pm - 5:00 pm EST (GMT -05:00)

Tutte Colloquium: Laura Sanita

Title: Stabilizing network bargaining games by blocking players.

Speaker: Laura Sanita
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Tutte Colloquium Abstract

Thursday, December 1, 2016 2:00 pm - 2:00 pm EST (GMT -05:00)

Algebraic Graph Theory Seminar: John Sinkovic

Title: Non positive eigenvalues and cographs

Speaker: John Sinkovic
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

AGT Seminar Abstract

Thursday, December 1, 2016 3:30 pm - 3:30 pm EST (GMT -05:00)

Graphs & Matroids Seminar - Rutger Campbell

Title: On excluded minors for real-representability

Speaker: Rutger Campbell
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

We show that any real representable matroid is a minor of an excluded-minor (for real-representability) that is complex-representable.

Friday, December 2, 2016 3:30 pm - 5:00 pm EST (GMT -05:00)

Tutte Colloquium: Heinz Bauschke

Title: On the Douglas-Rachford algorithm

Speaker: Heinz Bauschke
Affiliation: University of British Columbia
Room: MC 5501

Abstract:

The Douglas-Rachford algorithm is a popular splitting method for finding a minimizer of the sum of two convex (possibly nonsmooth) functions; or, more generally, a zero of the sum of two maximally monotone operators.

Wednesday, December 7, 2016 3:30 pm - 3:30 pm EST (GMT -05:00)

Optimization Seminar: Yurii Nesterov

Title: Universal Newton Method

Speaker: Yurii Nesterov
Affiliation: CORE/INMA UCL, Belgium
Room: MC 5501

Abstract

Thursday, December 8, 2016 2:00 pm - 2:00 pm EST (GMT -05:00)

Algebraic Graph Theory Seminar - Chris Godsil

Title: Interpretations of the strong Arnold hypothesis

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 6486

Abstract: I will discuss two interpretations of the strong Arnold hypothesis, indicating connections to bounds on sizes of cocliques, and to embedding graphs in quadrics.

Thursday, January 12, 2017 3:00 pm - 4:00 pm EST (GMT -05:00)

Algebraic Graph Theory Seminar: Chris Godsil

Title: Lie Groups and Lie Algebras

Speaker: Chris Godsil
Affiliation: University of Waterloo
Location: MC 6486

Abstract:

I will give a talk a sketchy introduction to Lie groups and Lie algebras. 

Wednesday, January 18, 2017 4:00 pm - 4:00 pm EST (GMT -05:00)

Optimization Seminar - Hugo Woerdeman

Title: Stable and real-zero polynomials in two variables

Speaker: Hugo Woerdeman
Affiliation Drexel University
Location MC 6486

Abstract:

Optimization Seminar Abstract