Research Talk: Holonomic Differential Equations and Modular Forms

Description

The study of holonomic functions and sequences satisfying linear differential and difference equations, respectively, with polynomial coefficients has roots tracing back to the time of Gauss (at least). Tools to assist this study, including methods from computer algebra, have become fundamental for the modern theory of enumerative combinatorics; see, e.g., the work of Stanley and Zeilberger. Also tracing back to the time of Gauss (at least) are highly non-holonomic objects: modular functions and modular forms with q-series representations arising also as generating functions of partitions of various kinds. Using computer algebra, the talk connects these two different worlds. Applications concern partition congruences, Fricke–Klein relations, irrationality proofs a la Beukers, or approximations to pi studied by Ramanujan and the Borweins. As a major ingredient to a "first guess, then prove" strategy, a new algorithm for proving differential equations for modular forms is used. The results presented arose in joint work with Silviu Radu (RISC).

Period	18 May 2022
Event title	NSF/CBMS Research Conference Ramanujan's ranks, Mock Theta Functions, and Beyond
Event type	Conference
Location	United StatesShow on map