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 tagged with Seminar

Friday, July 30, 2021 — 3:30 PM EDT

Title: Macdonald polynomials and the multispecies zero range process

Speaker: Olya Mandelshtam
Affiliation: University of Waterloo
Zoom: Please email Emma Watson

Abstract:

Over the last couple of decades, the theory of special functions and symmetric functions have found unexpected connections to various interacting particle systems. Macdonald polynomials are a family of symmetric functions that are known to have remarkable connections to a well-studied particle model called the ASEP. It is natural to ask whether the modified Macdonald polynomials can be obtained using a combinatorial gadget for some other particle system.

Monday, August 2, 2021 — 11:30 AM EDT

Title: The average search probability in a quantum walk with an oracle

Speaker: Harmony Zhan
Affiliation: York University
Zoom: Contact Soffia Arnadottir

Abstract:

Some quantum search algorithms can be viewed as discrete-time quantum walks on graphs with a marked vertex a. In such a walk, the oracle is part of the transition matrix, the target state is the characteristic vector of the outgoing arcs of a, and the initial state is the all-ones vector.

Friday, August 6, 2021 — 3:30 PM EDT

Title: The size Ramsey numbers of graphs and hypergraphs

Speaker: Liana Yepremyan
Affiliation: London School of Economics
Zoom: Please email Emma Watson

Abstract:

The s-colour size-Ramsey number of a graph ( hypergraph) H is the minimum number of edges in a graph (hypergraph) G whose every s-edge-colouring contains a monochromatic copy of H. While the   study of size Ramsey numbers for graphs  goes back to 70's to the work of Erdos, Faudree, Rousseau and Schelp, the systematic study of these numbers for hypergraphs have been initiated much more recently in 2017  by Dudek, La Fleur, Mubayi, and Rödl. In this talk we will present the current known results in the literature, and some recent progress we have made on several questions in the area.

Wednesday, August 11, 2021 — 10:00 AM EDT

Title: TBA

Speaker: Jacek Gondzio
Affiliation: University of Edinburgh
Zoom: Register through The Fileds Institute

Abstract: TBA

Wednesday, August 11, 2021 — 11:00 AM EDT

Title: HiGHS: Theory, software and Impact

Speaker: Julian Hall
Affiliation: University of Edinburgh
Zoom: Register through The Fields Institute

Abstract:

Since Dantzig formulated the simplex algorithm in 1947, the widespread need to solve linear optimization problems drove the development of algorithmic and computational techniques for decades, yielding several high performance commercial and open source software systems. This talk will focus on the Edinburgh-based work on solving large scale sparse linear programming problems that underpins the high performance open source linear optimization software, HiGHS, the challenges of developing such software, and the Impact that it has achieved.

Friday, August 13, 2021 — 3:30 PM EDT

Title: Dyadic Linear Programming

Speaker: Ahmad Abdi
Affiliation: London School of Economics
Zoom: Please email Emma Watson

Abstract:

Most linear programming solvers use fixed-precision floating points to approximate the rational numbers. Though successful on most real-world instances, solvers sometimes run into serious issues when carrying out sequential floating-point arithmetic, due to compounded error terms. This practical limitation leads to the following theoretical problem:

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