Classification conjecture for maximally generically transitive actions

Let GG be a connected group of finite Morley rank acting faithfully, definably and transitively on a set XX of Morley rank nn, and suppose the action is generically (n+2)(n+2)-transitive. Maximal generic-transitivity conjecture. The permutation group (G,X)(G,X) is definably equivalent to (PGLn+1(K),Pn(K))(\operatorname{PGL}_{n+1}(\mathbb{K}),\mathbb{P}^n(\mathbb{K})) for some definable field K\mathbb{K}. This conjecture explains the expected sharp bound on generic transitivity. It is known for n=1n=1 and n=2n=2, while the general case remains open.

Sources & referencesView supporting material

Primary source

Alexandre Borovik and Adrien Deloro, “Binding groups, permutations groups and modules of finite Morley rank”, arXiv:1909.02813 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.