September 2018

Sun Mon Tue Wed Thu Fri Sat
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
 
 
 
 
 
 
 
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.

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 14, 2018 — 11:30 to 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?

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.

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.

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.

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.

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. 2022 (83)
    1. July (4)
    2. June (17)
    3. May (10)
    4. April (12)
    5. March (18)
    6. February (10)
    7. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
    1. December (2)
    2. November (18)
    3. October (14)
    4. September (7)
    5. August (2)
    6. July (10)
    7. June (13)
    8. May (17)
    9. April (9)
    10. March (19)
    11. February (14)
    12. January (11)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)