Show simple item record

Files in this item

Thumbnail
Name:
Freedman-2024-Relational-complexity-of-linear-JGT-20230262-CCBY.pdf
Size:
324.6Kb
Format:
PDF
View/Open

The relational complexity of linear groups acting on subspaces

Item metadata

dc.contributor.authorFreedman, Saul Daniel
dc.contributor.authorKelsey, Veronica
dc.contributor.authorRoney-Dougal, Colva
dc.date.accessioned2024-03-12T10:30:09Z
dc.date.available2024-03-12T10:30:09Z
dc.date.issued2024-02-14
dc.identifier298322847
dc.identifierb1d6c708-a36c-4eda-966c-acf4089d9ae7
dc.identifier85185327185
dc.identifier.citationFreedman , S D , Kelsey , V & Roney-Dougal , C 2024 , ' The relational complexity of linear groups acting on subspaces ' , Journal of Group Theory , vol. Ahead of Print . https://doi.org/10.1515/jgth-2023-0262en
dc.identifier.issn1433-5883
dc.identifier.otherORCID: /0000-0002-0532-3349/work/155627483
dc.identifier.urihttps://hdl.handle.net/10023/29471
dc.descriptionFunding: This work was supported by EPSRC grant no. EP/R014604/1, and also partially supported by a grant from the Simons Foundation. The first author was supported by the University of St Andrews (St Leonard’s International Doctoral Fees Scholarship & School of Mathematics and Statistics PhD Funding Scholarship), and by EPSRC grant no. EP/W522422/1. The second author is funded by the Heilbronn Institute.en
dc.description.abstractThe relational complexity of a subgroup G of Sym(Ω) is a measure of the way in which the orbits of G on Ω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 PSLn() and PGLn(), for an arbitrary field , acting on the set of 1-dimensional subspaces of n. We also bound the relational complexity of all groups lying between PSLn(q) and PΓLn(q), and generalise these results to the action on m-spaces for m at least 1.
dc.format.extent29
dc.format.extent332406
dc.language.isoeng
dc.relation.ispartofJournal of Group Theoryen
dc.subjectRelational complexityen
dc.subjectLinear groupsen
dc.subjectSubspace actionsen
dc.subjectQA Mathematicsen
dc.subjectT-NDASen
dc.subject.lccQAen
dc.titleThe relational complexity of linear groups acting on subspacesen
dc.typeJournal articleen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.contributor.institutionUniversity of St Andrews. St Andrews GAP Centreen
dc.identifier.doi10.1515/jgth-2023-0262
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.