@article{34840,
  abstract     = {{In this paper we obtain a complete list of imaginary n-quadratic fields with class groups of exponent 3 and 5 under ERH for every positive integer n where an n-quadratic field is a number field of degree 2ⁿ represented as the composite of n quadratic fields. }},
  author       = {{Klüners, Jürgen and Komatsu, Toru}},
  issn         = {{0025-5718}},
  journal      = {{Mathematics of Computation}},
  keywords     = {{Applied Mathematics, Computational Mathematics, Algebra and Number Theory}},
  number       = {{329}},
  pages        = {{1483--1497}},
  publisher    = {{American Mathematical Society (AMS)}},
  title        = {{{Imaginary multiquadratic number fields with class group of exponent $3$ and $5$}}},
  doi          = {{10.1090/mcom/3609}},
  volume       = {{90}},
  year         = {{2021}},
}

@article{34912,
  abstract     = {{Let E be an ordinary elliptic curve over a finite field and g be a positive integer. Under some technical assumptions, we give an algorithm to span the isomorphism classes of principally polarized abelian varieties in the isogeny class of E⁹ . The varieties are first described as hermitian lattices over (not necessarily maximal) quadratic orders and then geometrically in terms of their algebraic theta null point. We also show how to algebraically compute Siegel modular forms of even weight given as polynomials in the theta constants by a careful choice of an affine lift of the theta null point. We then use these results to give an algebraic computation of Serre’s obstruction for principally polarized abelian threefolds isogenous to E³ and of the Igusa modular form in dimension 4. We illustrate our algorithms with examples of curves with many rational points over finite fields. }},
  author       = {{Kirschmer, Markus and Narbonne, Fabien and Ritzenthaler, Christophe and Robert, Damien}},
  issn         = {{0025-5718}},
  journal      = {{Mathematics of Computation}},
  keywords     = {{Applied Mathematics, Computational Mathematics, Algebra and Number Theory}},
  number       = {{333}},
  pages        = {{401--449}},
  publisher    = {{American Mathematical Society (AMS)}},
  title        = {{{Spanning the isogeny class of a power of an elliptic curve}}},
  doi          = {{10.1090/mcom/3672}},
  volume       = {{91}},
  year         = {{2021}},
}

@article{45955,
  author       = {{Akrivis, Georgios and Feischl, Michael and Kovács, Balázs and Lubich, Christian}},
  issn         = {{0025-5718}},
  journal      = {{Mathematics of Computation}},
  keywords     = {{Applied Mathematics, Computational Mathematics, Algebra and Number Theory}},
  number       = {{329}},
  pages        = {{995--1038}},
  publisher    = {{American Mathematical Society (AMS)}},
  title        = {{{Higher-order linearly implicit full discretization of the Landau–Lifshitz–Gilbert equation}}},
  doi          = {{10.1090/mcom/3597}},
  volume       = {{90}},
  year         = {{2020}},
}

@article{42797,
  abstract     = {{An efficient algorithm to compute automorphism groups and isometries of definite Fq[t]-lattices for odd q is presented. The algorithm requires several square root computations in Fq₂ but no enumeration of orbits having more than eight elements. }},
  author       = {{Kirschmer, Markus}},
  issn         = {{0025-5718}},
  journal      = {{Mathematics of Computation}},
  keywords     = {{Applied Mathematics, Computational Mathematics, Algebra and Number Theory}},
  number       = {{279}},
  pages        = {{1619--1634}},
  publisher    = {{American Mathematical Society (AMS)}},
  title        = {{{A normal form for definite quadratic forms over $\mathbb{F}_{q}[t]$}}},
  doi          = {{10.1090/s0025-5718-2011-02570-6}},
  volume       = {{81}},
  year         = {{2012}},
}

@article{35941,
  abstract     = {{Let L = ℚ(α) be an abelian number field of degree n. Most
algorithms for computing the lattice of subfields of L require the computation
of all the conjugates of α. This is usually achieved by factoring the minimal
polynomial mα(x) of α over L. In practice, the existing algorithms for factoring
polynomials over algebraic number fields can handle only problems of moderate
size. In this paper we describe a fast probabilistic algorithm for computing
the conjugates of α, which is based on p-adic techniques. Given mα(x) and a
rational prime p which does not divide the discriminant disc(mα(x)) of mα(x),
the algorithm computes the Frobenius automorphism of p in time polynomial
in the size of p and in the size of mα(x). By repeatedly applying the algorithm
to randomly chosen primes it is possible to compute all the conjugates of α.}},
  author       = {{Klüners, Jürgen and Acciaro, Vincenzo}},
  issn         = {{1088-6842}},
  journal      = {{Mathematics of Computation}},
  number       = {{227}},
  pages        = {{1179--1186}},
  publisher    = {{American Mathematical Society (AMS)}},
  title        = {{{Computing Automorphisms of Abelian Number Fields}}},
  volume       = {{68}},
  year         = {{1999}},
}