This paper presents a new result concerning the distribution of 2-Selmer ranks in the quadratic twist family of an elliptic curve over an arbitrary number field $K$ with a single point of order two that does not have a cyclic 4-isogeny defined over its two-division field. We prove that at least half of all the quadratic twists of such an elliptic curve have arbitrarily large 2-Selmer rank, showing that the distribution of 2-Selmer ranks in the quadratic twist family of such an elliptic curve differs from the distribution of 2-Selmer ranks in the quadratic twist family of an elliptic curve having either no rational two-torsion or full rational two-torsion.

We exhibit the double $q$-shuffle structure for the $q$MZVs introduced by Ohno et al. [‘Cyclic $q$-MZSV sum’, J. Number Theory132 (2012), 144–155].

We consider a certain family of Kudla–Rapoport cycles on an integral model of a Shimura variety attached to a unitary group of signature (1, 1), and prove that the arithmetic degrees of these cycles are Fourier coefficients of the central derivative of an Eisenstein series of genus 2. The integral model in question parameterizes abelian surfaces equipped with a non-principal polarization and an action of an imaginary quadratic number ring, and in this setting the cycles are degenerate: they may contain components of positive dimension. This result can be viewed as confirmation, in the degenerate setting and for dimension 2, of conjectures of Kudla and Kudla–Rapoport that predict relations between the intersection numbers of special cycles and the Fourier coefficients of automorphic forms.

We show that arithmetic local constants attached by Mazur and Rubin to pairs of self-dual Galois representations which are congruent modulo a prime number $p>2$ are compatible with the usual local constants at all primes not dividing $p$ and in two special cases also at primes dividing $p$. We deduce new cases of the $p$-parity conjecture for Selmer groups of abelian varieties with real multiplication (Theorem 4.14) and elliptic curves (Theorem 5.10).

We construct an Euler system attached to a weight 2 modular form twisted by a Grössencharacter of an imaginary quadratic field $K$, and apply this to bounding Selmer groups.

For an elliptic curve $E/\mathbb{Q}$ without complex multiplication we study the distribution of Atkin and Elkies primes $\ell$ , on average, over all good reductions of $E$ modulo primes $p$ . We show that, under the generalized Riemann hypothesis, for almost all primes $p$ there are enough small Elkies primes $\ell$ to ensure that the Schoof–Elkies–Atkin point-counting algorithm runs in $(\log p)^{4+o(1)}$ expected time.

We find defining equations for the Shimura curve of discriminant 15 over $\mathbb{Z}[1/15]$. We then determine the graded ring of automorphic forms over the 2-adic integers, as well as the higher cohomology. We apply this to calculate the homotopy groups of a spectrum of ‘topological automorphic forms’ associated to this curve, as well as one associated to a quotient by an Atkin–Lehner involution.

Let $A$ be an abelian variety of dimension $g$ together with a principal polarization ${\it\phi}:A\rightarrow \hat{A}$ defined over a field $k$ . Let $\ell$ be an odd integer prime to the characteristic of $k$ and let $K$ be a subgroup of $A[\ell ]$ which is maximal isotropic for the Riemann form associated to ${\it\phi}$ . We suppose that $K$ is defined over $k$ and let $B=A/K$ be the quotient abelian variety together with a polarization compatible with ${\it\phi}$ . Then $B$ , as a polarized abelian variety, and the isogeny $f:A\rightarrow B$ are also defined over $k$ . In this paper, we describe an algorithm that takes as input a theta null point of $A$ and a polynomial system defining $K$ and outputs a theta null point of $B$ as well as formulas for the isogeny $f$ . We obtain a complexity of $\tilde{O} (\ell ^{(rg)/2})$ operations in $k$ where $r=2$ (respectively, $r=4$ ) if $\ell$ is a sum of two (respectively, four) squares which constitutes an improvement over the algorithm described in Cosset and Robert (Math. Comput. (2013) accepted for publication). We note that the algorithm is quasi-optimal if $\ell$ is a sum of two squares since its complexity is quasi-linear in the degree of $f$ .

We study the problem of efficiently constructing a curve $C$ of genus  $2$ over a finite field $\mathbb{F}$ for which either the curve $C$ itself or its Jacobian has a prescribed number $N$ of $\mathbb{F}$ -rational points.

In the case of the Jacobian, we show that any ‘CM-construction’ to produce the required genus- $2$ curves necessarily takes time exponential in the size of its input.

On the other hand, we provide an algorithm for producing a genus- $2$ curve with a given number of points that, heuristically, takes polynomial time for most input values. We illustrate the practical applicability of this algorithm by constructing a genus- $2$ curve having exactly $10^{2014}+9703$ (prime) points, and two genus- $2$ curves each having exactly $10^{2013}$ points.

In an appendix we provide a complete parametrization, over an arbitrary base field $k$ of characteristic neither two nor three, of the family of genus- $2$ curves over $k$ that have $k$ -rational degree- $3$ maps to elliptic curves, including formulas for the genus- $2$ curves, the associated elliptic curves, and the degree- $3$ maps.

Supplementary materials are available with this article.

Let p be a prime and K a number field of degree p. We determine the finiteness of the number of elliptic curves, up to K-isomorphism, having a prescribed property, where this property is either that the curve contains a fixed torsion group as a subgroup or that it has a cyclic isogeny of prescribed degree.

We construct $p$-adic families of Klingen–Eisenstein series and $L$-functions for cusp forms (not necessarily ordinary) unramified at an odd prime $p$ on definite unitary groups of signature $(r,0)$ (for any positive integer $r$) for a quadratic imaginary field ${\mathcal{K}}$ split at $p$. When $r=2$, we show that the constant term of the Klingen–Eisenstein family is divisible by a certain $p$-adic $L$-function.

Let $A$ be an abelian variety over a global field $K$ of characteristic $p\geqslant 0$. If $A$ has nontrivial (respectively full) $K$-rational $l$-torsion for a prime $l\neq p$, we exploit the fppf cohomological interpretation of the $l$-Selmer group $\text{Sel}_{l}\,A$ to bound $\#\text{Sel}_{l}\,A$ from below (respectively above) in terms of the cardinality of the $l$-torsion subgroup of the ideal class group of $K$. Applied over families of finite extensions of $K$, the bounds relate the growth of Selmer groups and class groups. For function fields, this technique proves the unboundedness of $l$-ranks of class groups of quadratic extensions of every $K$ containing a fixed finite field $\mathbb{F}_{p^{n}}$ (depending on $l$). For number fields, it suggests a new approach to the Iwasawa ${\it\mu}=0$ conjecture through inequalities, valid when $A(K)[l]\neq 0$, between Iwasawa invariants governing the growth of Selmer groups and class groups in a $\mathbb{Z}_{l}$-extension.

Extending the idea of Dabrowski [‘On the proportion of rank 0 twists of elliptic curves’, C. R. Acad. Sci. Paris, Ser. I 346 (2008), 483–486] and using the 2-descent method, we provide three general families of elliptic curves over $\mathbb{Q}$ such that a positive proportion of prime-twists of such elliptic curves have rank zero simultaneously.

For the $(d+1)$-dimensional Lie group $G=\mathbb{Z}_{p}^{\times }\ltimes \mathbb{Z}_{p}^{\oplus d}$, we determine through the use of $p$-power congruences a necessary and sufficient set of conditions whereby a collection of abelian $L$-functions arises from an element in $K_{1}(\mathbb{Z}_{p}\unicode[STIX]{x27E6}G\unicode[STIX]{x27E7})$. If $E$ is a semistable elliptic curve over $\mathbb{Q}$, these abelian $L$-functions already exist; therefore, one can obtain many new families of higher order $p$-adic congruences. The first layer congruences are then verified computationally in a variety of cases.

We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1–13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.

We consider two families of arithmetic divisors defined on integral models of Shimura curves. The first was studied by Kudla, Rapoport and Yang, who proved that if one assembles these divisors in a formal generating series, one obtains the $q$-expansion of a modular form of weight 3/2. The present work concerns the Shimura lift of this modular form: we identify the Shimura lift with a generating series comprising divisors arising in the recent work of Kudla and Rapoport regarding cycles on Shimura varieties of unitary type. In the prequel to this paper, the author considered the geometry of the two families of cycles. These results are combined with the Archimedean calculations found in this work in order to establish the theorem. In particular, we obtain new examples of modular generating series whose coefficients lie in arithmetic Chow groups of Shimura varieties.

We use an invariant-theoretic method to compute certain twists of the modular curves $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X(n)$ for $n=7,11$ . Searching for rational points on these twists enables us to find non-trivial pairs of $n$ -congruent elliptic curves over ${\mathbb{Q}}$ , that is, pairs of non-isogenous elliptic curves over ${\mathbb{Q}}$ whose $n$ -torsion subgroups are isomorphic as Galois modules. We also find a non-trivial pair of 11-congruent elliptic curves over ${\mathbb{Q}}(T)$ , and hence give an explicit infinite family of non-trivial pairs of 11-congruent elliptic curves  over ${\mathbb{Q}}$ .

Supplementary materials are available with this article.

We exhibit a numerical method to compute three-point branched covers of the complex projective line. We develop algorithms for working explicitly with Fuchsian triangle groups and their finite-index subgroups, and we use these algorithms to compute power series expansions of modular forms on these groups.

We explicitly construct the Kummer variety associated to the Jacobian of a hyperelliptic curve of genus 3 that is defined over a field of characteristic not equal to 2 and has a rational Weierstrass point defined over the same field. We also construct homogeneous quartic polynomials on the Kummer variety and show that they represent the duplication map using results of Stoll.

Supplementary materials are available with this article.

Let $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}\mathcal{O}$ be a maximal order in the quaternion algebra $B_p$ over $\mathbb{Q}$ ramified at $p$ and $\infty $. The paper is about the computational problem: construct a supersingular elliptic curve $E$ over $\mathbb{F}_p$ such that ${\rm End}(E) \cong \mathcal{O}$. We present an algorithm that solves this problem by taking gcds of the reductions modulo $p$ of Hilbert class polynomials.

New theoretical results are required to determine the complexity of our algorithm. Our main result is that, under certain conditions on a rank three sublattice $\mathcal{O}^T$ of $\mathcal{O}$, the order $\mathcal{O}$ is effectively characterized by the three successive minima and two other short vectors of $\mathcal{O}^T\! .$ The desired conditions turn out to hold whenever the $j$-invariant $j(E)$, of the elliptic curve with ${\rm End}(E) \cong \mathcal{O}$, lies in $\mathbb{F}_p$. We can then prove that our algorithm terminates with running time $O(p^{1+\varepsilon })$ under the aforementioned conditions.

As a further application we present an algorithm to simultaneously match all maximal order types with their associated $j$-invariants. Our algorithm has running time $O(p^{2.5 + \varepsilon })$ operations and is more efficient than Cerviño’s algorithm for the same problem.