9 citations · 43 across the 22 of their papers we have counts for
4 papers · 1 filter
Computing normalisers of intransitive groups
Mun See Chang, Christopher Jefferson, Colva M. Roney-Dougal
The normaliser problem takes as input subgroups and of the symmetric group , and asks one to compute . The fastest known algorithm for this problem is simply e…
On relational complexity and base size of finite primitive groups
Veronica Kelsey, Colva M. Roney-Dougal
In this paper we show that if is a primitive subgroup of that is not large base, then any irredundant base for has size at most . This is the first logari…
Primitive normalisers in quasipolynomial time
Mun See Chang, Colva M. Roney-Dougal
The normaliser problem has as input two subgroups and of the symmetric group , and asks for a generating set for : it is not known to have a subexponential tim…
Base sizes of primitive permutation groups
Mariapia Moscatiello, Colva M. Roney-Dougal
Let G be a permutation group, acting on a set Ωof size n. A subset B of Ωis a base for G if the pointwise stabilizer G_(B) is trivial. Let b(G) be the minimal size of a base for G.…