It is proved, within the constructive theory of apartness spaces, that a strongly continuous mapping from a totally bounded uniform space with a countable base of entourages to a uniform space is uniformly continuous. This lifts a result of Ishihara and Schuster from metric to uniform apartness spaces. The paper is part of a systematic development of computable topology using apartness as the fundamental notion.

I give an algorithm for computing the full space of automor-phic forms for definite unitary groups over ℚ, and apply this to calculate the automorphic forms of level G(hat{Z}) and various small weights for an example of a rank 3 unitary group. This leads to some examples of various types of endoscopic lifting from automorphic forms for U1 × U1 × U1 and U1 × U2, and to an example of a non-endoscopic form of weight (3, 3) corresponding to a family of 3-dimensional irreducible ℓ-adic Galois representations. I also compute the 2-adic slopes of some automorphic forms with level structure at 2, giving evidence for the local constancy of the slopes.

The authors study a new method for coset enumeration in finitely presented groups. Their method uses prefix Gröbner basis computation in the monoid ring ${\mathbb{K}}[{\cal M}]$, where ${\mathbb{K}}$ is a computable field and ${\cal M}$ a monoid presented by a convergent string-rewriting system. The method is compared to well-known methods for Todd-Coxeter enumeration, using examples from the literature where studies of these methods are reported. New insights into coset enumeration were gained using three different kinds of orderings, combined with new frameworks and strategies implemented in MRC 1.2.

We construct explicit examples of E8 lattices occurring in arithmetic for which the natural Galois action is equal to the full group of automorphisms of the lattice, i.e., the Weyl group of E8. In particular, we give explicit elliptic curves over Q(t) whose Mordell-Weil lattices are isomorphic to E8 and have maximal Galois action.

Our main objects of study are del Pezzo surfaces of degree 1 over number fields. The geometric Picard group, considered as a lattice via the negative of the intersection pairing, contains a sublattice isomorphic to E8. We construct examples of such surfaces for which the action of Galois on the geometric Picard group is maximal.

We provide strong experimental evidence for an upper bound on the number of endpoints of the cut locus from a point on a 2-surface of revolution. This bound is equal to the minimal number of intervals of monotone non-increasing or non-decreasing Gaussian curvature along one meridian from one pole to the other.

This paper concerns the existence and algorithmic determination of minimal models for curves of genus 1, given by equations of the form y2 = Q(x), where Q(x) has degree 4. These models are used in the method of 2-descent for computing the rank of an elliptic curve. The results described here are complete for unramified extensions of Q2 and Q3, and for all p-adic fields for p greater than or equal to 5. The primary motivation for this work was to complete the results of Birch and Swinnerton-Dyer, which are incomplete in the case of Q2. The results in this case (when applied to 2-coverings of elliptic curves over Q) yield substantial improvements in the running times of the 2-descent algorithm implemented in the program mwrank. The paper ends with a section on implementation and examples, and an appendix gives constructive proofs in sufficient detail to be used for implementation.

We classify the radical p-subgroups and chains of the Fischer simple group Fi′24 and then verify the Alperin weight conjecture and the Uno reductive conjecture for Fi′24.

We consider proper 5-colourings of the kagome lattice. Proper q-colourings correspond to configurations in the zero-temperature q-state anti-ferromagnetic Potts model. Salas and Sokal have given a computer assisted proof of strong spatial mixing on the kagome lattice for q ≥ 6 under any temperature, including zero temperature. It is believed that there is strong spatial mixing for q ≥ 4. Here we give a computer assisted proof of strong spatial mixing for q = 5 and zero temperature. It is commonly known that strong spatial mixing implies that there is a unique infinite-volume Gibbs measure and that the Glauber dynamics is rapidly mixing. We give a proof of rapid mixing of the Glauber dynamics on any finite subset of the vertices of the kagome lattice, provided that the boundary is free (not coloured). The Glauber dynamics is not necessarily irreducible if the boundary is chosen arbitrarily for q = 5 colours. The Glauber dynamics can be used to uniformly sample proper 5-colourings. Thus, a consequence of rapidly mixing Glauber dynamics is that there is fully polynomial randomised approximation scheme for counting the number of proper 5-colourings.

In this paper, the authors determine the suborbits of Conways largest simple group in its conjugation action on each of its three conjugacy classes of involutions. Matrix representatives of these suborbits are also provided in an accompanying computer file.

Modular symbols of weight 2 for a congruence subgroup Γ satisfy the identity {α,γ,(α)}={β,γ(β)} for all α,β in the extended upper half plane and γ ∊ Γ. The analogue of this identity is false for modular symbols of weight greater than 2. This paper provides a definition of transportable modular symbols, which are symbols for which an analogue of the above identity holds, and proves that every cuspidal symbol can be written as a transportable symbol. As a corollary, an algorithm is obtained for computing periods of cuspforms.

We describe an efficient algorithm for the inversion of covariance matrices that arise in the context of phylogenetic tree construction. Phylogenetic trees describe the evolutionary relationships between species, and their construction is computationally demanding. Many approaches involve the symmetric matrix of evolutionary distances between species. Regarding these distances as random variables, the corresponding set of variances and covariances form a rank-4 tensor, and the inner-product defined by its inverse can be used to assign statistical scores to candidate trees. We describe a natural set of assumptions for the phylogenetic tree under construction, and show how under these assumptions the covariance tensor for a tree with n leaves can be inverted in O(n2) operations. In addition to presenting the inversion algorithm, we hope this article will open algebraic and computational problems from the field of phylogeny to a wider audience.

The authors present a nearly linear-time Las Vegas algorithm that, given a large-base primitive permutation group, constructs its natural imprimitive representation. A large-base primitive permutation group is a subgroup of a wreath product of symmetric groups Sn and Sr in product action on r-tuples of k-element subsets of {1, …, n}, containing Anr. The algorithm is a randomised speed-up of a deterministic algorithm of Babai, Luks, and Seress.

We describe an algorithm for computing a chief series, the soluble radical, and two other characteristic subgroups of a matrix group over a finite field, which is intended for matrix groups that are too large for the use of base and strong generating set methods. The algorithm has been implemented in Magma by the second author.

Ѕ(2n,k) be the variety of homogeneous polynomials of degree k in 2n variables. The authors of this paper give a computer-assisted proof that there is an analytic open set Ω of Ѕ(4,3) such that the surface F = 0 is a minimal homogeneous involutive variety of ℂ4 for all F ∈ Ω. As part of the proof, they give an explicit example of a polynomial with rational coefficients that belongs to Ω.

This paper is concerned with a relation of Darboux in enumerative geometry, which has very useful applications in the study of polynomial vector fields. The original statement of Darboux was not correct. The present paper gives two different elementary proofs of this relation. The first one follows the ideas of Darboux, and uses basic facts about the intersection index of two plane algebraic curves; the second proof is rather more sophisticated, and gives a stronger result, which should also be very useful. The power of the relation of Darboux is then illustrated by the provision of new, simple proofs of two known results. First, it is shown that an irreducible invariant algebraic curve of degree n > 1 without multiple points for a polynomial vector field of degree m satisfies n ≤ m + 1. Second, a proof is given that quadratic polynomial vector fields have no algebraic limit cycles of degree 3.

Let G be a simple algebraic group over an algebraically closed field with Lie algebra g. Then the orbits of nilpotent elements of g under the adjoint action of G have been classified. We describe a simple algorithm for finding a representative of a nilpotent orbit. We use this to compute lists of representatives of these orbits for the Lie algebras of exceptional type. Then we give two applications. The first one concerns settling a conjecture by Elashvili on the index of centralizers of nilpotent orbits, for the case where the Lie algebra is of exceptional type. The second deals with minimal dimensions of centralizers in centralizers.

This paper presents a new geometric algorithm to construct a Ck-smooth spline curve that interpolates a given set of data (points and velocities) on a complete Riemannian manifold. Although based on a modification of the De Casteljau procedure, this new algorithm is implemented in only three steps, independently of the required degree of smoothness, and therefore introduces a significant reduction in complexity. The key role is played by the choice of an appropriate smoothing function, which is defined as soon as the degree of smoothness is fixed.