Mathematics Seminar - 09/11/26

Abstract: This talk shows how to bound the size of a permutation group acting on n elements by 2^0.98n times the product of certain unavoidable factorials. To do so, we exploit binary constraints for the images of pairs of blocks, as well as a consequence of the classification of finite simple groups. The unavoidable factorials can be clearly identified, but the more technical aspects will be replaced with life advice and stand up comedy. Nonetheless, this is a significant step towards a possible resolution of the Automorphism Conjecture for ordered sets.