How to implement a modular form (Q651876): Difference between revisions

The computation of modular forms is of current interest for modular forms of higher rank and, for example, has led to a number of conjectures that are analogous to what happens in the case of classical modular forms (e.g., the work of \textit{C. Poor} and \textit{D. S. Yuen} on the Paramodular Conjecture [J. Korean Math. Soc. 50, No. 2, 445--464 (2013; Zbl 1329.11042)]). Whereas in the case of classical modular forms, modular symbols provide a general (and efficient) way to compute Fourier expansions, for many other kinds of modular forms there is no such thing. In this paper the author presents and describes an answer to the following question: How does one represent a modular form in as compact a way as possible by taking advantage of the invariance of the coefficients of the modular form? By ``modular form'' the author means something very general: in particular, the implementation he has developed can be used to represent vector-valued elliptic modular forms, scalar- and vector-valued Siegel (para)modular forms, Hermitian modular forms, Jacobi modular forms, among others. The construction is based on category theory and the common object he uses to represent a modular form is something the author calls an ``equivariant monoid power series''. The framework in which this is implemented can be downloaded from \url{https://github.com/martinra/psage}. The paper includes some examples of how to use the framework.