Computational Algebra and Number Theory

Includes bibliography

1 Calculating Growth Functions for Groups Using Automata.- 2 The Minimal Faithful Degree of a Finite Commutative Inverse Semigroup.- 3 Generalisations of the Todd-Coxeter Algorithm.- 4 Computing Left Kan Extensions Using the Todd—Coxeter Procedure.- 5 Computing Finite Soluble Quotients.- 6 Computing Automorphism Groups of p-Groups.- 7 The Art and Science of Computing in Large Groups.- 8 Does the Set of Points of an Elliptic Curve Determine the Group?.- 9 An Implementation of the Elliptic Curve Integer Factorization Method.- 10 Continued Fractions of Algebraic Numbers.- 11 Bounds for Class Numbers of Quadratic Orders.- 12 Short Representation of Quadratic Integers.- 13 A Density Conjecture for the Negative Pell Equation.- 14 Computing Aurifeuillian Factors.- 15 Computation of Cyclotomic Polynomials with Magma.- 16 On Some Characteristics of Uniformity of Distribution and Their Applications.- 17 Recent Progress on Consistency Testing for Polynomial Systems.- 18 A New Generalisation of the Kummer Congruence.- 19 Series Expansions of Algebraic Functions.- 20 Generation of Cocyclic Hadamard Matrices.- 21 Large Cayley Graphs and Digraphs with Small Degree and Diameter.- 22 Hyperbolic Pyritohedra Constructed from the Coxeter Group [4,3,5].

Computers have stretched the limits of what is possible in mathematics. More than that, they have given rise to new fields of mathematical study: the analysis of new and traditional algorithms; the creation of new paradigms for implementing computational methods; and the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory.