The C&O department has 36 faculty members and 60 graduate students. We are intensely research oriented and hold a strong international reputation in each of our six major areas:
- Algebraic combinatorics
- Combinatorial optimization
- Continuous optimization
- Cryptography
- Graph theory
- Quantum computing
Read more about the department's researchÌýto learn of our contributions to the world of mathematics!
News
Laura Pierson wins Governor General's Gold Medal
The Governor General’s Gold Medal is one of the highest student honours awarded by the University of À¶Ý®ÊÓƵ.
Sepehr Hajebi wins Graduate Research Excellence Award, Mathematics Doctoral Prize, and finalist designation for Governor General's Gold Medal
The Mathematics Doctoral PrizesÌýare given annually to recognize the achievement of graduating doctoral students in the Faculty of Mathematics. TheÌýGraduate Research Excellence Awards are given to students who authored or co-authored an outstanding research paper.
Three C&O faculty win Outstanding Performance Awards
The awards are given each year to faculty members across the University of À¶Ý®ÊÓƵ who demonstrate excellence in teaching and research.
Events
Algebraic and enumerative combinatorics seminar-Karen Yeats
Title:Sizes of witnesses in covtree
| Speaker | Karen Yeats |
| Affiliation | University of À¶Ý®ÊÓƵ |
| Location | MC 5479 |
´¡²ú²õ³Ù°ù²¹³¦³Ù:ÌýHere is a purely combinatorial problem that arose in causal set theory.Ìý Let {P_1, ... , P_k} be distinct unlabelled posets all with n elements.Ìý Suppose there is a poset Q such that {P_1, ... , P_k} is exactly the set of downsets of Q of size n up to isomorphism. Given n and k can we give a tight upper bound on the minimum size of such a Q? As with newspaper headlines, the answer to the question is no, at least for the moment, but I'll explain what we do know.Ìý Joint work with Jette Gutzeit, Kimia Shaban, and Stav Zalel.
There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm,
Tutte colloquium-Stephen Melczer
Title:Automated Sequence Asymptotics
| Speaker: | Stephen Melczer |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Location: | MC 5501 |
Abstract:Computing with any sort of object requires a way of encoding it on a computer, which poses a problem in enumerative combinatorics where the objects of interest are (infinite) combinatorial sequences. Thankfully, the generating function of a combinatorial sequence often satisfies natural algebraic/differential/functional equations, which can then be viewed as data structures for the sequence. In this talk we survey methods to take a sequence encoded by such data structures and automatically determine asymptotic behaviour using techniques from the field of analytic combinatorics. We also discuss methods to automatically characterize the asymptotic behaviour of multivariate sequences using analytic combinatorics in several variables (ACSV). The focus of each topic will be rigorous algorithms that have already been implemented in computer algebra systems and can be easily used by anyone.
Ìý