Welcome to Mathematics
The University of Waterloo's Faculty of Mathematics has the largest concentration of mathematical and computer science talent in the world. Perhaps the best testimony to Waterloo's standing and exceptional reputation is the quality and many achievements of the Faculty's teachers, researchers, alumni and students. With more than 8,000 graduate and undergraduate students, 240 full-time professors, and 300 courses in mathematics, statistics and computer science, the Faculty is a powerhouse of discovery and innovation.
News
- May 16, 2018Students win $25,000 at the Waterloo Data Open
Photography by Jon White
- May 14, 2018Professor Maura Grossman’s expertise in legal search sought to assist in privilege review of documents in US v. Cohen case
Although federal prosecutors in the United States had originally objected to the appointment of an independent person to review materials the FBI seized from Michael Cohen, President Donald Trump’s personal lawyer, they officially withdrew their opposition.
- May 11, 2018ACM recognizes Professor Khuzaima Daudjee as a 2018 Senior Member
The Association for Computing Machinery has named David R. Cheriton School of Computer Science Professor Khuzaima Daudjee an ACM Senior Member.
Events
- May 26, 2018You@Waterloo Day - admitted students only
Students who have received an Offer of Admission to Waterloo, and their family, are invited to join us on this special visit day to meet with current students, speak with professors, and tour the residences.
- June 1 to 2, 2018EQUALS • Excellence and Quality in Academic Life
Are you a graduate student, postdoc or young scholar considering an academic career? Join us to explore the spectrum of pathways of academic success with an explicit focus on gender equity and its intersections with other identity markers.
- June 4, 2018Public Lecture: Infinite Games
Antonio Montalban, University of California - Berkeley
Infinite two-player games have been a very useful tool to prove many results in logic and other areas. What makes them fascinating to computability theorists is that winning strategies can be extremely complex even for simple games.
