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.

The Coleman integral is a $p$-adic line integral that encapsulates various quantities of number theoretic interest. Building on the work of Harrison [J. Symbolic Comput. 47 (2012) no. 1, 89–101], we extend the Coleman integration algorithms in Balakrishnan et al. [Algorithmic number theory, Lecture Notes in Computer Science 6197 (Springer, 2010) 16–31] and Balakrishnan [ANTS-X: Proceedings of the Tenth Algorithmic Number Theory Symposium, Open Book Series 1 (Mathematical Sciences Publishers, 2013) 41–61] to even-degree models of hyperelliptic curves. We illustrate our methods with numerical examples computed in Sage.

Let $G$ be a compact connected Lie group with a maximal torus $T$. In the context of Schubert calculus we present the integral cohomology $H^{\ast }(G/T)$ by a minimal system of generators and relations.

Van Wamelen [Math. Comp. 68 (1999) no. 225, 307–320] lists 19 curves of genus two over $\mathbf{Q}$ with complex multiplication (CM). However, for each curve, the CM-field turns out to be cyclic Galois over $\mathbf{Q}$, and the generic case of a non-Galois quartic CM-field did not feature in this list. The reason is that the field of definition in that case always contains the real quadratic subfield of the reflex field.

We extend Van Wamelen’s list to include curves of genus two defined over this real quadratic field. Our list therefore contains the smallest ‘generic’ examples of CM curves of genus two.

We explain our methods for obtaining this list, including a new height-reduction algorithm for arbitrary hyperelliptic curves over totally real number fields. Unlike Van Wamelen, we also give a proof of our list, which is made possible by our implementation of denominator bounds of Lauter and Viray for Igusa class polynomials.

Let χ be the primitive Dirichlet character of conductor 49 defined by χ(3)=ζ for ζ a primitive 42nd root of unity. We explicitly compute the slopes of the U7 operator acting on the space of overconvergent modular forms on X1(49) with weight k and character χ7k−6 or χ8−7k, depending on the embedding of ℚ(ζ) into ℂ7. By applying results of Coleman and of Cohen and Oesterlé, we are then able to deduce the slopes of U7 acting on all classical Hecke newforms of the same weight and character.

We present a new method to propagate $p$-adic precision in computations, which also applies to other ultrametric fields. We illustrate it with some examples and give a toy application to the stable computation of the SOMOS 4 sequence.

Our main purpose in this paper is to propose the piecewise Legendre spectral-collocation method to solve Volterra integro-differential equations. We provide convergence analysis to show that the numerical errors in our method decay in $h^{m}N^{-m}$-version rate. These results are better than the piecewise polynomial collocation method and the global Legendre spectral-collocation method. The provided numerical examples confirm these theoretical results.

We present a higher-dimensional generalization of the Gama–Nguyen algorithm (STOC ’08) for approximating the shortest vector problem in a lattice. This generalization approximates the densest sublattice by using a subroutine solving the exact problem in low dimension, such as the Dadush–Micciancio algorithm (SODA ’13). Our approximation factor corresponds to a natural inequality on Rankin’s constant derived from Rankin’s inequality.

There are a number of fundamental results in the study of holomorphic function theory associated to the discrete group $\operatorname{PSL}(2,\mathbb{Z})$, including the following statements: the ring of holomorphic modular forms is generated by the holomorphic Eisenstein series of weights four and six, denoted by $E_{4}$ and $E_{6}$; the smallest-weight cusp form $\unicode[STIX]{x1D6E5}$ has weight twelve and can be written as a polynomial in $E_{4}$ and $E_{6}$; and the Hauptmodul $j$ can be written as a multiple of $E_{4}^{3}$ divided by $\unicode[STIX]{x1D6E5}$. The goal of the present article is to seek generalizations of these results to some other genus-zero arithmetic groups $\unicode[STIX]{x1D6E4}_{0}(N)^{+}$ with square-free level $N$, which are related to ‘Monstrous moonshine conjectures’. Certain aspects of our results are generated from extensive computer analysis; as a result, many of the space-consuming results are made available on a publicly accessible web site. However, we do present in this article specific results for certain low-level groups.

We consider the finite W-algebra U(𝔤,e) associated to a nilpotent element e∈𝔤 in a simple complex Lie algebra 𝔤 of exceptional type. Using presentations obtained through an algorithm based on the PBW-theorem for U(𝔤,e), we verify a conjecture of Premet, that U(𝔤,e) always has a 1-dimensional representation when 𝔤 is of type G2, F4, E6 or E7. Thanks to a theorem of Premet, this allows one to deduce the existence of minimal dimension representations of reduced enveloping algebras of modular Lie algebras of the above types. In addition, a theorem of Losev allows us to deduce that there exists a completely prime primitive ideal in U(𝔤)whose associated variety is the coadjoint orbit corresponding to e.

In previous work by Di Martino, Tamburini and Zalesski [Comm. Algebra 28 (2000) 5383–5404] it is shown that certain low-dimensional classical groups over finite fields are not Hurwitz. In this paper the list is extended by adding the special linear and special unitary groups in dimensions 8.9,11.13. We also show that all groups Sp(n, q) are not Hurwitz for q even and n = 6,8,12,16. In the range 11 < n < 32 many of these groups are shown to be non-Hurwitz. In addition, we observe that PSp(6, 3), PΩ±(8, 3k), PΩ±10k), Ω(11,3k), Ω±(14,3k), Ω±(16,7k), Ω(n, 7k) for n = 9,11,13, PSp(8, 7k) are not Hurwitz.

In 1992, Göran Björck and Ralf Fröberg completely characterized the solution set of cyclic-8. In 2001, Jean-Charles Faugère determined the solution set of cyclic-9, by computer algebra methods and Gröbner basis computation. In this paper, a new theory in matrix analysis of rank-deficient matrices together with algorithms in numerical algebraic geometry enables us to present a symbolic-numerical algorithm to derive exactly the defining polynomials of all prime ideals of positive dimension in primary decomposition of cyclic-12. Empirical evidence together with rigorous proof establishes the fact that the positive-dimensional solution variety of cyclic-12 just consists of 72 quadrics of dimension one.

This paper first describes the construction and use of the hyperreals in the theorem-prover Isabelle within the framework of higher-order logic (HOL). The theory, which includes infinitesimals and infinite numbers, is based on the hyperreal number system developed by Abraham Robinson in his nonstandard analysis (NSA). The construction of the hyperreal number system has been carried out strictly through the use of definitions to ensure that the foundations of NSA in Isabelle are sound. Mechanizing the construction has required that various number systems including the rationals and the reals be built up first. Moreover, to construct the hyperreals from the reals has required developing a theory of filters and ultrafilters and proving Zorn's lemma, an equivalent form of the axiom of choice.

This paper also describes the use of the new types of numbers and new relations on them to formalize familiar concepts from analysis. The current work provides both standard and nonstandard definitions for the various notions, and proves their equivalence in each case. To achieve this aim, systematic methods, through which sets and functions are extended to the hyperreals, are developed in the framework. The merits of the nonstandard approach with respect to the practice of analysis and mechanical theorem-proving are highlighted throughout the exposition.

We present the results of computer experiments suggesting that the probability that a random multiword in a free group is virtually geometric decays to zero exponentially quickly in the length of the multiword. We also prove this fact.

We report on our project to find explicit examples of K3 surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for point counting on surfaces defined over finite fields. For this, we describe algorithms that are $p$-adic in nature.

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.

Denote by $ \mathbb{Q} ( \sqrt{- m} )$, with $m$ a square-free positive integer, an imaginary quadratic number field, and by ${ \mathcal{O} }_{- m} $ its ring of integers. The Bianchi groups are the groups ${\mathrm{SL} }_{2} ({ \mathcal{O} }_{- m} )$. In the literature, so far there have been no examples of $p$-torsion in the integral homology of the full Bianchi groups, for $p$ a prime greater than the order of elements of finite order in the Bianchi group, which is at most 6. However, extending the scope of the computations, we can observe examples of torsion in the integral homology of the quotient space, at prime numbers as high as for instance $p= 80\hspace{0.167em} 737$ at the discriminant $- 1747$.

Supplementary materials are available with this article.

We construct explicit bases for spaces of overconvergent $p$-adic modular forms when $p=2,3$ and study their interaction with the Atkin operator. This results in an extension of Lauder’s algorithms for overconvergent modular forms. We illustrate these algorithms with computations of slope sequences of some $2$-adic eigencurves and the construction of Chow–Heegner points on elliptic curves via special values of Rankin triple product L-functions.

Using the paths of steepest descent, we prove precise bounds with numerical implied constants for the modified Bessel function ${K}_{ir} (x)$ of imaginary order and its first two derivatives with respect to the order. We also prove precise asymptotic bounds on more general (mixed) derivatives without working out numerical implied constants. Moreover, we present an absolutely and rapidly convergent series for the computation of ${K}_{ir} (x)$ and its derivatives, as well as a formula based on Fourier interpolation for computing with many values of $r$. Finally, we have implemented a subset of these features in a software library for fast and rigorous computation of ${K}_{ir} (x)$.

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on maximal unipotent subgroups of split reductive groups and show how this improves computation in the reductive group itself.