Research

### Explicit computations of Hida families via overconvergent modular symbols

In Pollack and Stevens (Ann Sci Éc Norm Supér 44(1):1–42, 2011), efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of *p*-adic *L*-fun...

Research in Number Theory 2016 2:25

Published on: 14 November 2016