In this talk, we will mainly focus on its applications in group theory. We will begin by introducing the main idea of the probabilistic method. Then we will see how this method is applied to various group theory problems. The first application concerns the generation of finite simple groups. This includes the random generation and the (2,3)-generation of finite simple groups. In the second application, we will consider the probabilistic method introduced by Liebeck and Shalev in the 1990s to prove Camerons conjecture on base sizes for almost simple primitive groups. Finally, if time permits, we will look at a new concept, the Saxl graph, related to bases for permutation groups. We will see some new results in a recent joint work with Tim Burness on the Saxl graph using the probabilistic method. 

简介

黄弘毅，2020 年73882必赢网页版于南方科技大学获得理学学士学位，现为University of Bristol博士研究生。