Peter PauleAffiliation: RISC, J. Kepler University, Linz Email: Peter.Paule@risc.unilinz.ac.at Title Of Talk: Alladi, GoellnitzGordon, and Computer Algebra Abstract: As a byproduct of his recent work on partitions with nonrepeating odd parts, Krishna Alladi derived an elegant modular relation in a natural combinatorial setting. Analytically this relation states the equality of an etaquotient with $G(q^2)q H(q^2)$, where $G(q)$ and $H(q)$ are the functions describing the GoellnitzGordon partitions. Taking this identity as a starting point, the talk describes recent algorithmic developments in connection with modular functions. A major general tool emerged from Radu's work on his RamanujanKolberg package, namely a computer algebra algorithm to compute suitable presentations of subalgebras. Applications related to modular functions concern computerassisted proving and discovery of $q$series and $q$product identities. Finally, along with a new proof of Alladi's modular relation, further possible algorithmic developments are discussed. The material of this talk arose in joint work with Silviu Radu. WARNING: This page contains MATHJAX
Last update made Mon Feb 15 11:31:59 PST 2016.
