CARMA Seminar

4:00 pm

Thursday, 1st Jun 2017

V205, Mathematics Building


Prof. André Nies

(Department of Computer Science, The University of Auckland)

The complexity of the isomorphism problem for t.d.l.c. and other types of groups

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.