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
Geometry and Topology Seminar
Siyuan Lu, McMaster University
Interior C^2 estimate for Hessian quotient equation
In this talk, we will first review the history of interior C^2 estimates for fully nonlinear equations. As a matter of fact, very few equations admit this property, not even the Monge-Ampère equation in dimension three or above. We will then present our recent work on interior C^2 estimate for Hessian quotient equation. We will discuss the main idea behind the proof. If time permits, we will also discuss the Pogorelov-type interior C^2 estimate for Hessian quotient equation and its applications.
MC 5417
|
|
Computability Learning Seminar
Michael Gregory University of Waterloo,
Computability Relative to Random Sets (2)
Now that we have covered the required background, we begin discussion on 1-random sets and how randomness interacts with computable reducibility. Several fundamental results are discussed including Kučera's Theorem which states that if a 1 random set is Turing reducible to a c.e. Set, then that set is Turing Equivalent to 0'. We then cover the Space Lemma which is used in the proof of Kučera Gác's Theorem which establishes that every set is weak truth-table reducible to a 1-random set.
MC 5403
Number Theory Seminar
Stephen Melczer University of Waterloo,
Analytic Combinatorics in One and Several Variables
The field of analytic combinatorics develops effective methods to compute the asymptotic behaviour of combinatorial sequences from analytic properties of their generating functions. This talk surveys the classical methods of analytic combinatorics and details the newer area of analytic combinatorics in several variables (ACSV), which handles multivariate sequences and their multivariate generating functions. Applications to several areas of mathematics and computer science, including number theory, will be discussed. This talk will be complemented by a presentation of Erica Liu on January 27 describing some recent progress on new approaches to ACSV.
MC 5479