For a finite group acting on a finite set, a statistic called relational complexity can be calculated for the action. This notion was defined by Gregory Cherlin and motivated by considerations in model theory. Another related statistic is the height of the action, which provides an upper bound for relational complexity. In this thesis, both concepts are defined and some basic results proved. The main focus later on is examining the primitive actions of P SL2(q) and P GL2(q) and computing both the height and relational complexity for each one.
|Date of Award
|Nick Gill (Supervisor), Pablo Spiga (Supervisor) & Paul Roach (Supervisor)