We describe an online database of number fields which accompanies this paper. The database centers on complete lists of number fields with prescribed invariants. Our description here focuses on summarizing tables and connections to theoretical issues of current interest.

The value ot the late pairing on an elliptic curve over a finite field may be viewed as an element of an algebraic torus. Using this simple observation, we transfer techniques recently developed for torus-based cryptography to pairing-based cryptography, resulting in more efficient computations, and lower bandwidth requirements. To illustrate the efficacy of this approach, we apply the method to pairings on supersingular elliptic curves in characteristic three.

A reduction theory is developed for binary forms (homogeneous polynomials) of degrees three and four with integer coefficients. The resulting coefficient bounds simplify and improve on those in the literature, particularly in the case of negative discriminant. Applications include systematic enumeration of cubic number fields, and 2-descent on elliptic curves defined over the set of rational numbers. Remarks are given concerning the extension of these results to forms defined over number fields.

Lattice sieving is asymptotically the fastest approach for solving the shortest vector problem (SVP) on Euclidean lattices. All known sieving algorithms for solving the SVP require space which (heuristically) grows as $2^{0.2075n+o(n)}$, where $n$ is the lattice dimension. In high dimensions, the memory requirement becomes a limiting factor for running these algorithms, making them uncompetitive with enumeration algorithms, despite their superior asymptotic time complexity.

We generalize sieving algorithms to solve SVP with less memory. We consider reductions of tuples of vectors rather than pairs of vectors as existing sieve algorithms do. For triples, we estimate that the space requirement scales as $2^{0.1887n+o(n)}$. The naive algorithm for this triple sieve runs in time $2^{0.5661n+o(n)}$. With appropriate filtering of pairs, we reduce the time complexity to $2^{0.4812n+o(n)}$ while keeping the same space complexity. We further analyze the effects of using larger tuples for reduction, and conjecture how this provides a continuous trade-off between the memory-intensive sieving and the asymptotically slower enumeration.

We describe how to compute the ideal class group and the unit group of an order in a number field in subexponential time. Our method relies on the generalized Riemann hypothesis and other usual heuristics concerning the smoothness of ideals. It applies to arbitrary classes of number fields, including those for which the degree goes to infinity.

A p-regular element in a finite group is an element of order not divisible by the prime number p. We show that for every prime p and every finite simple group S, a fair proportion of elements of S is p-regular. In particular, we show that the proportion of p-regular elements in a finite classical simple group (not necessarily of characteristic p) is greater than 1/(2n), where n – 1 is the dimension of the projective space on which S acts naturally. Furthermore, in an exceptional group of Lie type this proportion is greater than 1/15. For the alternating group An, this proportion is at least 26/(27√n), and for sporadic simple groups, at least 2/29.

We also show that for an arbitrary field F, if the simple group S is a quotient of a finite subgroup of GLn(F) then for any prime p, the proportion of p-regular elements in S is at least min{1/31, 1/(2n)}.

Along the way we obtain estimates for the proportion of elements of certain primitive prime divisor orders in exceptional groups, complementing work by Niemeyer and Praeger (1998).Our result shows that in finite simple groups, p-regular elements can be found efficiently by random sampling. This is a key ingredient to recent polynomial-time Monte Carlo algorithms for matrix groups.

Finally we complement our lower bound results with the following upper bound: for all n ≥ 2 there exist infinitely many prime powers q such that the proportion of elements of odd order in PSL(n,q) is less than 3/√n.

We present a proof, which is conditional on the Birch and Swinnerton-Dyer Conjecture for a specific abelian variety, that there do not exist rational numbers x and c such that x has exact period N = 6 under the iteration x ↦ x2 + c. This extends earlier results by Morton for N = 4 and by Flynn, Poonen and Schaefer for N = 5.

We show how one can obtain an asymptotic expression for some special functions with a very explicit error term starting from appropriate upper bounds. We will work out the details for the Bessel function $J_\nu (x)$ and the Airy function ${\rm Ai}(x).$ In particular, we answer a question raised by Olenko and find a sharp bound on the difference between $J_\nu (x)$ and its standard asymptotics. We also give a very simple and surprisingly precise approximation for the zeros ${\rm Ai}(x).$

Using Jacobi field arguments, this paper describes an iterative procedure for finding the Riemannian barycentres of a class of probability measures on complete, simply connected Riemannian manifolds with a finite upper bound on their sectional curvatures. This, in particular, generalises an earlier result of the author's (‘Locating Fréchet means with application to shape spaces’, Adv. Appl. Probab. 33 (2001) 324-338).

We describe the construction of a database of genus-$2$ curves of small discriminant that includes geometric and arithmetic invariants of each curve, its Jacobian, and the associated $L$-function. This data has been incorporated into the $L$-Functions and Modular Forms Database (LMFDB).

In this paper, we present a heuristic algorithm for solving exact, as well as approximate, shortest vector and closest vector problems on lattices. The algorithm can be seen as a modified sieving algorithm for which the vectors of the intermediate sets lie in overlattices or translated cosets of overlattices. The key idea is hence no longer to work with a single lattice but to move the problems around in a tower of related lattices. We initiate the algorithm by sampling very short vectors in an overlattice of the original lattice that admits a quasi-orthonormal basis and hence an efficient enumeration of vectors of bounded norm. Taking sums of vectors in the sample, we construct short vectors in the next lattice. Finally, we obtain solution vector(s) in the initial lattice as a sum of vectors of an overlattice. The complexity analysis relies on the Gaussian heuristic. This heuristic is backed by experiments in low and high dimensions that closely reflect these estimates when solving hard lattice problems in the average case.

This new approach allows us to solve not only shortest vector problems, but also closest vector problems, in lattices of dimension $\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}}n$ in time $2^{0.3774\, n}$ using memory $2^{0.2925\, n}$. Moreover, the algorithm is straightforward to parallelize on most computer architectures.

The Weil descent construction of the GHS attack on the elliptic curve discrete logarithm problem (ECDLP) is generalised in this paper, to arbitrary Artin-Schreier extensions. A formula is given for the characteristic polynomial of Frobenius for the curves thus obtained, as well as a proof that the large cyclic factor of the input elliptic curve is not contained in the kernel of the composition of the conorm and norm maps. As an application, the number of elliptic curves that succumb to the basic GHS attack is considerably increased, thereby further weakening curves over GF2155.

Other possible extensions or variations of the GHS attack are discussed, leading to the conclusion that they are unlikely to yield further improvements.

Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach that exploits structural differences between ordinary and supersingular isogeny graphs. This yields a simple algorithm that, given E and a suitable non-residue in 𝔽p2, determines the supersingularity of E in O(n3log 2n) time and O(n) space, where n=O(log p) . Both these complexity bounds are significant improvements over existing methods, as we demonstrate with some practical computations.

This paper considers a number of related problems concerning the computation of eigenvalues and complex resonances of a general self-adjoint operator H. The feature which ties the different sections together is that one restricts oneself to spectral properties of H which can be proved by using only vectors from a pre-assigned (possibly finite-dimensional) linear subspace L.

The purpose of this paper is to study hyperelliptic curves with extra involutions. The locus Lg of such genus-g hyperelliptic curves is a g-dimensional subvariety of the moduli space of hyperelliptic curves Hg. The authors present a birational parameterization of Lg via dihedral invariants, and show how these invariants can be used to determine the field of moduli of points p ∈ Lg. They conjecture that for p ∈ Hg with |Aut(p)| > 2, the field of moduli is a field of definition, and they prove this conjecture for any point p ∈ Lg such that the Klein 4-group is embedded in the reduced automorphism group of p. Further, for g = 3, they show that for every moduli point p ∈ H3 such that |Aut(p)| > 4, the field of moduli is a field of definition. A rational model of the curve over its field of moduli is provided.

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used, for instance, in integer linear programming.

We study weak convergence of an Euler scheme for nonlinear stochastic delay differential equations (SDDEs) driven by multidimensional Brownian motion. The Euler scheme has weak order of convergence 1, as in the case of stochastic ordinary differential equations (SODEs) (i.e., without delay). The result holds for SDDEs with multiple finite fixed delays in the drift and diffusion terms. Although the set-up is non-anticipating, our approach uses the Malliavin calculus and the anticipating stochastic analysis techniques of Nualart and Pardoux.

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras, including a generalization of the concept of aW-graph to the situation of complex reflection groups. We then use these techniques to find models for all irreducible representations in the case of complex reflection groups of dimension at most three. Using these models we are able to verify some important conjectures on the structure of Hecke algebras.

Morgan Ward pursued the study of elliptic divisibility sequences, originally initiated by Lucas, and Chudnovsky and Chudnovsky subsequently suggested looking at elliptic divisibility sequences for prime appearance. The problem of prime appearance in these sequences is examined here, from both a theoretical and a practical viewpoint. We show calculations, together with a heuristic argument, to suggest that these sequences contain only finitely many primes.

We present an efficient algorithm to compute the Hasse–Witt matrix of a hyperelliptic curve $\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}}C/\mathbb{Q}$ modulo all primes of good reduction up to a given bound $N$, based on the average polynomial-time algorithm recently proposed by the first author. An implementation for hyperelliptic curves of genus 2 and 3 is more than an order of magnitude faster than alternative methods for $N = 2^{26}$.