![]() |
![]() |
#1 |
(loop (#_fork))
Feb 2006
Cambridge, England
2·3,191 Posts |
![]()
I've just bought, and am quite enjoying, Lloyd Kilford's "Modular Forms: A Classical and Computational Introduction", of which a new edition came out last week.
I really like the focus on how finite-dimensionality results both make modular forms practical to compute with, and are responsible for lots of the wonderful identities because, once you've demonstrated both sides are a modular form of an appropriate weight and level, you have a small finite (or, at weight twelve and level one, a trivial) computation to show that they're equal. |
![]() |
![]() |
![]() |
#2 | |
Nov 2003
22×5×373 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Representation by quadratic forms | Raman | Math | 0 | 2013-01-04 00:29 |
How do I get comprehensible MPI behaviour | fivemack | Factoring | 3 | 2011-09-02 21:04 |
Recovering Fourier coefficients of modular forms | Robert Holmes | Math | 2 | 2010-09-22 22:10 |
Minimum primes of various forms database? | jasong | Information & Answers | 1 | 2007-11-01 01:58 |
Unreserving exponents via manual forms or not? | Boulder | PrimeNet | 3 | 2007-05-29 10:01 |