Primitive pseudo-finite permutation groups of finite SU-rank
Logic
2025-11-25 v2 Group Theory
Abstract
We study definably primitive pseudo-finite permutation groups of finite -rank. We show that if is such a permutation group, then the rank of can be bounded in terms of the rank of , providing an analogue of a theorem of Borovik and Cherlin in the setting of definably primitive permutation groups of finite Morley rank.
Keywords
Cite
@article{arxiv.2504.08501,
title = {Primitive pseudo-finite permutation groups of finite SU-rank},
author = {Ulla Karhumäki and Nicholas Ramsey},
journal= {arXiv preprint arXiv:2504.08501},
year = {2025}
}