• Speaker: Prof. AndrĂ© Nies, Department of Computer Science, The University of Auckland
  • Title: The complexity of the isomorphism problem for t.d.l.c. and other types of groups
  • Location: Room V205, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 4:00 pm, Thu, 1st Jun 2017
  • Abstract:

    We determine the Borel complexity of the topological isomorphism problem for profinite, t.d.l.c., and Roelcke precompact non-Archimedean groups, by showing it is equivalent to graph isomorphism.

    For oligomorphic groups we merely establish this as an upper bound.

    Joint work with Kechris and Tent.

  • [Permanent link]