Algebra & Combinatorics Seminars take place on Wednesday afternoons at 4pm in Lecture Theatre B (unless otherwise indicated).
(See also the Pure Mathematics Colloquium page for other seminars.)
Abstract
I will discuss the role of just non-P groups in the study of infinite groups and survey some results in this area. I will present some new results classifying certain just non-(virtually abelian) groups and give some examples illustrating the behaviour of these groups.
Abstract
Mal'cev showed in the 1950s that there is a correspondence between radicable torsion-free nilpotent groups and rational nilpotent Lie algebras. In this talk I will show how to establish the connection between the radicable hull of a finitely generated torsion-free nilpotent group and its corresponding Lie algebra algorithmically. I will apply it to fast multiplication of elements of polycyclically presented groups.
Abstract
In this talk I show that given a matrix group G of low dimensions over a finite field, there exists at least one Aschbacher class containing G for which one can find all of the corresponding geometries that are preserved by G. For several Aschbacher classes one can find all ways in which G is a member of that class, irrespective of whether G is a member of another class. This has applications to backtrack search.
This is joint work with Steve Linton.
Abstract
While constraint programming is a powerful tool for solving both industrial and mathematical problems, refining a problem specification into a constraint program is a complex and time-consuming task, which has a small number of expert practitioners. Even if a number of distinct models can be chosen, it is difficult for even experts to chose which will perform best without simply running each of them on multiple models. This talk show how a theoretical framework for constraint programs and how constraint solvers can show that in many cases it is possible to prove how one model will dominate another, and when adding extra features to a model will not improve the performance.