Events - September 2018

Friday, September 28, 2018 — 3:30 PM EDT

Title: The Shapiro-Shapiro Conjecture

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

Abstract:

Given four lines in 3-space, can you find a fifth line that intersects the other four? How many?

This is the smallest non-trivial example of a "Schubert problem". The answer, in this case, is not hard to compute: there are two such lines. Generalizations of this fact date back to 19th century work of Schubert.

Thursday, September 27, 2018 — 3:30 PM EDT

Title: A characterization of (p,q)-mixing when p/q < 4

Speaker: Ben Moore
Affiliation: University of Waterloo
Room: MC 5417

Abstract: Let Hom(G,H) be the graph whose vertex set is the set of H-colourings of G, and two H-colourings f and g are adjacent if f differs from g in at most one vertex.

Wednesday, September 26, 2018 — 4:00 PM EDT

Title: Classification, Regularization and Logistic Regression

Speaker: Haesol Im
Affiliation: University of Waterloo
Room: MC 5479

Abstract: For the first two seminar series in machine learning,

Friday, September 21, 2018 — 3:30 PM EDT

Title: Quantum advantage with shallow circuits

Speaker: David Gosset
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

A constant-depth quantum circuit is a parallel quantum computation that proceeds for a constant number of time steps.  In this work we prove that constant-depth quantum circuits are more powerful than their classical counterparts.

Thursday, September 20, 2018 — 3:30 PM EDT

Title: Naji’s characterization of circle graphs

Speaker: Jim Geelen
Affiliation: University of Waterloo
Room: MC 5417

Abstract: A circle graph is the intersection graph of chords of a circle.

Friday, September 14, 2018 — 3:30 PM EDT

Title: Rapid mixing of Glauber dynamics for colorings below Vigoda’s 11/6 threshold 

Speaker: Michelle Delcourt
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k-colorings of a graph G on n vertices with maximum degree Δ is rapidly mixing for k ≥ Δ+2.

Friday, September 14, 2018 — 11:30 AM EDT

Title: Science of Security-- Could Such a Thing Exist?

Speaker: Paul van Oorschot
Affiliation: Carelton University
Room: MC 5501

Abstract: Recent years have seen increasing calls to make security research more "scientific". Who can argue with science being desirable?

Thursday, September 13, 2018 — 3:30 PM EDT

Title: Entropy and enumeration

Speaker: Jorn van der Pol
Affiliation: University of Waterloo
Room: MC 5417

Abstract: The information-theoretic concept of entropy is closely related to enumeration;

Friday, September 7, 2018 — 3:30 PM EDT

Title: The smallest eigenvalues of Hamming, Johnson and other graphs

Speaker: Sebastian Cioaba
Affiliation: University of Delaware
Room: MC 5501

Abstract:

The smallest eigenvalue of graphs is closely related to other graph parameters such as the independence number, the chromatic number or the max-cut.

S M T W T F S
26
27
28
29
30
31
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
1
2
3
4
5
6
  1. 2019 (167)
    1. December (5)
    2. November (15)
    3. October (18)
    4. September (15)
    5. August (9)
    6. July (17)
    7. June (18)
    8. May (16)
    9. April (9)
    10. March (24)
    11. February (13)
    12. January (8)
  2. 2018 (138)
    1. December (2)
    2. November (18)
    3. October (14)
    4. September (9)
    5. August (2)
    6. July (10)
    7. June (13)
    8. May (17)
    9. April (9)
    10. March (19)
    11. February (14)
    12. January (11)
  3. 2017 (103)
  4. 2016 (137)
  5. 2015 (136)
  6. 2014 (88)
  7. 2013 (48)
  8. 2012 (39)
  9. 2011 (36)
  10. 2010 (40)
  11. 2009 (40)
  12. 2008 (39)
  13. 2007 (15)