The relational complexity of linear groups acting on subspaces
arXiv:2309.16111 · doi:10.1515/jgth-2023-0262
Abstract
The relational complexity of a subgroup of is a measure of the way in which the orbits of on for various determine the original action of . Very few precise values of relational complexity are known. This paper determines the exact relational complexity of all groups lying between and , for an arbitrary field , acting on the set of -dimensional subspaces of . We also bound the relational complexity of all groups lying between and , and generalise these results to the action on -spaces for .
20 pages. Version 2: minor changes incorporating referee comments. To appear in J. Group Theory