Please login to be able to save your searches and receive alerts for new content matching your search criteria.
One major theme of this paper concerns the expansion of modular forms and functions in terms of fractional (Puiseux) series. This theme is connected with another major theme, holonomic functions and sequences. With particular attention to algorithmic aspects, we study various connections between these two 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 introduced.
In this paper, we prove new results which make it possible to vastly simplify solution of the problem of Nathanson concerning the enlargement of support bases and thus of the corresponding semigroup supports of rational function solutions to the quantum functional equations arising from multiplication of quantum integers. In particular, we establish a certain quantum equivalence relation on the set of all prime numbers which encodes the symmetry of these solutions and thus solve a problem which simplify in crucial ways the criteria for the problem posed by Nathanson concerning extensions of the support bases of these solutions.
One major theme of this paper concerns the expansion of modular forms and functions in terms of fractional (Puiseux) series. This theme is connected with another major theme, holonomic functions and sequences. With particular attention to algorithmic aspects, we study various connections between these two 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 introduced.