Gregory Cherlin – författare

This book applies model theoretic methods to the study of certain finite permutation groups, the automorphism groups of structures for a fixed finite language with a bounded number of orbits on 4-tuples. Primitive permutation groups of this type have been classified by Kantor, Liebeck, and Macpherson, using the classification of the finite simple groups. Building on this work, Gregory Cherlin and Ehud Hrushovski here treat the general case by developing analogs of the model theoretic methods of geometric stability theory. The work lies at the juncture of permutation group theory, model theory, classical geometries, and combinatorics. The principal results are finite theorems, an associated analysis of computational issues, and an "intrinsic" characterization of the permutation groups (or finite structures) under consideration. The main finiteness theorem shows that the structures under consideration fall naturally into finitely many families, with each family parametrized by finitely many numerical invariants (dimensions of associated coordinating geometries).The authors provide a case study in the extension of methods of stable model theory to a nonstable context, related to work on Shelah's "simple theories." They also generalize Lachlan's results on stable homogeneous structures for finite relational languages, solving problems of effectivity left open by that case. Their methods involve the analysis of groups interpretable in these structures, an analog of Zilber's envelopes, and the combinatorics of the underlying geometries. Taking geometric stability theory into new territory, this book is for mathematicians interested in model theory and group theory.

The book gives a detailed presentation of the classification of the simple groups of finite Morley rank which contain a nontrivial unipotent 2-subgroup. They are linear algebraic groups over algebraically closed fields of characteristic 2. Although the story told in the book is inspired by the classification of the finite simple groups, it goes well beyond this source of inspiration. Not only do the techniques adapted from finite group theory cover, in a peculiar way, various portions of the three generations of approaches to finite simple groups but model theoretic methods also play an unexpected role. The book contains a complete account of all this material, part of which has not been published. In addition, almost every general result about groups of finite Morley rank is exposed in detail and the book ends with a chapter where the authors provide a list of open problems in the relevant fields of mathematics. As a result, the book provides food for thought to finite group theorists, model theorists, and algebraic geometers who are interested in group theoretic problems.

This is the second of two volumes by Professor Cherlin presenting the state of the art in the classification of homogeneous structures in binary languages and related problems in the intersection of model theory and combinatorics. Researchers and graduate students in the area will find in these volumes many far-reaching results and interesting new research directions to pursue. This volume continues the analysis of the first volume to 3-multi-graphs and 3-multi-tournaments, expansions of graphs and tournaments by the addition of a further binary relation. The opening chapter provides an overview of the volume, outlining the relevant results and conjectures. The author applies and extends the results of Volume I to obtain a detailed catalogue of such structures and a second classification conjecture. The book ends with an appendix exploring recent advances and open problems in the theory of homogeneous structures and related subjects.

This is the second of two volumes by Professor Cherlin presenting the state of the art in the classification of homogeneous structures in binary languages and related problems in the intersection of model theory and combinatorics. Researchers and graduate students in the area will find in these volumes many far-reaching results and interesting new research directions to pursue. This volume continues the analysis of the first volume to 3-multi-graphs and 3-multi-tournaments, expansions of graphs and tournaments by the addition of a further binary relation. The opening chapter provides an overview of the volume, outlining the relevant results and conjectures. The author applies and extends the results of Volume I to obtain a detailed catalogue of such structures and a second classification conjecture. The book ends with an appendix exploring recent advances and open problems in the theory of homogeneous structures and related subjects.

This is the first of two volumes by Professor Cherlin presenting the state of the art in the classification of homogeneous structures in binary languages and related problems in the intersection of model theory and combinatorics. Researchers and graduate students in the area will find in these volumes many far-reaching results and interesting new research directions to pursue. In this volume, Cherlin develops a complete classification of homogeneous ordered graphs and provides a full proof. He then proposes a new family of metrically homogeneous graphs, a weakening of the usual homogeneity condition. A general classification conjecture is presented, together with general structure theory and applications to a general classification conjecture for such graphs. It also includes introductory chapters giving an overview of the results and methods of both volumes, and an appendix surveying recent developments in the area. An extensive accompanying bibliography of related literature, organized by topic, is available online.