BIRS Workshop Lecture Videos
On the relational complexity of a finite permutation group Gill, Nick
Motivated by questions in model theory, Greg Cherlin introduced the idea of â relational complexityâ , a statistic connected to finite permutation groups. He also stated a conjecture classifying those permutation groups with minimal relational complexity. We report on recent progress towards a proof of this conjecture. We also make some remarks about permutation groups with large relational complexity, and we explain how this statistic relates to others in the literature, notably base-size.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International