The relational complexity of linear groups acting on subspaces
Group Theory
2024-12-06 v2
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 .
Cite
@article{arxiv.2309.16111,
title = {The relational complexity of linear groups acting on subspaces},
author = {Saul D. Freedman and Veronica Kelsey and Colva M. Roney-Dougal},
journal= {arXiv preprint arXiv:2309.16111},
year = {2024}
}
Comments
20 pages. Version 2: minor changes incorporating referee comments. To appear in J. Group Theory