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

Tutte seminar - Debbie Leung

Computational and Cryptanalytic consequences of time travel

Speaker: Debbie Leung
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We focus on two particular models of closed time like curves.

Tuesday, July 23, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Jens Vygen

Faster resource Sharing and VLSI Routing

Speaker: Jens Vygen
Affiliation: University of Bonn
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We present a faster algorithm for the min-max resource sharing problem, generalizing the Garg-Könemann algorithm, and improving previous results by Grigoriadis and Khachiyan, Khandekar, and Jansen and Zhang.

Monday, July 29, 2013 (all day)

Workshop on Flexible Network Design

Flexible network design

Topics include

  • Theoretical computer science
  • Graph algorithms
  • Discrete optimization

Local organizers

  • Joseph Cheriyan (Waterloo)
  • Anupam Gupta (Carnegie Mellon)
  • Jochen Könemann (Waterloo)
  • Stefano Leonardi (Sapienza U. of Rome)
  • R.
Tuesday, August 13, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Graph Theory seminar - Mike Molloy

Frozen vertices in colourings of a random graph

Speaker: Mike Molloy
Affiliation: University of Toronto
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Over the past decade, much of the work on  random graph colouring,random k-SAT, and other random constraint satisfaction problems has focussed on some foundational unproven hypotheses that have arisen from statistical physics.

Tuesday, August 20, 2013 1:30 pm - 2:30 pm EDT (GMT -04:00)

Seminar - Sebi Ciaoba

Connectivity and matching properties of distance-regular graphs

Speaker: Sebi Ciaoba
Affiliation: University of Delaware
Room: Mathematics and Computer Building (MC) 5158

Abstract:

A strongly regular graph is a regular graph such that the size of the common neighborhood of two distinct vertices depends only on whether the vertices are adjacent or not.

Friday, September 13, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Luke Postle

3-Coloring and 3-List-Coloring Graphs of Girth at least Five on Surfaces

Speaker: Luke Postle
Affiliation: University of Waterloo and Emory University
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Grotzsch proved that every triangle-free planar graph is 3-colorable. This theorem follows easily once one proves that every planar graph of girth at least five is 3-colorable.

Thursday, September 19, 2013 1:00 pm - 2:30 pm EDT (GMT -04:00)

Algebraic Graph Theory seminar

Matching Polynomials, Real Stable Polynomials and Ramanujan Graphs

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

Abstract:

In important recent work Marcus, Spielman and Srivastava have proved that for if k > 2, there is a family of bipartite Ramanujan graphs of valency k.

Friday, September 20, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Eric Katz

Line arrangements and intersection theory on algebraic surfaces

Speaker: Eric Katz
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

Line arrangements in the plane are an object of combinatorial and algebraic geometric interest. Their combinatorial analogues are rank 3 matroids. A line arrangement determines a particular algebraic surface.

Friday, September 27, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte seminar - Anna Bertiger

The Rim Hook Rule: Relating Quantum Cohomology of the Grassmannian to Ordinary Cohomology of the Grassmannian

Speaker: Anna Bertiger
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

I will present the cohomology ring of the Grassmannian of k planes in $\mathbb{C}^n$, roughly a ring with generators related to subspaces of the Grassmannian and product related to overlap

Thursday, October 3, 2013 3:30 pm - 4:30 pm EDT (GMT -04:00)

Algebraic Graph Theory seminar

Stable Polynomials and Ramanujan Graphs

Speaker: Andrew Childs
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We show how Marcus, Spielman and Srivastava use stable polynomials to
construct bipartite Ramunujan graphs of degree $k$ whenever $k\ge3$. (This will be the first of two lectures.)