Modular Forms, A Computational Approach

Covers algorithms for computing spaces of modular forms and provides a rigorous foundation for the specific algorithms used.

**Tag(s):**
Computer Aided Mathematics

**Publication date**: 13 Feb 2007

**ISBN-10**:
0821839608

**ISBN-13**:
9780821839607

**Paperback**:
268 pages

**Views**: 16,449

**Type**: N/A

**Publisher**:
American Mathematical Society

**License**:
GNU Free Documentation License

**Post time**: 03 Sep 2006 12:10:42

Modular Forms, A Computational Approach

Covers algorithms for computing spaces of modular forms and provides a rigorous foundation for the specific algorithms used.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License".

Click**here** to read the full license.

Click

Terms and Conditions:

Book Excerpts:

This is a book about algorithms for computing with modular forms. It was written for a graduate course at Harvard University. This book is meant to answer the question "How do you compute spaces of modular forms", which theoretical mathematicians often asked, and to provide a rigorous foundation for the specific algorithms used by the author, some of which have until now never been formally stated or proven to be correct.

The book tries to find the best ways to compute with classical modular forms for congruence subgroups of SL2(Z), and how to implement most of these algorithms. Much of this work has involved turning formulas and constructions burried in books and papers into precise computable recipes, then testing these in many cases and eliminating subtle inaccuracies (published theorems often contain very small mistakes that are greatly magnified when implemented and run on a computer). The goal of this book is to explain the results, and also describe unsolved problems whose solution would move the theory forward.

At the time this book was written, there were no other books on computing with modular forms, the closest work being Cremona's book, which is about computing with elliptic curves, and Cohen's book about algebraic number theory. This field is not mature, and there are some missing details and potential improvements to many of the algorithms, which the reader might fill in, and which would be greatly appreciated by other mathematicians. Also, it seems that nobody has tried to analyze the formal complexity of any of the algorithms in this book (the author intends to do this as he writes the book) again this is somewhere the reader might contribute.

Intended Audience:

The reader is not assumed to have prior exposure to modular forms, but should have a firm grasp of abstract algebra, and be familiar with algebraic number theory, geometry of curves, algebraic topology of Riemann surfaces, and complex analysis. For Chapter 10, the reader should be familiar with the Python programming language.

William Stein wrote:The text of this book is licensed under the GNU Free Documentation License, Version 1.2, November 2002. This means that you may freely copy this book. For the precise details, see the Appendix.

Book Excerpts:

This is a book about algorithms for computing with modular forms. It was written for a graduate course at Harvard University. This book is meant to answer the question "How do you compute spaces of modular forms", which theoretical mathematicians often asked, and to provide a rigorous foundation for the specific algorithms used by the author, some of which have until now never been formally stated or proven to be correct.

The book tries to find the best ways to compute with classical modular forms for congruence subgroups of SL2(Z), and how to implement most of these algorithms. Much of this work has involved turning formulas and constructions burried in books and papers into precise computable recipes, then testing these in many cases and eliminating subtle inaccuracies (published theorems often contain very small mistakes that are greatly magnified when implemented and run on a computer). The goal of this book is to explain the results, and also describe unsolved problems whose solution would move the theory forward.

At the time this book was written, there were no other books on computing with modular forms, the closest work being Cremona's book, which is about computing with elliptic curves, and Cohen's book about algebraic number theory. This field is not mature, and there are some missing details and potential improvements to many of the algorithms, which the reader might fill in, and which would be greatly appreciated by other mathematicians. Also, it seems that nobody has tried to analyze the formal complexity of any of the algorithms in this book (the author intends to do this as he writes the book) again this is somewhere the reader might contribute.

Intended Audience:

The reader is not assumed to have prior exposure to modular forms, but should have a firm grasp of abstract algebra, and be familiar with algebraic number theory, geometry of curves, algebraic topology of Riemann surfaces, and complex analysis. For Chapter 10, the reader should be familiar with the Python programming language.

Tweet

About The Author(s)

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Microsoft .NET
Rexx
Perl
PHP
Python
R
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors