Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, January 26, 2018 9:30 am - 9:30 am EST (GMT -05:00)

Special Seminar - Sophie Spirkl

Title: Sparse graphs with forbidden induced subgraphs and the Erdos-Hajnal conjecture

Speaker: Sophie Spirkl
Affiliation: Princeton University
Room: MC 5501

Abstract:

A graph G is called H-free if it does not contain H as an induced subgraph, i.e. H cannot be obtained from G by deleting vertices. A famous conjecture due to Erdos and Hajnal states that for every graph H, there is a constant c > 0 such that in every n-vertex H-free graph G, there is a set of nc vertices that are either all pairwise adjacent or all pairwise non-adjacent.

Monday, January 29, 2018 9:30 am - 9:30 am EST (GMT -05:00)

Special Seminar - Walaa Moursi

Title: The Douglas-Rachford splitting algorithm for inconsistent minimization problems

Speaker: Walaa Moursi
Affiliation: Stanford University
Room: MC 5417

Abstract:

The Douglas--Rachford (DR) method is one of the most popular splitting methods in optimization. The method was first introduced in 1956 to numerically solve certain types of heat equations.

Friday, February 2, 2018 9:30 am - 9:30 am EST (GMT -05:00)

Special Seminar - Diego Cifuentes

Title: Polynomial systems: Graphical structure, Geometry, and Applications

Speaker: Diego Cifuentes
Affiliation: MIT
Room: MC 5501

Abstract:

Various problems in areas such as robotics, power systems, computer vision, cryptography, and chemical reaction networks, can be modeled by systems of polynomial equations, and in many cases the resulting systems have a simple sparsity structure.

Monday, February 5, 2018 1:00 pm - 1:00 pm EST (GMT -05:00)

Post-Quantum Cryptography Seminar - Luis Ruiz

Title: ALBANIS: A brief overview of Lattice-Based NIST Submissions

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

Abstract:

Now that the NIST competition is in the first round of the review process, it is our turn to take a look at the submissions (at least, briefly).

Monday, February 5, 2018 9:30 pm - 9:30 pm EST (GMT -05:00)

Seminar - David Gosset

Title: Algorithms and complexity for quantum advantage

Speaker: David Gosset
Affiliation: IBM - T.J. Watson Research Center
Room: QNC 0101

Abstract:

There is strong evidence that a sufficiently large fault-tolerant quantum computer would solve certain computational problems exponentially faster than any classical computer. How can quantum algorithms and complexity theory help guide the way forward in our current era of small and noisy quantum computers?

Tuesday, February 6, 2018 4:30 pm - 4:30 pm EST (GMT -05:00)

Joint Pure Math/C&O Seminar - Arthur Mehta

Title: An Introduction to Quantum Graphs, Chromatic Numbers and Lovász Inequalties

Speaker: Arthur Mehta 
Affiliation: Pure Math - University of Waterloo
Room: MC 5501

Abstract:

Quantum graph theory, also known as non-commutative graph theory, is an operator system generalization of graph theory. Quantum graphs were first used to extend the notion of one-shot-zero-error capacity of a "Noisy Channel" to "Quantum Channels". 

Wednesday, February 7, 2018 4:00 pm - 4:00 pm EST (GMT -05:00)

Continuous Optimization Reading Seminar - Nargiz Kalantarova

Title: Robust Convex Optimization 

Speaker: Nargiz Kalantarova
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

We continue our study of convex optimization problems with uncertain data by discussing the paper by Ben-Tal and Nemirovski, 'Robust Convex Optimization'.

Thursday, February 8, 2018 1:30 pm - 1:30 pm EST (GMT -05:00)

Algebraic Graph Theory - Cathy Wang

Title: Constructing Graphs Pseudo-Similar Vertices

Speaker: Cathy Wang
Affiliation: University of Waterloo
Room: MC 6486

Abstract:

Let G be a graph. Let a and b be vertices in G, then a and b are pseudo-similar if G\a is isomorphic to G\b, but there's no automorphism of G that maps a onto b.