Filter by:

Limit to events where the title matches:
Limit to events where the first date of the event:
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:
Wednesday, July 17, 2024 12:00 am - Friday, July 19, 2024 11:59 pm EDT (GMT -04:00)

Fulkerson 100

Delbert Ray Fulkerson

Fulkerson 100 is a workshop organized by the Dept. of Combinatorics & Optimization (C&O) from July 17-19, 2024 at the University of Waterloo, to celebrate Fulkerson's legacy and impact in discrete mathematics, especially in the fields of graph theory, optimization, and operations research. Fulkerson 100 will feature invited talks in graph theory, combinatorics, optimization, and theoretical computer science, given by some of the foremost researchers in these areas, as well as lightning talks and a poster session devoted to students and postdocs. By bringing together various leading researchers in discrete mathematics with junior researchers and students, the workshop aims to boost research in the areas pioneered by Fulkerson, while commemorating his vision and contributions.

Thursday, September 14, 2017 3:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - John Sinkovic

Title: Using eigenvalues to bound the independence number of a graph

Speaker: John  Sinkovic
Affiliation: University of Waterloo
Location: MC 6486


Finding a maximum independent set (or clique) in an arbitrary graph has been shown to be NP-hard.  As any independent set gives a lower bound on the independence number, determining an upper bound is usually more useful. 

Friday, September 15, 2017 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Collouium - Chris Godsil

Title: Periodic Vertices in Graphs

Speaker Chris Godsil
Affiliation: University of Waterloo
Room: MC 5501


If $X$ is a graph with adjacency matrix $A$, then any question about the continuous quantum walk on $X$ is a question about the entries of the unitary matrices \[U(t) = \exp(itA)\]

Two pertinent questions are:

Friday, September 22, 2017 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Mike Zabrocki

Title: Symmetric group characters as symmetric functions

Speaker: Mike Zabrocki
Affiliation: York University
Room: MC 5501


The irreducible polynomial representations have Schur polynomials as characters. Similarly there is an in-homogeneous basis of symmetric functions that we call the "irreducible character basis" which are characters of irreducible symmetric group modules when the symmetric group is represented as the subgroup of permutation matrices.

Thursday, September 28, 2017 3:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Christopher van Bommel

Title: Quantum Walks and State Transfer

Speaker: Christopher van Bommel
Affiliation: University of Waterloo
Room: MC 6486


Quantum walks are the quantum analogues of classical random walks and can be used to model quantum computations. If a quantum walker starts at a vertex of a graph and after some length of time, has probability 1 of being found at a different vertex, we say there is perfect state transfer between the two vertices.

Friday, September 29, 2017 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Debbie Leung

Title: The quantum and private capacities of quantum channels, and the solution in the low-noise regime

Speaker: Debbie Leung
Affiliation: University of Waterloo
Room: MC 5501


We first summarize background on the quantum capacity of a quantum channel, and explain why we know very little about this fundamental quantity, even for the qubit depolarizing channel (the quantum analogue of the binary symmetric channel) despite 20 years of effort by the community.

Wednesday, October 4, 2017 4:30 pm - 4:30 pm EDT (GMT -04:00)

Pure Math / Combinatorics and Optimization Joint Colloquium

Title: I'll prove the Fundamental Theorem of Algebra

Speaker: Sam Kim
Affiliation: Department of Pure Math, University of Waterloo
Room: MC 5501


Gauss proved that complex polynomials always admit a root. I'll explain how he came to that conclusion and present a proof that rigorizes his argument in a nice way. You will only need to know a little vector calculus and the intermediate value theorem.