We are home to 30 faculty, four staff, approximately 60 graduate students, several research visitors, and numerous undergraduate students. We offer exciting and challenging programs leading to BMath, MMath and PhD degrees. We nurture a very active research environment and are intensely devoted to both ground-breaking research and excellent teaching.
News
Pure Math Department celebrates outstanding Teaching by a Graduate Student and Teaching Assistants at awards ceremony
On November 3, the department of Pure Mathematics held its Graduate Teaching and Teaching Assistant Awards Ceremony, an event that celebrates the accomplishments of its remarkable graduate students
53rd annual COSY conference a success
More than 100 researchers and students from across Canada and around the world attended the 53rd annual Canadian Operator Algebras Symposium (COSY), which took place from May 26-30 at the University of Waterloo.
Pure Math Department celebrates undergraduate achievement at awards tea
On March 24, the department of Pure Mathematics held its annual Undergraduate Awards Tea, an event that celebrates the accomplishments of its remarkable undergraduate students.
Events
Differential Geometry Working Seminar
Benoit Charbonneau, University of Waterloo
Invariant connections and Wang’s theorem
In this working seminar, we will study the classification result for invariant connections on principal bundles on homogeneous spaces proved by Hsien-Chung Wang in 1958 and learn, to paraphrase Gonçalo Oliveira, some useful facts on invariant connections.
MC 4058
Algebraic Geometry Seminar
Matthew Satriano, University of Waterloo
An introduction to toric stacks
Toric stacks are a tractable subclass of stacks due to their combinatorial structure. They can serve as an introduction to stacks in the same way that toric varieties can be an introduction to schemes. We will show how one can gain insight into the geometry of toric stacks with simple pictures of fans and marked points.
MC 5403
Computability Learning Seminar
Beining Mu, University of Waterloo
Sacks' Splitting Theorem
In this talk, I will present Sacks’ Splitting Theorem, which states that every nonzero computably enumerable degree can be split into the join of two strictly lower computably enumerable degrees, as an example of finite injury priority argument. I will discuss two different proofs of the theorem, one of which is the classical way of how people think about finite injury arguments, while the other is a modern way of presenting a priority argument where a priority tree is involved.
MC 5403