Primitive Binary Structures
Gregory Cherlin: Rutgers University
Location: Hill 705
Date & time: Monday, 27 February 2017 at 5:00PM - 5:11PM
I discuss the theory of relational complexity of finite structures, and two types of open problem: the computation of relational complexity in natural cases and the determination of the infinite families of finite primitive structures having bounded relational complexity. The first is a problem in combinatorics and the second is a problem in permutation group theory. Important progress on the second has been made recently by Gill and Spiga.