Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
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 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 — 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 Γ.
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.
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.