Samuel Coskey: Conjugacy and homogeneous graphs, II

Wednesday, February 4 from 3 to 4pm
Room: Math 124
Speaker: Samuel Coskey (BSU)
Title: Conjugacy and homogeneous graphs, II

Abstract: This talk is continued from last semester. We study the conjugacy relation on the automorphism group of a homogeneous structure from the point of view of Borel complexity theory. In particular, we present three examples of homogeneous graphs whose corresponding conjugacy problems have three different complexities.

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.