COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Partitions with Modular FormsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact zl474. A very old question in combinatorics: for n>1, what can we say about p(n), the number of partitions of n? In 1919, Ramanujan proved that p(5n-1) is always divisible by 5, part of a collection of results known as Ramanujan’s congruences. In this talk, we try to explore (a bit) the realm of modular forms and how these functions allow us to obtain unexpected number theoretic and combinatorial results. We will go through the proof sketch of one of the theorems, possibly with other unexpected formulae along the way! This talk is part of the The Archimedeans series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsChemSoc - Cambridge Chemistry Society Cambridge University Commonwealth Society CUPORTSSOther talksNonlocal quadratic forms with visibility constraint (joint work with Moritz Kassmann) Investigating BOAS in different brachycephalic breeds Harnessing cancer patients’ own immune system to control disease. Leukocyte dynamics in lung metastasis Fractional Differential Equations Arising from Stochastic Dynamical Systems Episodic Memory: Some stimulating findings |