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.

Our focus in this work is to investigate an efficient state estimation scheme for a singularly perturbed stochastic hybrid system. As stochastic hybrid systems have been used recently in diverse areas, the importance of correct and efficient estimation of such systems cannot be overemphasized. The framework of nonlinear filtering provides a suitable ground for on-line estimation. With the help of intrinsic multiscale properties of a system, we obtain an efficient estimation scheme for a stochastic hybrid system.

Until recently, the ‘plus part’ of the class numbers of cyclotomic fields had only been determined for fields of root discriminant small enough to be treated by Odlyzko’s discriminant bounds.

However, by finding lower bounds for sums over prime ideals of the Hilbert class field, we can now establish upper bounds for class numbers of fields of larger discriminant. This new analytic upper bound, together with algebraic arguments concerning the divisibility properties of class numbers, allows us to unconditionally determine the class numbers of many cyclotomic fields that had previously been untreatable by any known method.

In this paper, we study in particular the cyclotomic fields of composite conductor.

We apply a method of positive quadratic forms based on polynomial inequalities to establish sharp explicit bounds on the envelope of Hermite polynomials in the oscillatory region |x| < (2k – 3/2)1/2.

This paper is concerned with (2, 3, 7)-generated linear groups of ranks less than 287. In particular, sixty new values of n are found, such that the groups SLn (q) are Hurwitz for any prime power q. This result provides the next step in deciding which classical groups are Hurwitz.

In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thomé, a quasi-polynomial time algorithm is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of the algorithm is based on several heuristics presented in their paper. We show that some of the heuristics are problematic in their original forms, in particular when the field is not a Kummer extension. We propose a fix to the algorithm in non-Kummer cases, without altering the heuristic quasi-polynomial time complexity. Further study is required in order to fully understand the effectiveness of the new approach.

If (Q, A) is a marked polygon with one interior point, then a general polynomial f belonging to K[x,y] with support A defines an elliptic curve Cf on the toric surface XA. If K has a non-archimedean valuation into R we can tropicalize Cf to get a tropical curve Trop(Cf). If in the Newton subdivision induced by f is a triangulation and the interior point occurs as the vertex of a triangle, then Trop(Cf) will be a graph of genus one and we show that the lattice length of the cycle of that graph is the negative of the valuation of the j-invariant of Cf.

In this paper, the Brauer trees are completed for the sporadic simple Lyons group Ly in characteristics 37 and 67. The results are obtained using tools from computational representation theory—in particular, a new condensation technique—and with the assistance of the computer algebra systems MeatAxe and GAP.

We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3) field operations and O(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We compare features of the algorithm with several other algorithms in the literature. In addition we present a deterministic verification procedure which is similarly efficient in most cases but has a worst-case complexity of O(n4). Finally, we report the results of practical experiments with an implementation of our algorithms in comparison with the current algorithms in the GAP library.

We compute equations for real multiplication on the divisor classes of genus-2 curves via algebraic correspondences. We do so by implementing van Wamelen’s method for computing equations for endomorphisms of Jacobians on examples drawn from the algebraic models for Hilbert modular surfaces computed by Elkies and Kumar. We also compute a correspondence over the universal family for the Hilbert modular surface of discriminant $5$ and use our equations to prove a conjecture of A. Wright on dynamics over the moduli space of Riemann surfaces.

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.

We outline an algorithm to compute $\unicode[STIX]{x1D703}(z,\unicode[STIX]{x1D70F})$ in genus two in quasi-linear time, borrowing ideas from the algorithm for theta constants and the one for $\unicode[STIX]{x1D703}(z,\unicode[STIX]{x1D70F})$ in genus one. Our implementation shows a large speed-up for precisions as low as a few thousand decimal digits. We also lay out a strategy to generalize this algorithm to genus $g$.

Let $C/\mathbf{Q}$ be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of $\mathbf{Q}$, but may not have a hyperelliptic model of the usual form over $\mathbf{Q}$. We describe an algorithm that computes the local zeta functions of $C$ at all odd primes of good reduction up to a prescribed bound $N$. The algorithm relies on an adaptation of the ‘accumulating remainder tree’ to matrices with entries in a quadratic field. We report on an implementation and compare its performance to previous algorithms for the ordinary hyperelliptic case.

We discuss a novel strategy for computing the eigenvalues and eigenfunctions of the relativistic Dirac operator with a radially symmetric potential. The virtues of this strategy lie in the fact that it avoids completely the phenomenon of spectral pollution and it always provides two-sided estimates for the eigenvalues with explicit error bounds on both eigenvalues and eigenfunctions. We also discuss convergence rates of the method and illustrate our results with various numerical experiments.

Let G be finite group and K a number field or a p-adic field with ring of integers OK. In the first part of the manuscript we present an algorithm that computes the relative algebraic K-group K0(OK[G], K) as an abstract abelian group. We also give algorithms to solve the discrete logarithm problems in K0(OK[G], K) and in the locally free class group cl(OK[G]). All algorithms have been implemented in Magma for the case K = Q.

In the second part of the manuscript we prove formulae for the torsion subgroup of K0(Z[G], Q) for large classes of dihedral and quaternion groups.

This paper demonstrates the application of a new higher-order weak approximation, called the Kusuoka approximation, with discrete random variables to non-commutative multi-factor models. Our experiments show that using the Heath–Jarrow–Morton model to price interest-rate derivatives can be practically feasible if the Kusuoka approximation is used along with the tree-based branching algorithm.

Prior to this paper, all small simple groups were known to be efficient, but the status of four of their covering groups was unknown. Nice, efficient presentations are provided in this paper for all of these groups, resolving the previously unknown cases. The authors‘presentations are better than those that were previously available, in terms of both length and computational properties. In many cases, these presentations have minimal possible length. The results presented here are based on major amounts of computation. Substantial use is made of systems for computational group theory and, in partic-ular, of computer implementations of coset enumeration. To assist in reducing the number of relators, theorems are provided to enable the amalgamation of power relations in certain presentations. The paper concludes with a selection of unsolved problems about efficient presentations for simple groups and their covers.

Let $UY_{n}(q)$ be a Sylow $p$-subgroup of an untwisted Chevalley group $Y_{n}(q)$ of rank $n$ defined over $\mathbb{F}_{q}$ where $q$ is a power of a prime $p$. We partition the set $\text{Irr}(UY_{n}(q))$ of irreducible characters of $UY_{n}(q)$ into families indexed by antichains of positive roots of the root system of type $Y_{n}$. We focus our attention on the families of characters of $UY_{n}(q)$ which are indexed by antichains of length $1$. Then for each positive root $\unicode[STIX]{x1D6FC}$ we establish a one-to-one correspondence between the minimal degree members of the family indexed by $\unicode[STIX]{x1D6FC}$ and the linear characters of a certain subquotient $\overline{T}_{\unicode[STIX]{x1D6FC}}$ of $UY_{n}(q)$. For $Y_{n}=A_{n}$ our single root character construction recovers, among other things, the elementary supercharacters of these groups. Most importantly, though, this paper lays the groundwork for our classification of the elements of $\text{Irr}(UE_{i}(q))$, $6\leqslant i\leqslant 8$, and $\text{Irr}(UF_{4}(q))$.

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$.

In a paper of 1933, D. H. Lehmer continued Pierce's study of integral sequences associated to polynomials generalizing the Mersenne sequence. He developed divisibility criteria, and suggested that prime apparition in these sequences — or in closely related sequences — would be denser if the polynomials were close to cyclotomic, using a natural measure of closeness.

We review briefly some of the main developments since Lehmer's paper, and report on further computational work on these sequences. In particular, we use Mossinghoff's collection of polynomials with smallest known measure to assemble evidence for the distribution of primes in these sequences predicted by standard heuristic arguments.

The calculations lend weight to standard conjectures about Mersenne primes, and the use of polynomials with small measure permits much larger numbers of primes to be generated than in the Mersenne case.