## University COVID-19 update

### 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 - 2018

Friday, May 18, 2018 — 3:30 PM EDT

## Tutte Colloquium - Jon Yard

Title: The number theory of equiangular lines

 Speaker: Jon Yard Affiliation: University of Waterloo Room: MC 5501

Abstract:

It is easy to prove that there can exist at most d2 equiangular complex lines in Cd. Configurations saturating this bound are known by other names: maximal equiangular tight frames, minimal complex projective 2-designs and symmetric informationally complete positive operator-valued measures (SIC-POVMs).

Thursday, May 17, 2018 — 3:30 PM EDT

## Graphs and Matroids Seminar

Title: Representability of Matroids

 Speaker: Rutger Campbell Affiliation: University of Waterloo Room: MC 5479

Abstract: I will go over some negative results regarding characterizations for the class of representable

Thursday, May 17, 2018 — 1:30 PM EDT

## Algebraic Graph Theory Seminar

Title: The Combinatorial Nullstellensatz

 Speaker: Maxwell Levit Affiliation: University of Waterloo Room: MC 6486

Abstract: I will survey Alon's survey of the combinatorial nullstellensatz.

Thursday, May 17, 2018 — 11:30 AM EDT

## Algebraic Combinatorics Seminar

Title: Asymptotic Distribution of Parameters in Random Maps

 Speaker: Julien Courtiel Affiliation: Universite de Caen in France Room: MC 6486

Abstract: A rooted map is a connected graph

Friday, May 11, 2018 — 3:30 PM EDT

## Tutte Colloquium - Jorn van der Pol

Title: Large matroids: asymptotic enumeration

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

Abstract:

How many matroids are there on a ground set of a given size? Although the question is a very basic one, we only know the answer up to a constant factor in the exponent.

Thursday, May 10, 2018 — 3:30 PM EDT

## Graphs and Matroids Seminar

Title: Coloring Graphs of Bounded Maximum Degree with Small Clique Number

 Speaker: Tom Kelly Affiliation: University of Waterloo Room: MC 5479

Abstract: Greedy coloring yields an upper bound on the chromatic number $\chi$ of $\Delta+1$ for graphs of maximum degree at most $\Delta$, which is tight for cliques.

Thursday, May 10, 2018 — 1:30 PM EDT

## Algebraic Graph Theory Seminar

Title: The Number 6 Hash Function Collision

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

Abstract: If V is a vector space of dimension d over the eld GF(q), we have all sorts of families of

Monday, May 7, 2018 — 1:00 PM EDT

## Cryptography Seminar

Title: LWE part 3: The relation with BDD

 Speaker: Luis Ruiz Affiliation: University of Waterloo Room: MC 6486

Abstract: The last piece of the puzzling reduction

Friday, May 4, 2018 — 3:30 PM EDT

## Tutte Colloquium - Marni Mishna

Title: The combinatorics of Standard Young tableaux of bounded height

 Speaker: Marni Mishna Affiliation: Simon Fraser University Room: MC 5501

Abstract:

Standard Young tableaux are a classic object of mathematics, appearing in problems from representation theory to bijective combinatorics.

Thursday, May 3, 2018 — 11:30 AM EDT

## Algebraic Combinatorics- Marni Mishna

Title: An elementary approach to the quasipolynomiality of the Kronecker coefficients

Friday, April 27, 2018 — 3:30 PM EDT

## Tutte Colloquium - Luc Vinet

Title: Spins Lattices, Graphs and Quantum State Revivals

 Speaker: Luc Vinet Affiliation: Université de Montréal Room: MC 5501

Abstract:

This talk will describe how certain features of quantum transport along spin chains can be enabled.

Friday, April 20, 2018 — 3:30 PM EDT

## Tutte Colloquium - Krystal Guo

Title: Transversals in covers of graphs

 Speaker: Krystal Guo Affiliation: Université Libre de Bruxelles Room: MC 5501

Abstract:

We study a polynomial with connections to correspondence colouring (also known as DP-colouring) and the Unique Games Conjecture.

Friday, April 13, 2018 — 3:30 PM EDT

## Tutte Colloquium - Chris Godsil

Title: Interpolating between the characteristic and matching polynomials of a graph

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

Abstract:

The characteristic polynomial Φ(X, t) of a graph X has two obvious combinatorial connections.

Wednesday, April 11, 2018 — 4:00 PM EDT

## Continuous Optimization Seminar - André Linhares

Title: Robust discrete optimization and network flows (paper by Bertsimas and Sim)

Friday, April 6, 2018 — 3:30 PM EDT

## Tutte Colloquium - Stephen Melczer

Title: Generating Functions: Theory, Algorithms, and Applications

 Speaker: Stephen Melczer Affiliation: University of Pennsylvania Room: MC 5501

Abstract:

Generating functions are an invaluable tool in many areas of discrete mathematics and beyond.

Thursday, April 5, 2018 — 1:30 PM EDT

## Algebraic Graph Theory Seminar - Chris Godsil

Title: Graphs and Unitals

Wednesday, April 4, 2018 — 4:00 PM EDT

## Continuous Optimization Seminar - Shenghao Yang

Title: Robust Solutions of Optimization Problems Affected by Uncertain Probabilities (paper by Ben-Tal A et al )

Tuesday, April 3, 2018 — 10:00 AM EDT

## Special Seminar - Paul Seymour

Title: Erdos-Hajnal meets Gyarfas-Sumner

 Speaker: Paul Seymour Affiliation: Princeton Room: QNC 1501

Abstract:

The Gyarfas-Sumner conjecture says that every graph with huge (enough) chromatic number and bounded clique number contains any given forest as an induced subgraph. (And non-forests do not have this property.)

Monday, April 2, 2018 — 1:00 PM EDT

## Cryptography Seminar- Ted Eaton, Geovandro Pereira & John Schank

### There are 3 short talks this week.

Title: Quantum Collision-Finding in Non-Uniform Random Functions

 Speaker: Ted Eaton Affiliation: ISARA Corporatio Room: MC 6486

Abstract: Proving the security of a scheme against a quantum adversary often makes the strong assumption of modelling the hash function as uniformly random. In this work, we study the generic security of non-uniform random functions, specifically those with min-entropy k. This has applications to the quantum security of the Fujisaki-Okamoto transformation, as well as allowing for more relaxed security assumptions. We discuss previous results and sketch a proof for an asymptotic upper and lower bound of 2k/3 quantum queries.

Thursday, March 29, 2018 — 3:30 PM EDT

## Graphs and Matroids- Iain Moffatt

Title: Knots and their (embedded) graphs

 Speaker: Iain Moffatt Affiliation: Royal Holloway University of London Room: MC 5479

Abstract

There is a classical and well-known way to describe an alternating knot or link as a plane graph, known as its Tait graph.

Wednesday, March 28, 2018 — 4:00 PM EDT

## Continuous Optimization Seminar - Matthew William Slavin

Title: Tractable Approximations to Robust Conic Optimization Problems (paper by D. Bertsimas, M. Sim)

 Speaker: Matthew William Slavin Affiliation: University of Waterloo Room: MC 5479

Abstract: We review the paper listed in the title of this talk. In the paper, Bertsimas and Sim propose a relaxed robust counterpart for general conic optimization problems

Tuesday, March 27, 2018 — 4:00 PM EDT

## Cryptography - Edward Knapp

Title: Implementing cryptography at scale

 Speaker: Edward Knapp Affiliation: Google Room: MC 5501

Abstract: Many cryptographic primitives have rough edges which make them difficult to use properly (by both experts and non-experts).

Monday, March 26, 2018 — 1:00 PM EDT

## Cryptography- Luis Ruiz

Title: LWE Part 2: A quantum discrete Gaussian sampler.

 Speaker: Luis Ruiz Affiliation: University of Waterloo Room: MC 6486

Abstract: In this talk we will describe how a (quantum) Gaussian sampler could be constructed if we had access to a solver of a decoding problem.

Friday, March 23, 2018 — 3:30 PM EDT

## Tutte Colloquium - Padraig O Cathain

Title: Morphisms of complex Hadamard matrices

 Speaker: Padraig O Cathain Affiliation: Worcester Polytechnic University Room: MC 5501

Abstract:

Let M be a matrix with complex entries of unit norm. A well-known theorem of Hadamard bounds the magnitude of the determinant of M as a function of its dimension, and M is a complex Hadamard matrix if M meets Hadamard's bound with equality.

Thursday, March 22, 2018 — 3:30 PM EDT

## Graphs and Matroids Seminar - Kazuhiro Nomoto

Title: Excluding claws in binary matroids

 Speaker: Kazuhiro Nomoto Affiliation: University of Waterloo Room: MC 5479

Abstract: A simple binary matroid is claw-free if no rank-3 flats are independent. We discuss an exact structure theorem for such matroids and sketch its proof. This is joint work with Peter Nelson.

## Pages

### January 2018

S M T W T F S
31
1
2
3
4
5
6
7
8
9
10
11
13
14
16
19
20
21
23
27
28
30
1
2
3
1. 2020 (55)
1. July (5)
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)
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)
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)