arXiv · 2309.16111
The relational complexity of linear groups acting on subspaces
Abstract
The relational complexity of a subgroup $G$ of $\mathrm{Sym}(\Omega)$ is a measure of the way in which the orbits of $G$ on $\Omega^k$ for various $k$ determine the original action of $G$. Very few precise values of relational complexity are known. This paper determines the exact relational complexity of all groups lying between $\mathrm{PSL}_{n}(\mathbb{F})$ and $\mathrm{PGL}_{n}(\mathbb{F})$, for an arbitrary field $\mathbb{F}$, acting on the set of $1$-dimensional subspaces of $\mathbb{F}^n$. We also bound the relational complexity of all groups lying between $\mathrm{PSL}_{n}(q)$ and $\mathrm{P}\Gamma\mathrm{L}_{n}(q)$, and generalise these results to the action on $m$-spaces for $m \ge 1$.
Explore related subjects
Keep this discovery
Saul D. Freedman, Veronica Kelsey, Colva M. Roney-Dougal. 2023-09-28. The relational complexity of linear groups acting on subspaces. https://doi.org/10.1515/jgth-2023-0262
Cite the original work for its findings. Save a collection to share your selection of sources.