@**thesis**{RISC6512,author = {N. Smoot},

title = {{Computer Algebra with the Fifth Operation: Applications of Modular Functions to Partition Congruences}},

language = {english},

abstract = {We give the implementation of an algorithm developed by Silviu Radu to compute examples of a wide variety of arithmetic identities originally studied by Ramanujan and Kolberg. Such identities employ certain finiteness conditions imposed by the theory of modular functions, and often yield interesting arithmetic information about the integer partition function $p(n)$, and other associated functions. We compute a large number of examples of such identities taken from contemporary research, often extending or improving existing results. We then use our implementation as a computational tool to help us achieve more theoretical results in the study of infinite congruence families. We finally describe a new method which extends the existing techniques for proving partition congruence families associated with a genus 0 modular curve.},

year = {2020},

translation = {0},

school = {Research Institute for Symbolic Computation, JKU Linz},

length = {224},

type = {phdthesis}

}