Browsing Theses by Subject "enumerative combinatorics"
Now showing items 1-2 of 2
-
Computing the Residue Class of Partition Numbers
(University of Waterloo, 2016-09-14)In 1919, Ramanujan initiated the study of congruence properties of the integer partition function $p(n)$ by showing that $$p(5n+4) \equiv 0 \mod{5}$$ and $$p(7n+5) \equiv 0 \mod{7}$$ hold for all integers $n$. These results ... -
On Enumerative Structures in Quantum Field Theory
(University of Waterloo, 2020-07-13)This thesis addresses a number of enumerative problems that arise in the context of quantum field theory and in the process of renormalization. In particular, the enumeration of rooted connected chord diagrams is further ...