On the complexity of the isomorphism relation for finitely generated groups

38Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Confirming a conjecture of G. Hjorth and A. Kechris (1996, Ann. Pure Appl. Logic82, 221-272) we prove that the isomorphism relation for finitely generated groups is a universal essentially countable Borel equivalence relation. We also prove the corresponding result for the conjugacy relation for subgroups of the free group F2 on two generators. © 1999 Academic Press.

References Powered by Scopus

Ergodic equivalence relations, cohomology, and von neumann algebras. I

416Citations
N/AReaders
Get full text

The structure of hyperfinite borel equivalence relations

144Citations
N/AReaders
Get full text

Borel equivalence relations and classifications of countable models

58Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Decomposing locally compact groups into simple pieces

55Citations
N/AReaders
Get full text

The classification problem for torsion-free abelian groups of finite rank

51Citations
N/AReaders
Get full text

Complete analytic equivalence relations

42Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Thomas, S., & Velickovic, B. (1999). On the complexity of the isomorphism relation for finitely generated groups. Journal of Algebra, 217(1), 352–373. https://doi.org/10.1006/jabr.1998.7825

Readers over time

‘10‘11‘12‘14‘17‘2100.250.50.751

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

50%

PhD / Post grad / Masters / Doc 2

33%

Researcher 1

17%

Readers' Discipline

Tooltip

Mathematics 5

100%

Save time finding and organizing research with Mendeley

Sign up for free
0