Toward the recognition of PGL_n via a high degree of generic transitivity

From MaRDI portal
Publication:4634077



Abstract: In 2008, Borovik and Cherlin posed the problem of showing that the degree of generic transitivity of an infinite permutation group of finite Morley rank (X,G) is at most n+2 where n is the Morley rank of X. Moreover, they conjectured that the bound is only achieved (assuming transitivity) by operatornamePGLn+1(mathbbF) acting naturally on projective n-space. We solve the problem under the two additional hypotheses that (1) (X,G) is 2-transitive, and (2) (Xβˆ’x,Gx) has a definable quotient equivalent to (mathbbPnβˆ’1(mathbbF),operatornamePGLn(mathbbF)). The latter hypothesis drives the construction of the underlying projective geometry and is at the heart of an inductive approach to the main problem.












This page was built for publication: Toward the recognition of \(\mathrm{PGL}_n\) via a high degree of generic transitivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634077)