## 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 tagged with Current students

Thursday, July 9, 2020 — 2:30 PM EDT

## Algebraic Combinatorics Seminar - Olya Mandelshtam

Title: Formulas for Macdonald polynomials arising from the ASEP

 Speaker: Olya Mandelshtam Affiliation: Brown University Zoom: Contact Karen Yeats

Abstract:

The asymmetric simple exclusion process (ASEP) is a one-dimensional model of hopping particles that has been extensively studied in statistical mechanics, probability, and combinatorics. It also has remarkable connections with orthogonal symmetric polynomials in many variables such as Macdonald and Koornwinder polynomials.

Friday, July 10, 2020 — 3:30 PM EDT

## Tutte Colloquium - Felix Leditzky

Title: Number-theoretic methods in quantum computing

 Speaker: Felix Leditzky Affiliation: University of Waterloo Zoom: Please email Emma Watson

Abstract:

Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. The original teleportation protocol is an exact protocol and amazingly simple, but it requires a non-trivial correction operation to make it work. Port-based teleportation (PBT) is an approximate variant of teleportation with a simple correction operation that renders the protocol unitarily covariant.

Monday, July 13, 2020 — 11:30 AM EDT

## Algebraic Graph Theory Seminar - Sebastian Cioaba

Title: On the flip graph on perfect matchings of complete graphs and sign reversal graphs

 Speaker: Sebastian Cioaba Affiliation: University of Delaware Zoom: Contact Soffia Arnadottir

Abstract:

In this talk, we study the flip graph on the perfect matchings of a complete graph of even order. We investigate its combinatorial and spectral properties including connections to the signed reversal graph and we improve a previous upper bound on its chromatic number.

Friday, July 17, 2020 — 1:30 PM EDT

Title: Two unsolved problems: Birkhoff--von Neumann graphs and PM-compact graphs

 Speaker: Nishad Kothari Affiliation: CSE Department, Indian Institute of Technology Madras Zoom: Contact Sharat Ibrahimpur

Abstract:

A well-studied object in combinatorial optimization is the {\it perfect matching polytope} $\mathcal{PMP}(G)$ of a graph $G$ --- the convex hull of the incidence vectors of all perfect matchings of $G$. A graph $G$ is {\it Birkhoff--von Neumann} if $\mathcal{PMP}(G)$ is characterized solely by non-negativity and degree constraints, and $G$ is {\it PM-compact} if the combinatorial diameter of $\mathcal{PMP}(G)$ equals one.

Friday, July 17, 2020 — 3:30 PM EDT

## Tutte Colloquium - Shachar Lovett

Title: Point Location and Active Learning - Learning Halfspaces Almost Optimally

 Speaker: Shachar Lovett Affiliation: UC San Diego Zoom: Please email Emma Watson

Abstract:

The point location problem is a central problem in computational geometry. It asks, given a known partition of R^d by n hyperplanes, and an unknown input point, to find the cell in the partition to which the input point belongs. The access to the input is via linear queries. A linear query is specified by an hyperplane, and the result of the query is which side of the hyperplane the input point lies in.

### July 2020

S M T W T F S
28
29
30
1
4
5
7
8
11
12
14
15
16
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
1. 2020 (58)
1. July (8)
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)