Events

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Embedding Lattices into the Computably Enumerable Degrees"

The question of which finite lattices can be embedded into the c.e.
degrees first arose with the construction of a minimal pair by Yates,
and independently by Lachlan, showing the 4 element Boolean algebra
can be embedded. This result was rapidly generalised to show any
finite distributive lattice can also be embedded. For non-distributive
lattices, the situation is more complicated.

Sam Harris, Pure Mathematics, University of Waterloo

"Kadison Similarity Problem and the Similarity Degree"

Zack Cramer, Pure Mathematics, University of Waterloo

"Approximation of Normal Operators by Nilpotents in Purely Infinite $C^*$-algebras"

Ehsaan Hossain, Pure Mathematics, University of Waterloo

"The Algebraic Kirchberg--Phillips Conjecture"

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Embedding Lattices in the Computably Enumerable Degrees (continued)"

This talk is a continuation of one given August 6th.

Jim Haley, Pure Mathematics, University of Waterloo

"Strongly Reductive Operators and Operator Algebras"