This book gives a proof of Cherlins conjecture for finite binary primitive permutation groups. Motivated by the part of model theory concerned with Lachlans theory of finite homogeneous relational structures, this conjecture proposes a classification of those finite primitive permutation groups that have relational complexity equal to 2.
The first part gives a full introduction to Cherlins conjecture, including all the key ideas that have been used in the literature to prove some of its special cases. The second part completes the proof by dealing with primitive permutation groups that are almost simple with socle a group of Lie type. A great deal of material concerning properties of primitive permutation groups and almost simple groups is included, and new ideas are introduced.
Addressing a hot topic which cuts across the disciplines of group theory, model theory and logic, this book will be of interest to a wide range of readers. It will be particularly useful for graduate students and researchers who need to work with simple groups of Lie type.
Recenzijas
This monograph proves an attractive conjecture of G. L. Cherlin on finite permutation groups, motivated by model theory. (H. Dugald Macpherson, Mathematical Reviews, November, 2023)
1. Introduction.- 2. Preliminary Results for Groups of Lie Type.-
3. Exceptional Groups.- 4. Classical Groups.
Nick Gill is a Lecturer in Pure Mathematics at the Open University. Martin Liebeck has been Professor of Pure Mathematics at Imperial College London for over 30 years. He haspublished over 150 research articles and 10 books. His research interests include group theory, combinatorics and computational algebra. He was elected Fellow of the America Mathematical Society in 2019, and was awarded the London Mathematical Society's Polya Prize in 2020. Pablo Spiga is Professor of Mathematics at the University of Milano-Bicocca. His main research interests involve group actions on graphs and other combinatorial structures. His main expertise is within finite primitive groups and their application for investigating symmetries of combinatorial structures.
Biežāk uzdotie jautājumi par e-grāmatām