Files in this item
On relational complexity and base size of finite primitive groups
Item metadata
dc.contributor.author | Kelsey, Veronica | |
dc.contributor.author | Roney-Dougal, Colva Mary | |
dc.date.accessioned | 2022-08-09T12:30:02Z | |
dc.date.available | 2022-08-09T12:30:02Z | |
dc.date.issued | 2022-08-01 | |
dc.identifier | 277355500 | |
dc.identifier | f533ebe0-c473-46f9-bdb5-2ff149da25b5 | |
dc.identifier | 85135585435 | |
dc.identifier | 000865802800005 | |
dc.identifier.citation | Kelsey , V & Roney-Dougal , C M 2022 , ' On relational complexity and base size of finite primitive groups ' , Pacific Journal of Mathematics , vol. 318 , no. 1 , pp. 89–108 . https://doi.org/10.2140/pjm.2022.318.89 | en |
dc.identifier.issn | 0030-8730 | |
dc.identifier.other | ArXiv: 2107.14208 | |
dc.identifier.other | ORCID: /0000-0002-0532-3349/work/116910434 | |
dc.identifier.uri | https://hdl.handle.net/10023/25799 | |
dc.description.abstract | In this paper we show that if G is a primitive subgroup of Sn that is not large base, then any irredundant base for G has size at most 5 log n. This is the first logarithmic bound on the size of an irredundant base for such groups, and is best possible up to a multiplicative constant. As a corollary, the relational complexity of G is at most 5 log n+1, and the maximal size of a minimal base and the height are both at most 5 log n. Furthermore, we deduce that a base for G of size at most 5 log n can be computed in polynomial time. | |
dc.format.extent | 383008 | |
dc.language.iso | eng | |
dc.relation.ispartof | Pacific Journal of Mathematics | en |
dc.subject | Permutation group | en |
dc.subject | Base size | en |
dc.subject | Relational complexity | en |
dc.subject | Computational complexity | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | On relational complexity and base size of finite primitive groups | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.contributor.institution | University of St Andrews. St Andrews GAP Centre | en |
dc.identifier.doi | 10.2140/pjm.2022.318.89 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2022-08-09 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.