Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 5198884567, ext 33038
PDF files require Adobe Acrobat Reader.
Sun  Mon  Tue  Wed  Thu  Fri  Sat 

28

29

30

31

3








4

10





11

12

13

17







18

19

20

21

22

23

24








25

27

28

1

2

3








Title: On Pretty Good State Transfer, Entanglement, and Spin Chains
Speaker: Christopher van Bommel Affiliation: University of Waterloo Room: MC 6486Abstract:
We discuss the Vieira and Rigolin paper “Almost perfect transport of an entangled twoqubit state through a spin chain”,
Title: Polynomial systems: Graphical structure, Geometry, and Applications
Speaker: Diego Cifuentes Affiliation: MIT Room: MC 5501Abstract:
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.
Title: ALBANIS: A brief overview of LatticeBased NIST Submissions
Speaker: Luis Ruiz Affiliation: University of Waterloo Room: MC 6486Abstract:
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).
Title: Algorithms and complexity for quantum advantage
Speaker: David Gosset Affiliation: IBM  T.J. Watson Research Center Room: QNC 0101Abstract:
There is strong evidence that a sufficiently large faulttolerant 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?
Title: An Introduction to Quantum Graphs, Chromatic Numbers and Lovász Inequalties
Speaker: Arthur Mehta Affiliation: Pure Math  University of Waterloo Room: MC 5501Abstract:
Quantum graph theory, also known as noncommutative graph theory, is an operator system generalization of graph theory. Quantum graphs were first used to extend the notion of oneshotzeroerror capacity of a "Noisy Channel" to "Quantum Channels".
Title: Robust Convex Optimization
Speaker: Nargiz Kalantarova Affiliation: University of Waterloo Room: MC 5479Abstract:
We continue our study of convex optimization problems with uncertain data by discussing the paper by BenTal and Nemirovski, 'Robust Convex Optimization'.
Title: Constructing Graphs PseudoSimilar Vertices
Speaker: Cathy Wang Affiliation: University of Waterloo Room: MC 6486Abstract:
Let G be a graph. Let a and b be vertices in G, then a and b are pseudosimilar if G\a is isomorphic to G\b, but there's no automorphism of G that maps a onto b.
Title: An introduction to vertex minors
Speaker: Jim Geelen Affiliation: University of Waterloo Room: MC 5479Abstract:
This introductory lecture on vertex minors of graphs will highlight the similarities and differences with minors of graphs. We will also discuss the main conjectures relating to vertex minors.
Title: PostQuantum Groupbased Cryptography
Speaker: Delaram Kahrobaei Affiliation: New York University Room: MC 5501Abstract:
The National Security Agency (NSA) in August 2015 announced plans to transition to postquantum algorithms
Title: Comprehensive robust counterparts of uncertain problems
Speaker: Sina Rezazadeh Affiliation: University of Waterloo Room: MC 5479Abstract:
We continue our study of Robust Optimization by discussing the paper by BenTal, Boyd and Nemirovski, "Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems."
Title: Mixing in DiscreteTime Quantum Walks
Speaker: Harmony Zhan Affiliation: University of Waterloo Room: MC 6486Abstract:
Discretetime quantum walks are building blocks for quantum algorithms. There are some parameters of a quantum walk that affect the performance of a quantum algorithm, such as the (timeaveraged) limiting distribution and the mixing time.
Title: An introduction to gammoids
Speaker: Rutger Campbell Affiliation: University of Waterloo Room: MC 5479Abstract:
A gammoid is a matroid that is defined via vertex connectivity in a graph.
Title: Tangent Lines and the equation 28 = 7 × 4
Speaker: Yoav Len Affiliation: University of Waterloo Room: MC 5501Abstract:
I will discuss combinatorial aspects of tangent lines to curves and planar graphs. In algebraic geometry, every smooth plane curve has finitely many lines that are tangent to it at two separate points.
Title: Random Networks: Enumeration, Generation, and Universality
Speaker: Pu (Jane) Gao Affilliation: Monash University Room: DC 1304Abstract:
Large networks appear in almost all branches of the sciences and in everyday life, and they are often modeled by random graphs. Among the various random graph models, random graphs with specified degrees are particularly important in modelling and analyzing realworld networks.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 5198884567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Office of Indigenous Relations.