Abstract
In the first part of this work (to appear in Mathematics of Computation , 1987) it was shown that the nonsymmetric modular forms for if can be effectively generated by Hecke transformations on the symmetric forms, which are better known and more easily constructed. We show that the nonsymmetric forms need not be known in advance, indeed the polynomial equations defining them in terms of symmetric forms can be derived by symbolic manipulation. The computation was performed using MACSYMA on a DEC VAX computer and came close to the limit of the machine's speed and capacity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
