Catálogo de publicaciones - libros

In this chapter we describe how was used to complete the classification of the primitive groups of degree less than 1000.

This chapter describes how [3] was used to investigate and understand a phenomenon observed when implementing a conjugacy test for elements of a braid group. These investigations ultimately lead to the discovery of a new invariant of conjugacy classes in braid groups, to an efficient way of computing this invariant, and in particular to a much more powerful conjugacy test than the one which was originally to be implemented [11].

There are many tables which summarise bounds on the parameters of error-correcting codes. We are undertaking a project to find constructions for codes with large minimum distance. In the course of the project, many algorithms to construct and search for good codes have been devised, and some are presented here. In particular, a very efficient algorithm for computing the minimum distance of a code has been developed.

There is no known polynomial time 4-colouring algorithm for planar graphs, except the algorithms that can be derived from the proofs of Appel and Robertson An alternative way to colour planar graphs is to investigate the problem of finding nowhere-zero -flows in graphs.

The following is a brief introduction to the language. It is not a comprehensive description of the language, nor is it a programming tutorial (although, inevitably, it has much in common with one).