Computational Algebra Seminar: Rekvenyi -- An algebraic generalisation of a graph theory problem

Speaker: Kamilla Rekvenyi (Manchester)
Title: An algebraic generalisation of a graph theory problem
Time & Place: 15.00-16-00, Thursday 19 Feb, Carslaw 535 - BEWARE UNUSUAL ROOM
Abstract:
In this talk, I will introduce a new permutation-group invariant inspired by a classical
problem in graph theory. Specifically, for a transitive permutation group G acting on a 
set Ω, we define the parameter sep(G), which denotes the size of the smallest set of 
points A⊆Ω such that, for every permutation g in G, the intersection of A with its 
image A^g is nonempty. I will present recent results concerning this parameter.

This is joint work with Marco Barbieri, Maruša Lekše, and Primož Potočnik.