Dr Peter Sin, University of Florida
Title: : Erdos-Ko-Rado theorems for permuation groups
The Erdos-Ko-Rado Theorem is a fundamental result in extremal set theory that characterizes the largest possible families of subsets of fixed size in a give set such that any two subsets in the family have nonempty intersection.
The idea of maximum intersecting families can be extended to many contexts, including permutation groups. We shall describe some analogues of the EKR Theorem for 2-transitive permutation groups.