English

On the probability of generating invariably a finite simple group

Group Theory 2022-11-17 v3

Abstract

Let GG be a finite simple group. In this paper we consider the existence of small subsets AA of GG with the property that, if yGy \in G is chosen uniformly at random, then with high probability yy invariably generates GG together with some element of AA. We prove various results in this direction, both positive and negative. As a corollary, we prove that two randomly chosen elements of a finite simple group of Lie type of bounded rank invariably generate with probability bounded away from zero. Our method is based on the positive solution of the Boston--Shalev conjecture by Fulman and Guralnick, as well as on certain connections between the properties of invariable generation of a group of Lie type and the structure of its Weyl group.

Keywords

Cite

@article{arxiv.2008.03812,
  title  = {On the probability of generating invariably a finite simple group},
  author = {Daniele Garzoni and Eilidh McKemmie},
  journal= {arXiv preprint arXiv:2008.03812},
  year   = {2022}
}

Comments

41 pp.; incorporated referees' comments