加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本