The relational complexity of linear groups acting on subspaces

Author:

Freedman Saul D.1ORCID,Kelsey Veronica2,Roney-Dougal Colva M.3

Affiliation:

1. School of Mathematics and Statistics , 7486 University of St Andrews , St Andrews , KY16 9SS , United Kingdom ; and School of Mathematics, Monash University, Clayton VIC 3800, Australia

2. Department of Mathematics , 5292 University of Manchester , Manchester , M13 9PL , United Kingdom

3. School of Mathematics and Statistics , 7486 University of St Andrews , St Andrews , KY16 9SS , United Kingdom

Abstract

Abstract The relational complexity of a subgroup 𝐺 of Sym ( Ω ) \mathrm{Sym}({\Omega}) is a measure of the way in which the orbits of 𝐺 on Ω k \Omega^{k} 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 PSL n ( F ) \mathrm{PSL}_{n}(\mathbb{F}) and PGL n ( F ) \mathrm{PGL}_{n}(\mathbb{F}) , for an arbitrary field 𝔽, acting on the set of 1-dimensional subspaces of F n \mathbb{F}^{n} . We also bound the relational complexity of all groups lying between PSL n ( q ) \mathrm{PSL}_{n}(q) and P Γ L n ( q ) \mathrm{P}\Gamma\mathrm{L}_{n}(q) , and generalise these results to the action on 𝑚-spaces for m 1 m\geq 1 .

Funder

Engineering and Physical Sciences Research Council

Publisher

Walter de Gruyter GmbH

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3