报告人：黄弘毅博士（英国布里斯托大学）

时 间：2024年12月24日 10:30-11:30

地 点：海纳苑2幢820

摘 要: There are two natural ways to break all the non-trivial symmetries of a graph: pointwise and setwise, which involve the base size and the distinguishing number of a permutation group, respectively. These two invariants have been investigated for many decades, finding a wide range of applications. In this talk, I will highlight some probabilistic approaches to study these two invariants. In particular, I will give the first family of primitive groups arising in the O'Nan-Scott theorem for which the exact base size has been computed in all cases.