The authors of this paper consider the anti-ferromagnetic Potts model on the the integer lattice Z2. The model has two parameters: q, the number of spins, and λ = exp(−β), where β 4 is ‘inverse temperature’. It is known that the model has strong spatial mixing if q > 7, or if q = 7 and λ = 0 or λ > 1/8, or if q = 6 and λ = 0 or λ > 1/4. The λ = 0 case corresponds to the model in which configurations are proper q-colourings of Z2. It is shown that the system has strong spatial mixing for q ≥ 6 and any λ. This implies that Glauber dynamics is rapidly mixing (so there is a fully-polynomial randomised approximation scheme for the partition function), and also that there is a unique infinite-volume Gibbs state. We also show that strong spatial mixing occurs for a larger range of λ than was previously known for q = 3, q = 4 and q = 5.

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.

Høyer has given a generalisation of the Deutsch–Jozsa algorithm which uses the Fourier transform on a group G which is (in general) non-Abelian. His algorithm distinguishes between functions which are either perfectly balanced (m-to-one) or constant, with certainty, and using a single quantum query. Here, we show that this algorithm (which we call the Deutsch–Jozsa–Høyer algorithm) can in fact deal with a broader range of promises, which we define in terms of the irreducible representations of G.

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.

We formulate a variational problem on a Riemannian manifold M whose solutions are piecewise smooth geodesies that best fit a given data set of time labelled points in M. By a limiting process, these solutions converge to a single point in M. which we prove to be the Riemannian mean of the given points for some particular Riemannian manifolds such as Euclidean spaces, connected and compact Lie groups, and spheres.

We present algorithms for testing nilpotency of matrix groups over finite fields, and for deciding irreducibility and primitivity of nilpotent matrix groups. The algorithms also construct modules and imprimitivity systems for nilpotent groups. In order to justify our algorithms, we prove several structural results for nilpotent linear groups, and computational and theoretical results for abstract nil-potent groups, which are of independent interest.

The Verheul homomorphism is a group homomorphism from a finite subgroup of the multiplicative group of a field to an elliptic curve. The hardness of computation of the Verheul homomorphism was shown by Verheul to be closely related to the hardness of the computational Diffie-Hellman problem. Let p ≥ 5 be a prime, and let N be a prime satisfying √(12p) < N < 2p / √3, where N ≠ p. Let E be an ordinary elliptic curve over Fp, and let C ⊂ E be a cyclic subgroup of order N. Let H be the group of all Nth roots of unity (contained in the algebraic closure of Fp), and let phi be the Verheul isomorphism from H to C.

We consider a polynomial P such that P(z) is the X-coordinate of phi(z) for all z ∈ H – {1}. We show that, for at least approximately 58% of pairs (E, C), none of the coefficients of the non-constant terms of P vanishes.

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 classify the simple Lie algebras of dimension at most 9 over GF(2). There is one of dimension 3 and one of dimension 6, there are two of dimension 7 and two of dimension 8, and there is one of dimension 9. The two simple Lie algebras of dimension 8 are restricted Lie algebras. If we extend the ground field to GF(4), then the six-dimensional algebra is no longer simple, and if we extend the ground field to GF(8) then the nine-dimensional algebra is no longer simple. But the other algebras are all central simple.

Constructing numerical models of noisy partial differential equations is a very delicate task. Our long-term aim is to use modern dynamical systems theory to derive discretisations of dissipative stochastic partial differential equations. As a second step, we consider here a small domain, representing a finite element, and derive a one-degree-of-freedom model for the dynamics in the element; stochastic centre manifold theory supports the model. The approach automatically parametrises the microscale structures induced by spatially varying stochastic noise within the element. The crucial aspect of this work is that we explore how a multitude of microscale noise processes may interact in nonlinear dynamical systems. The analysis finds that noise processes with coarse structure across a finite element are the significant noises for the modelling. Further, the nonlinear dynamics abstracts effectively new noise sources over the macroscale time-scales resolved by the model.

We present an algorithm that reduces the problem of calculating a numerical approximation to the action of absolute Frobenius on the middle-dimensional rigid cohomology of a smooth projective variety over a finite held, to that of performing the same calculation for a smooth hyperplane section. When combined with standard geometric techniques, this yields a method for computing zeta functions which proceeds ‘by induction on the dimension’. The ‘inductive step’ combines previous work of the author on the deformation of Frobenius with a higher rank generalisation of Kedlaya's algorithm. The analysis of the loss of precision during the algorithm uses a deep theorem of Christol and Dwork on p-adic solutions to differential systems at regular singular points. We apply our algorithm to compute the zeta functions of compactifications of certain surfaces which are double covers of the affine plane.

We study the p-form spectrum of the Laplace-Beltrami operator acting on lens spaces as considered by Ikeda [Geometry of manifolds (Academic Press, Boston, MA, 1989) 383–417]. Ikeda gave examples of such spaces that are non-isometric but isospectral for all p ≤ p0. In this paper we exhibit examples of such spaces that are not isometric, and are isospectral for various, but not for all. values of p. In particular, examples are given of non-isometric lens spaces that are isospectral for some values of p but not for the case p = 0.

Elliptic boundary value problems are well posed in suitable Sobolev spaces, if the boundary conditions satisfy the Shapiro–Lopatinskij condition. We propose here a criterion (which also covers over-determined elliptic systems) for checking this condition. We present a constructive method for computing the compatibility operator for the given boundary value problem operator, which is also necessary when checking the criterion. In the case of two independent variables we give a formulation of the criterion for the Shapiro–Lopatinskij condition which can be checked in a finite number of steps. Our approach is based on formal theory of PDEs, and we use constructive module theory and polynomial factorisation in our test. Actual computations were carried out with computer algebra systems Singular and MuPad.