Modular Form Computations

Modular Form Computations is a computational methodology in Computational Number Theory that specifically involves the algorithmic construction, manipulation, and analysis of modular forms and their arithmetic invariants through finite approximations, Fourier expansions, Hecke operators, and associated L-functions.

1.1K

Publications

47.9K

Citations

1.1K

Authors

536

Institutions

Publications per year

2017–2026

111

Authors

1.1K

  1. GS
    Goro Shimura

    Princeton University, United States

    18 publications · 4.4K citations

    16

    h-index

  2. WK
    Winfried Kohnen

    Heidelberg University, Germany

    17 publications · 1.4K citations

    13

    h-index

  3. JH
    Jan Hendrik Bruinier

    Technische Universität Darmstadt, Germany

    13 publications · 583 citations

    13

    h-index

  4. KB
    Kathrin Bringmann

    University of Cologne, Germany

    12 publications · 540 citations

    12

    h-index

  5. KO
    Ken Ono

    University of Wisconsin–Madison, United States

    13 publications · 881 citations

    11

    h-index

1–5 of 1.1K

Venues

  1. Inventiones mathematicae

    43 publications · 5.8K citations

    39

    h-index

  2. Journal of Number Theory

    55 publications · 1.3K citations

    22

    h-index

  3. Duke Mathematical Journal

    DMJ · 36 publications · 1.7K citations

    22

    h-index

  4. Annals of Mathematics

    24 publications · 3.4K citations

    21

    h-index

  5. Transactions of the American Mathematical Society

    TRAN · 34 publications · 1.5K citations

    20

    h-index

1–5