English

The relational complexity of linear groups acting on subspaces

Group Theory 2024-12-06 v2

Abstract

The relational complexity of a subgroup GG of Sym(Ω)\mathrm{Sym}(\Omega) is a measure of the way in which the orbits of GG on Ωk\Omega^k for various kk determine the original action of GG. Very few precise values of relational complexity are known. This paper determines the exact relational complexity of all groups lying between PSLn(F)\mathrm{PSL}_{n}(\mathbb{F}) and PGLn(F)\mathrm{PGL}_{n}(\mathbb{F}), for an arbitrary field F\mathbb{F}, acting on the set of 11-dimensional subspaces of Fn\mathbb{F}^n. We also bound the relational complexity of all groups lying between PSLn(q)\mathrm{PSL}_{n}(q) and PΓLn(q)\mathrm{P}\Gamma\mathrm{L}_{n}(q), and generalise these results to the action on mm-spaces for m1m \ge 1.

Keywords

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

R2 v1 2026-06-28T12:34:28.757Z