activity
20152026
most citedOn the generalized Fitting height and insoluble length of finite groups

6 citations · 17 across the 17 of their papers we have counts for

collaborators

25 papers

math.GR2026

Forcible groups and Frattini covers

Sean Eberhard, Robert M. Guralnick, Carl Schildkraut +1

We say that a finite group *forces* a finite group if every finite cover of contains a subgroup isomorphic to , and we say is *forcible* if some finite group …

math.GR2024

The Chebotarev invariant for direct products of nonabelian finite simple groups

Jessica Anzanello, Andrea Lucchini, Gareth Tracey

A subset of a finite group invariably generates if generates for every choice of . The Chebotarev…

math.GR2023

The pro-supersolvable topology on a free group: deciding denseness

Claude Marion, Pedro V. Silva, Gareth Tracey

Let be a free group of arbitrary rank and let be a finitely generated subgroup of . Given a pseudovariety of finite groups, i.e. a class of finite groups cl…

math.GR2023

On the closure of cyclic subgroups of a free group in pro-V topologies

Claude Marion, Pedro V. Silva, Gareth Tracey

We determine the closure of a cyclic subgroup of a free group for the pro-{\bf V} topology when {\bf V} is an extension-closed pseudovariety of finite groups. We show that …

math.GR2023★ 1 cited

The pro--solvable topology on a free group

Claude Marion, Pedro V. Silva, Gareth Tracey

We prove that, given a finitely generated subgroup of a free group , the following questions are decidable: is closed (dense) in for the pro-(met)abelian topology? i…

math.GR2023

On the pseudovariety of groups

Claude Marion, Pedro V. Silva, Gareth Tracey

We introduce the pseudovariety of finite groups , where is the set of all primes.…

math.GR2021

Comparing the order and the minimal number of generators of a finite irreducible linear group

Derek Holt, Gareth Tracey

We prove that for irreducible subgroups of GL, and estimate the associated constants. The result is motivated by attempts to bound the co…

math.GR2021★ 3 cited

Totally -closed finite groups with trivial Fitting subgroup

Majid Arezoomand, Mohammad A. Iranmanesh, Cheryl E. Praeger +1

A group is said to be totally -closed if in each of its faithful permutation representations, say on a set , is the largest subgroup of which leaves…

math.GR2021★ 1 cited

On the proportion of -elements in a finite group, and a modular Jordan type theorem

Gareth Tracey

In 1878, Jordan proved that if a finite group has a faithful representation of dimension over , then has a normal abelian subgroup with index bounded above…

math.GR2021

The transitive groups of degree 48 and some applications

Derek Holt, Gordon Royle, Gareth Tracey

The primary purpose of this paper is to report on the successful enumeration in Magma of representatives of the conjugacy classes of transitive subgroups of the sym…

math.GR2021★ 3 cited

Sharp upper bounds on the minimal number of elements required to generate a transitive permutation group

Gareth Tracey

The purpose of this paper is to prove that if is a transitive permutation group of degree , then can be generated by elements, w…

math.GR2021

Some simplifications in the proof of the Sims conjecture

László Pyber, Gareth Tracey

We prove an elementary lemma concerning primitive amalgams and use it to greatly simplify the proof of the Sims conjecture in the case of almost simple groups.

math.GR2020

Locally finite -groups with a left 3-Engel element whose normal closure is not nilpotent

Anastasia Hadjievangelou, Marialaura Noce, Gunnar Traustason

For any odd prime , we give an example of a locally finite -group containing a left 3-Engel element where is not nilpotent.

math.GR2020

An upper bound on the Chebotarev invariant of a finite group

Andrea Lucchini, Gareth Tracey

A subset of a finite group invariably generates if the set generates for every choice of . The Che…

math.GR2020

Left -Engel elements in groups of exponent

Gareth Tracey, Gunnar Traustason

Let be a group and let be a left -Engel element of order dividing . Suppose furthermore that has no elements of order , and .…

math.GR2020★ 1 cited

On finite totally 2-closed groups

Alireza Abdollahi, Majid Arezoomand, Gareth Tracey

An abstract group is called totally -closed if for any set with , where is the largest subgroup of who…

math.GR2019

Engel elements in weakly branch groups

Gustavo A. Fernández-Alcober, Marialaura Noce, Gareth M. Tracey

We study properties of Engel elements in weakly branch groups, lying in the group of automorphisms of a spherically homogeneous rooted tree. More precisely, we prove that the set o…

math.GR2019★ 6 cited

On the generalized Fitting height and insoluble length of finite groups

Robert M. Guralnick, Gareth Tracey

We prove two conjectures of E. Khukhro and P. Shumyatsky concerning the Fitting height and insoluble length of finite groups. As a by-product of our methods, we also prove a genera…

math.GR2018

A left -Engel element whose normal closure is not nilpotent

Marialaura Noce, Gareth M. Tracey, Gunnar Traustason

We give an example of a locally nilpotent group containing a left -Engel element where is not nilpotent.

math.GR2018

Finite groups with large Chebotarev invariant

Andrea Lucchini, Gareth Tracey

A subset of a finite group is said to invariably generate if the set generates for every choice of $x_i \in G…

math.GR2018★ 1 cited

Generating maximal subgroups of finite almost simple groups

Andrea Lucchini, Claude Marion, Gareth Tracey

For a finite group , let denote the minimal number of elements required to generate . In this paper, given a finite almost simple group and any maximal subgroup $H…

math.GR2018

Invariable generation of permutation and linear groups

Gareth M. Tracey

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group \emph{invariably generates} if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates …

math.GR2016★ 1 cited

Comparing the order and the minimal number of generators of a transitive permutation group

Gareth M. Tracey

We prove that if is a transitive permutation group, then tends to as tends to .

math.GR2015

Generating minimally transitive permutation groups

Gareth M. Tracey

We improve the upper bounds (in terms of ) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree .