- The Management Challenge Online (TMCO) is a ten week online management course that begins for a cohort of 30 in the week immediately following their attendance at a residential t...
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
We study what kinds of limits are preserved by the greatest semilattice image functor from the category of all semigroups to its subcategory of all semilattices. The second autho...
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...