Algebraic Graph Theory Seminar - Harmony Zhan
Title: Discrete quantum walks, embeddings and designs
Speaker: | Harmony Zhan |
Affiliation: | York University |
Room: | MC 5479 |
Abstract:
We construct a quantum walk from an embedding of a graph.
Title: Discrete quantum walks, embeddings and designs
Speaker: | Harmony Zhan |
Affiliation: | York University |
Room: | MC 5479 |
Abstract:
We construct a quantum walk from an embedding of a graph.
Title: Perfect state transfer on Hadamard diagonalizable graphs
Speaker: | Xiaohong Zhang |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
A (weighted) graph whose Laplacian matrix is diagonalizable by a Hadamard matrix is said to be Hadamard diagonalizable.
Title: Boundary measurement and sign variation in real projective space
Speaker: | John Machacek |
Affiliation: | York University |
Room: | MC 5417 |
Abstract:
Title: Sublinear separators in intersection graphs of convex shapes
Speaker: | Rose McCarty |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
A balanced separator of an n-vertex graph is set of vertices whose deletion leaves only components of size at most 2n/3.
Title: Cutting a square into triangles of equal area
Speaker: | Hayley Reid |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
Suppose you are given a square and asked to cut it into n triangles of equal area. If n is even the problem is almost trivial, but when n is odd the problem becomes much harder.
Title: Perfect state transfer on Cayley graphs
Speaker: | Soffia Arnadottir |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
Perfect state transfer on Cayley graphs
Title: Interpolated versions of the Central Limit Theorem, and crossings of pair-partitions
Speaker: | Alexandru Nica |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
Title: Edge-maximal graphs on surfaces
Speaker: | James Davies |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
It is straightforward to show that, with the exception of small complete graphs, every edge-maximal planar graph triangulates the plane.
Title: Maximizing non-monotone submodular functions
Speaker: | Zishen Qu |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
Optimization of non-monotone submodular functions has applications in the maximum cut and maximum directed cut problems for graphs.
Title: A Quantum Query Complexity Trichotomy for Regular Languages
Speaker: | Luke Schaeffer |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
We consider the quantum query complexity of regular languages and discover a surprising trichotomy: each regular language has query complexity either Theta(1), ~Theta(sqrt(n)) or Theta(n).