activity
20172021
most citedOn random presentations with fixed relator length

2 citations · 3 across the 2 of their papers we have counts for

collaborators

7 papers

math.GR2021

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.…

math.GR2020

The non-commuting, non-generating graph of a nilpotent group

Peter J. Cameron, Saul D. Freedman, Colva M. Roney-Dougal

For a nilpotent group , let be the difference between the complement of the generating graph of and the commuting graph of , with vertices corresponding to central…

math.GR20201 cited

Maximal Cocliques in the Generating Graphs of the Alternating and Symmetric Groups

Veronica Kelsey, Colva M. Roney-Dougal

The generating graph of a finite group has vertex set the non-identity elements of , with two elements connected exactly when they generate . A coclique in a graph…

math.GR2020

Normalisers of primitive permutation groups in quasipolynomial time

Colva Roney-Dougal, Sergio Siccha

We show that given generators for subgroups and of , if is primitive then generators for may be computed in quasipolynomial time, namely…

math.GR2019

Polynomial-time proofs that groups are hyperbolic

Derek Holt, Stephen Linton, Max Neunhoeffer +3

It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kam…

math.GR2018

Involution centralisers in finite unitary groups of odd characteristic

S. P. Glasby, Cheryl E. Praeger, Colva M. Roney-Dougal

We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random ele…