Charlotte Scott Centre for Algebra

** Dr Henry Bradford** (Georg-August-Universität Göttingen) visited Lincoln on 20th of December 2017. He gave a talk “*Diameter & Navigation in Finite Cayley Graphs*”.

*Abstract*: Cayley graphs of finite groups are a rich source of examples of sparse graphs of small diameter, which are of interest in cryptography, computational group theory and various combinatorial puzzles. In such applications one often further asks for a fast “navigation” algorithm, that is an algorithm which writes a given element of the group as a short word in a generating set. In this talk I will introduce a framework for the design and analysis of such algorithms in many familiar finite groups, using tools from pro-*p* group theory.

## Leave a Reply