Files in this item
Irredundant bases for the symmetric group
Item metadata
dc.contributor.author | Roney-Dougal, Colva | |
dc.contributor.author | Wu, Peiran | |
dc.date.accessioned | 2024-03-20T17:30:09Z | |
dc.date.available | 2024-03-20T17:30:09Z | |
dc.date.issued | 2024-03-20 | |
dc.identifier | 298978502 | |
dc.identifier | b7d7df8d-5c47-4a8e-8589-01c08444d847 | |
dc.identifier | 85188647904 | |
dc.identifier.citation | Roney-Dougal , C & Wu , P 2024 , ' Irredundant bases for the symmetric group ' , Bulletin of the London Mathematical Society , vol. Early View . https://doi.org/10.1112/blms.13027 | en |
dc.identifier.issn | 0024-6093 | |
dc.identifier.other | ORCID: /0000-0002-0532-3349/work/156133749 | |
dc.identifier.uri | https://hdl.handle.net/10023/29536 | |
dc.description | Funding: This work was supported by EPSRC grant No EP/R014604/1, and also partially supported by a grant from the Simons Foundation. | en |
dc.description.abstract | An irredundant base of a group acting faithfully on a finite set Γ is a sequence of points in Γ that produces a strictly descending chain of pointwise stabiliser sub-groups in ,terminating at the trivial subgroup. Suppose that is S or A acting primitively on Γ, and that the point stabiliser is primitive in its natural action onpoints. We prove that the maximum size of an irredundant base of is (√),and in most cases ((log)2). We also show that these bounds are best possible. | |
dc.format.extent | 15 | |
dc.format.extent | 191423 | |
dc.language.iso | eng | |
dc.relation.ispartof | Bulletin of the London Mathematical Society | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Irredundant bases for the symmetric group | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.identifier.doi | https://doi.org/10.1112/blms.13027 | |
dc.description.status | Peer reviewed | en |
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.