University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Events by month

January 2020

Thursday, January 9, 2020 — 1:00 PM EST

Title: Periodicity in Quantum Walks

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

Abstract:

Despite the title, quantum walks are, in general, not periodic. However they are, in general, periodic to any desired degree of accuracy.

Friday, January 10, 2020 — 1:00 PM EST

Title: Beating 3/2 for Approximating TSP in the Half-Integral Case

Speaker: Logan Grout Affiliation: University of Waterloo Room: MC 5417

Abstract:

In 2013, Schalekamp, Williamson, and van Zuylen conjectured that the integrality gap for the Subtour Polytope was attained on its half-integral vertices.

Thursday, January 16, 2020 — 1:00 PM EST

Title: Covers of Complete Bipartite Graphs

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

Abstract:

I will discuss antipodal distance-regular covers of complete bipartite graphs $K_{n,n}$. The index of such a cover is at most $n$.

Thursday, January 16, 2020 — 2:03 PM EST

Title: Electrical networks, random spanning trees, and matroids

Speaker: David Wagner Affiliation: University of Waterloo Room: MC 5417

Abstract:

This is a reprise of a survey talk I gave at the East Coast Combinatorics Conference in August 2019, and a variation of one I gave in the graphs and matroids seminar last year.

Friday, January 17, 2020 — 1:00 PM EST

Title: The Capacitated Survivable Network Design Problem

Speaker: Ishan Bansal Affiliation: University of Waterloo Room: MC 5417

Abstract:

The Capacitated Survivable Network Design Problem or Cap-SNDP models a network reinforcement problem where the network designer wants to find a minimum-cost set of reinforcements that protects the network from an adversary.

Thursday, January 23, 2020 — 2:30 PM EST

Title: Some places matroids appear in quantum field theory and some places I would like them to

Speaker: Karen Yeats Affiliation: University of Waterloo Room: MC 5417

Abstract:

I will discuss some places matroids have appeared in my work in quantum field theory, including some older work on numerator structure with Dirk Kreimer and some work in progress with Iain Crump on period identities.

Thursday, January 23, 2020 — 4:00 PM EST

Title: Uniformly generate graphs with given degrees rapidly

Speaker: Jane Gao Affiliation: University of Waterloo Room: MC 5479

Abstract:

I will survey the research on exact/approximate uniform generation of graphs with prescribed degrees.

Friday, January 24, 2020 — 1:00 PM EST

Title: On the Strong Nine Dragon Tree Conjecture

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

Abstract:

Nash-Williams forest covering theorem says that a graph decomposes into $k$ forests if and only if it has fractional arboricity at most $k$. In 2012 Mickeal Montassier, Patrice Ossona de Mendez, Andre Raspaud, and Xuding Zhu  proposed a significant strengthening of Nash-Williams Theorem, called the Strong Nine Dragon Tree Conjecture.

Thursday, January 30, 2020 — 2:30 PM EST

Title: Random Pattern-Avoiding Permutations

Speaker: Neal Madras Affiliation: York University Room: MC 5417

Abstract:

A "pattern of length k" is simply a permutation of {1,..,k}.  This pattern is said to be contained in a permutation of {1,...,N} (for N>k) if there is a subsequence of k elements of the (long) permutation that appears in the same relative order as the pattern.

Thursday, January 30, 2020 — 4:00 PM EST

Title: Excluding a ladder

Speaker: Paul Wollan Affiliation: Sapienza Università di Roma Room: MC 5479

Abstract:

A folklore result says that if a graph does not contain the path of length k as a subgraph, then it has tree-depth at most k.

Friday, January 31, 2020 — 1:00 PM EST

Title: Network Design $s$-$t$ Effective Resistance

Speaker: Hong Zhou Affiliation: University of Waterloo Room: MC 5417

Abstract:

We consider a problem of designing a network with small $s$-$t$ effective resistance. In the problem, we are given an undirected graph $G=(V,E)$, two designated vertices $s,t \in V$, and a budget $k$.

S M T W T F S
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
31
1
  1. 2020 (59)
    1. July (9)
    2. June (11)
    3. May (6)
    4. March (11)
    5. February (11)
    6. January (11)
  2. 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)
  3. 2018 (138)
  4. 2017 (103)
  5. 2016 (137)
  6. 2015 (136)
  7. 2014 (88)
  8. 2013 (48)
  9. 2012 (39)
  10. 2011 (36)
  11. 2010 (40)
  12. 2009 (40)
  13. 2008 (39)
  14. 2007 (15)