THIS SITE

Information for

Events

Tuesday, May 31, 2016 — 3:30 PM to 4:30 PM EDT

Title: Inverses of Trees

Tuesday, May 31, 2016 — 3:30 PM to 4:30 PM EDT

Title: Investigation of Crouzeix's Conjecture via Nonsmooth Optimization

Tuesday, May 31, 2016 — 2:30 PM to 3:50 PM EDT

Title: Coloring Graphs on Surfaces

Friday, May 27, 2016 — 3:30 PM to 4:30 PM EDT

Title: Following Pipe Dreams

Speaker: Nantel Bergeron

Affiliation:

Thursday, May 26, 2016 — 3:30 PM to 4:30 PM EDT

Title:  Canvases and Colouring

Tuesday, May 24, 2016 — 2:30 PM to 3:30 PM EDT

Title: Catalan numbers and critical points

Speaker: Kevin Purbhoo Affiliation: University of Waterloo Room: MC 6486

Abstract:

Friday, May 20, 2016 — 3:30 PM to 4:30 PM EDT

Title: Tight Load Balancing via Randomized Local Search

Thursday, May 19, 2016 — 3:30 PM to 4:30 PM EDT

Title: Density of Binary Matroids with no PG(t + 2; 2)-minor

Tuesday, May 17, 2016 — 3:30 PM to 4:30 PM EDT

Title: Uniform Mixing and Quantum Walks

Tuesday, May 17, 2016 — 2:30 PM to 3:30 PM EDT

Title: Characterizing planarity and graphicness by linear equations

Monday, May 16, 2016 — 4:15 PM EDT

Title: Stabilizing network bargaining games by blocking players

Tuesday, May 10, 2016 — 3:30 PM EDT

Title: Equitable partitions and quantum walks on graphs

Tuesday, May 10, 2016 — 2:30 PM EDT

Title: Approximation algorithms for facility location

Tuesday, May 10, 2016 — 2:30 PM EDT

Title: On the edit distance of powers of cycles

Friday, May 6, 2016 — 3:30 PM EDT

Title: Douglas-Rachford feasibility methods for matrix completion problems

Speaker: Jonathan Borwein Affiliation: University of Waterloo Room: MC 5501

Abstract: Many successful non-convex applications of the Douglas-Rachford reflection method for finding a point in the intersection of two sets can be viewed as the reconstruction of a matrix, with known properties, from a subset of its entries.  

Thursday, May 5, 2016 — 3:30 PM EDT

Title: On almost all matroids

Speaker: Peter Nelson Affiliation: University of Waterloo Room: MC 5417

Abstract: I will discuss a recent paper of Pendavingh and Van der Pol that resolved several natural, long-standing conjectures about the properties of almost all matroids. Namely, for some m that is polylogarithmic in n, almost all matroids on n elements are m-connected, have girth at least m, and have the rank-m self-dual uniform matroid as a minor.

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
  1. 2017 (59)
    1. August (1)
    2. July (4)
    3. June (9)
    4. May (10)
    5. April (7)
    6. March (13)
    7. February (10)
    8. January (5)
  2. 2016 (137)
    1. December (5)
    2. November (12)
    3. October (10)
    4. September (8)
    5. August (12)
    6. July (15)
    7. June (14)
    8. May (16)
    9. April (8)
    10. March (18)
    11. February (11)
    12. January (8)
  3. 2015 (136)
  4. 2014 (88)
  5. 2013 (48)
  6. 2012 (39)
  7. 2011 (36)
  8. 2010 (40)
  9. 2009 (40)
  10. 2008 (39)
  11. 2007 (15)