# Events - July 2021

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

## Tutte Colloquium - Olya Mandelshtam

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.

Wednesday, July 28, 2021 — 10:00 AM EDT

## Optimization: Theory, Algorithms, Applications Lecture Series

Title: A primal-dual interior-point algorithm fo rnonsymmetric conic optimization

 Speaker: Erling D. Andersen Affiliation: Mosek ApS Zoom: Register through The Fields Institute

Abstract:

It is well known that primal-dual interior-point algorithms for linear optimization can easily be extended to the case of symmetric conic optimization, as shown by Nesterov and Todd (NT) in their 1997 paer about self-scaled barriers. Although many convex optimization problems can be expressed using symmetric cones then models involving for instance exponential functions do not belong to the class of symmetric conic optimization problems.

Monday, July 26, 2021 — 11:30 AM EDT

## Algebraic Graph Theory Seminar - Thomas Wong

Title: Equivalent Laplacian and Adjacency Quantum Walks on Irregular Graphs

 Speaker: Thomas Wong Affiliation: Creighton University Zoom: Contact Soffia Arnadottir

Abstract:

The continuous-time quantum walk is a particle evolving by Schrödinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems, however, the Hamiltonian is proportional to the adjacency matrix instead.

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

## Tutte Colloquium - Jon Yard

Title: Algebraic formulations of Zauner's conjecture

 Speaker: Jon Yard Affiliation: University of Waterloo Zoom: Please email Emma Watson

Abstract:

Tight complex projective 2-designs are simultaneously maximal sets of equiangular lines and minimal complex projective 2-designs. In quantum information theory, they define optimal measurements known as SIC-POVMs (Symmetric Informationally Complete Positive Operator-Valued Measures).  They are conjectured by Zauner to exist in every dimension, even as specific group orbits.  Yet, they have only so far been proven to exist in a finite-but-growing list of dimensions via exact, explicit constructions over increasingly high-degree number fields, since identified as specific class fields of real quadratic number fields.

Thursday, July 22, 2021 — 1:00 PM EDT

## Algebraic Combinatorics Seminar - Nadia Lafrenière

Title: The spectrum of the random-to-below Markov chain

 Speaker: Nadia Lafrenière Affiliation: Dartmouth College Zoom: Contact Stephen Melczer

Abstract:

The random-to-below shuffle of a deck of cards consists of removing any card randomly (with uniform probability), and inserting it anywhere below (with uniform probability). When looking at the eigenvalues of its transition matrix, they all seem to be rational and positive.

Monday, July 19, 2021 — 4:15 PM EDT

## Special SIAM Annual Meeting Session

Title: In Memoriam: Tom Coleman’s Contributions to Applied Mathematics and Optimization

 Speaker: Yuying Li, Stephen Wright, Alex Pothen, Bruce Hendrickson, Peter Forsyth, and Somayeh Moazeni Affiliation: SIAM Annual Meeting (AN21) Registration: https://www.siam.org/conferences/cm/conference/an21

Description

Monday, July 19, 2021 — 4:15 PM EDT

## Special SIAM Session - In Memoriam: Tom Coleman’s Contributions to Applied Mathematics and Optimization

Title: In Memoriam: Tom Coleman’s Contributions to Applied Mathematics and Optimization

 Speakers: Yuying Li, Stephen Wright, Alex Pothen, Bruce Hendrickson, Peter Forsyth, and Somayeh Moazeni Affiliation: SIAM Annual Meeting (AN21) Registration: https://www.siam.org/conferences/cm/conference/an21

Description:

Thomas F. Coleman—a leader in optimization and scientific computing, professor at the University of Waterloo, and a SIAM Fellow—passed away on April 20, 2021. Tom served as the Director of the Theory Center at Cornell and then as Dean of the Faculty of Mathematics at the University of Waterloo. His research spanned continuous optimization, combinatorial scientific computing, automatic differentiation, financial optimization, mathematical software, etc. In this session, his wife and collaborator, Yuying Li, and five of his students and colleagues will describe the pioneering contributions that Tom made to these fields in his research.

Monday, July 19, 2021 — 11:30 AM EDT

## Algebraic Graph Theory Seminar - Michael Tait

Title: Two conjectures on the spread of graphs

 Speaker: Michael Tait Affiliation: Villanova University Zoom: Contact Soffia Arnadottir

Abstract:

Given a graph $G$ let $\lambda_1$ and $\lambda_n$ be the maximum and minimum eigenvalues of its adjacency matrix and define the spread of $G$ to be $\lambda_1 - \lambda_n$. In this talk we discuss solutions to a pair of 20 year old conjectures of Gregory, Hershkowitz, and Kirkland regarding the spread of graphs.

Monday, July 12, 2021 — 11:30 AM EDT

## Algebraic Graph Theory Seminar - Gabor Lippner

Title: Asymptotic quantum state transfer using two loops with large weights

 Speaker: Gabor Lippner Affiliation: Northeastern University Zoom: Contact Soffia Arnadottir

Abstract:

We study the question of asymptotic transfer strength between two nodes of a graph when large weight loop edges are located at these nodes.  It turns out that the limiting strength can be exactly computed and depends only on the extended neighborhoods of the nodes.

Monday, July 5, 2021 — 11:30 AM EDT

## Algebraic Graph Theory Seminar - Lord Kavi

Title: The $k$-Independence Number

 Speaker: Lord Kavi Affiliation: University of Ottawa Zoom: Contact Soffia Arnadottir

Abstract:

An independent set, also known as a stable set or coclique, in a graph is a set of vertices, no two of which are adjacent. The size of a largest independent set is called the independence number. Two classical eigenvalue bounds on the independence number, proved using eigenvalue interlacing are the Hoffman's ratio bound and the Cvetkovi\'{c}'s inertia bound.

### August 2021

S M T W T F S
1
3
4
5
7
8
10
12
13
14
15
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
1. 2022 (146)
1. December (4)
2. November (18)
3. October (15)
4. September (11)
5. August (2)
6. July (17)
7. June (17)
8. May (10)
9. April (12)
10. March (18)
11. February (10)
12. January (13)
2. 2021 (103)
1. December (3)
2. November (7)
3. October (6)
4. September (12)
5. August (6)
6. July (10)
7. June (12)
8. May (7)
9. April (9)
10. March (13)
11. February (8)
12. January (10)
3. 2020 (119)
4. 2019 (167)
5. 2018 (136)
6. 2017 (103)
7. 2016 (137)
8. 2015 (136)
9. 2014 (88)
10. 2013 (48)
11. 2012 (39)
12. 2011 (36)
13. 2010 (40)
14. 2009 (40)
15. 2008 (39)
16. 2007 (15)