THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM
Keyword(s):
AbstractWe study the complexity of the topological isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Borel spaces. For profinite, locally compact, and Roelcke precompact groups, we show that the complexity is the same as the one of countable graph isomorphism. For oligomorphic groups, we merely establish this as an upper bound.
Keyword(s):
2008 ◽
Vol 78
(1)
◽
pp. 171-176
◽
ON THE DENSITY OF HAUSDORFF DIMENSIONS OF BOUNDED TYPE CONTINUED FRACTION SETS: THE TEXAN CONJECTURE
2004 ◽
Vol 04
(01)
◽
pp. 63-76
◽
Keyword(s):
Keyword(s):
1977 ◽
Vol 18
(2)
◽
pp. 199-207
◽