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 - February 2020

Friday, February 28, 2020 — 3:30 PM EST

Title: Parallel strategies for SIDH: towards computing SIDH twice as fast

Speaker: Francisco Rodríguez-Henríquez
Affiliation: CINVESTAV-IPN
Room: MC 5501

Abstrtact:

Over the last ten years, there has been an intense research effort to find hard mathematical problems that would be presumably hard to solve by a quantum attacker and at the same time could be used to build reasonably efficient public-key cryptoschemes.

Friday, February 28, 2020 — 1:00 PM EST

Title: An Introduction to the Circuits of Polyhedra, The Circuit Diameter, and Their Applications

Speaker: Sean Kafer
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

The combinatorial diameter of a polyhedron P is the maximum value of a shortest path between two vertices of P, where the path moves along edges of P. Its study is motivated largely by its implications on the running time of the Simplex algorithm.

Thursday, February 27, 2020 — 4:00 PM EST

Title: Excluding an asymmetric group labelled graph

Speaker: Farbod Yadegarian
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

There are several models of group labelled graphs. In the simpler, undirected model, for an abelian group Γ, every edge e receives a label γ(e) in Γ. 

Thursday, February 27, 2020 — 2:30 PM EST

Title: An equivariant basis for the cohomology of Springer fibers

Speaker: Ed Richmond
Affiliation: Oklahoma State University
Room: MC 5417

Abstract:

Springer fibers are subvarieties of the flag variety that play an important role in combinatorics and geometric representation theory. In this talk, I will discuss joint work with Martha Precup where we analyze the equivariant cohomology of Springer fibers in type A.

Thursday, February 27, 2020 — 1:00 PM EST

Title: Linear Programming and Extremal Expanders

Speaker: Sabrina Lato
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

Nozaki proved a linear programming bound on the number of vertices that depends on the eigenvalues of a graph.

Thursday, February 20, 2020 — 1:00 PM EST

Title: Triangle-free Strongly Regular Graphs

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

Abstract:

Complete bipartite graphs aside, only five triangle-free strongly regular graphs are known. I will describe some of the background to this topic, with the focus on outlining the construction of the Higman-Sims graph.

Friday, February 14, 2020 — 1:00 PM EST

Title: The Aggregation Closure is Polyhedral for Packing and Covering Integer Programs

Speaker: Kanstantsin Pashkovich
Affiliation: University of Ottawa
Room: MC 5417

Abstract:

Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta introduced the concept of aggregation cuts for packing and covering integer programs.

Thursday, February 13, 2020 — 4:00 PM EST

Title: List Colouring and Ohba's Conjecture

Speaker: Matt Kroeker
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

The question of when the list-chromatic number of a graph G, denoted chi_l(G), equals its chromatic number is fundamental to the theory of list colouring.

Thursday, February 13, 2020 — 2:30 PM EST

Title: A generalization of balanced tableaux and matching problems with unique solutions

Speaker: Brian Chan
Affiliation: University of British Columbia
Room: MC 5417

Abstract:

In this talk, we consider families of finite sets that we call shellable and that have been characterized by Chang and Hirst and Hughes as being the families of sets that admit unique solutions to Hall's matching problem.

Thursday, February 13, 2020 — 1:00 PM EST

Title: Moore Graphs

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

Abstract:

Moore graphs were introduced by Hoffman and Singleton in a fundamental paper. They can be defined as graphs with diameter $d$ and girth $2d+1$.

Thursday, February 6, 2020 — 4:00 PM EST

Title: Minimum degree conditions for Hamilton cycles in hypergrahs

Speaker: Richard Lang
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

A classic result of Dirac states that a graph in which every vertex is connected to at least half of the other vertices contains a Hamilton cycle. How can we generalize Dirac's theorem to hypergraphs?

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
  1. 2020 (89)
    1. September (11)
    2. August (11)
    3. July (17)
    4. June (11)
    5. May (6)
    6. March (11)
    7. February (11)
    8. 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)